Quantum Bit Commitment from a Physical Assumption
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer with a Memory-Bounded Receiver
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Universal classes of hash functions (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
New classes and applications of hash functions
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Perfectly concealing quantum bit commitment from any quantum one-way permutation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Universally composable privacy amplification against quantum adversaries
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Cryptographic distinguishability measures for quantum-mechanical states
IEEE Transactions on Information Theory
Quantum cryptography: A survey
ACM Computing Surveys (CSUR)
Oblivious-Transfer Amplification
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Composable Security in the Bounded-Quantum-Storage Model
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Composing Quantum Protocols in a Classical Environment
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Smooth entropies and the quantum information spectrum
IEEE Transactions on Information Theory
Secure identification and QKD in the bounded-quantum-storage model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A tight high-order entropic quantum uncertainty relation with applications
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Proceedings of the forty-third annual ACM symposium on Theory of computing
Concurrent composition in the bounded quantum storage model
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Limits on entropic uncertainty relations for 3 and more MUBs
Quantum Information & Computation
Relaxed uncertainty relations and information processing
Quantum Information & Computation
Robust cryptography in the noisy-quantum-storage model
Quantum Information & Computation
Position-based quantum cryptography: impossibility and constructions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
On the impossibility of non-static quantum bit commitment between two parties
Quantum Information Processing
Universally composable quantum multi-party computation
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Oblivious transfer and linear functions
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Practical quantum bit commitment protocol
Quantum Information Processing
Journal of the ACM (JACM)
Building one-time memories from isolated qubits: (extended abstract)
Proceedings of the 5th conference on Innovations in theoretical computer science
Practical quantum all-or-nothing oblivious transfer protocol
Quantum Information Processing
| Hi-index | 0.06 |
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary驴s quantum memory is of bounded size. We show that oblivious transfer and bit commitment can be implemented in this model using protocols where honest parties need no quantum memory, whereas an adversarial player needs quantum memory of size at least n/2 in order to break the protocol, where n is the number of qubits transmitted. This is in sharp contrast to the classical bounded-memory model, where we can only tolerate adversaries with memory of size quadratic in honest players驴 memory size. Our protocols are efficient, non-interactive and can be implemented using today驴s technology. On the technical side, a new entropic uncertainty relation involving min-entropy is established.