Average case complete problems
SIAM Journal on Computing
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
On hardness of one-way functions
Information Processing Letters
SIAM Journal on Computing
One-way functions and the nonisomorphism of NP-complete sets
Theoretical Computer Science
Self-witnessing polynomial-time complexity and prime factorization
Designs, Codes and Cryptography
Security of quantum protocols against coherent measurements
STOC '95 Proceedings of the twenty-seventh 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
An observation on associative one-way functions in complexity theory
Information Processing Letters
Average-case computational complexity theory
Complexity theory retrospective II
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
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
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Quantum computation and quantum information
Quantum computation and quantum information
Cryptanalysis of the Ajtai-Dwork Cryptosystem
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
On Sets with Easy Certificates and the Existence of One-Way Permutations
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
A Note on Cryptography and NP$\cap$ CoNP-P
A Note on Cryptography and NP$\'cap$ CoNP-P
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.
Information and Computation
One-way permutations and self-witnessing languages
Journal of Computer and System Sciences
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions
Journal of Computer and System Sciences
ACM SIGACT News - A special issue on cryptography
Complexity Theory and Cryptology
Complexity Theory and Cryptology
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Universal test for quantum one-way permutations
Theoretical Computer Science - Mathematical foundations of computer science 2004
If P ≠ NP then some strongly noninvertible functions are invertible
Theoretical Computer Science
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
The universal composable security of quantum key distribution
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Engineering of Software-Intensive Systems: State of the Art and Research Challenges
Software-Intensive Systems and New Computing Paradigms
ISSEP'11 Proceedings of the 5th international conference on Informatics in Schools: situation, Evolution and Perspectives
Quantum Information & Computation
Histogram-based segmentation of quantum images
Theoretical Computer Science
| Hi-index | 0.00 |
We survey some results in quantum cryptography. After a brief introduction to classical cryptography, we provide the quantum-mechanical background needed to present some fundamental protocols from quantum cryptography. In particular, we review quantum key distribution via the BB84 protocol and its security proof, as well as the related quantum bit commitment protocol and its proof of insecurity.