Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
We consider the implementation of two-party cryptographic primitives based on the sole assumption that no large-scale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit commitment, and prove that realistic noise levels provide security even against the most general attack. Such unconditional results were previously only known in the so-called bounded-storage model which is a special case of our setting. Our protocols can be implemented with present-day hardware used for quantum key distribution. In particular, no quantum storage is required for the honest parties. © 2011 IEEE.
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Fan Zhang, Junwei Cao, et al.
IEEE TETC
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976