The complexity of sparse sets in P
Proc. of the conference on Structure in complexity theory
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Solving simultaneous modular equations of low degree
SIAM Journal on Computing - Special issue on cryptography
Codes and cryptography
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Graph isomorphism is in the low hierarchy
Journal of Computer and System Sciences
Zero-knowledge proofs of identity
Journal of Cryptology
Randomness, interactive proofs, and zero-knowledge—A survey
A half-century survey on The Universal Turing Machine
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Structural complexity 2
A general zero-knowledge scheme
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Journal of the ACM (JACM)
Efficient identification and signatures for smart cards
CRYPTO '89 Proceedings on Advances in cryptology
The digital signature standard
Communications of the ACM
Efficient zero-knowledge identification schemes for smart cards
The Computer Journal - Special issue on safety and security parallel computation
Journal of the ACM (JACM)
Introduction to the theory of complexity
Introduction to the theory of complexity
Associative one-way functions: a new paradigm for secret-key agreement and digital signatures
Associative one-way functions: a new paradigm for secret-key agreement and digital signatures
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Counting the integers factorable via cyclotomic methods
Journal of Algorithms
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A public-key cryptosystem with worst-case/average-case equivalence
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An observation on associative one-way functions in complexity theory
Information Processing Letters
Complexity theory retrospective II
Journal of Computer and System Sciences
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
SIAM Journal on Computing
Characterizing the existence of one-way permutations
Theoretical Computer Science
Symmetric and Asymmetric Encryption
ACM Computing Surveys (CSUR)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
ACM SIGACT News
The complexity theory companion
The complexity theory companion
Introduction to Cryptography
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
The Code Book: The Evolution of Secrecy from Mary, Queen of Scots, to Quantum Cryptography
The Code Book: The Evolution of Secrecy from Mary, Queen of Scots, to Quantum Cryptography
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Cryptology
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Decrypted Secrets: Methods and Maxims of Cryptology
Decrypted Secrets: Methods and Maxims of Cryptology
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
SIAM Journal on Computing
One-Way Permutations and Self-Witnessing Languages
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
On Sets with Easy Certificates and the Existence of One-Way Permutations
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Some Recent Progress on the Complexity of Lattice Problems
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Polynomial reducibilities and complete sets.
Polynomial reducibilities and complete sets.
The cpa's responsibility for the prevention and detection of computer fraud.
The cpa's responsibility for the prevention and detection of computer fraud.
Cryptanalysis of RSA with private key d less than N0.292
IEEE Transactions on Information Theory
Code protection for resource-constrained embedded devices
Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Dynamic anonymization: accurate statistical analysis with privacy preservation
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Preservation of proximity privacy in publishing numerical sensitive data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Discrete Applied Mathematics
International Journal of Organizational and Collective Intelligence
International Journal of Systems and Service-Oriented Engineering
| Hi-index | 0.00 |
In this tutorial, selected topics of cryptology and of computational complexity theory are presented. We give a brief overview of the history and the foundations of classical cryptography, and then move on to modern public-key cryptography. Particular attention is paid to cryptographic protocols and the problem of constructing key components of protocols such as one-way functions. A function is one-way if it is easy to compute, but hard to invert. We discuss the notion of one-way functions both in a cryptographic and in a complexity-theoretic setting. We also consider interactive proof systems and present some interesting zero-knowledge protocols. In a zero-knowledge protocol, one party can convince the other party of knowing some secret information without disclosing any bit of this information. Motivated by these protocols, we survey some complexity-theoretic results on interactive proof systems and related complexity classes.