Robust cryptography in the noisy-quantum-storage model
Abstract
It was shown in [42] that cryptographic primitives can be implemented based on the assumption that quantum storage of qubits is noisy. In this work we analyze a protocol for the universal task of oblivious transfer that can be implemented using quantumkey- distribution (QKD) hardware in the practical setting where honest participants are unable to perform noise-free operations. We derive trade-offs between the amount of storage noise, the amount of noise in the operations performed by the honest participants and the security of oblivious transfer which are greatly improved compared to the results in [42]. As an example, we show that for the case of depolarizing noise in storage we can obtain secure oblivious transfer as long as the quantum bit-error rate of the channel does not exceed 11% and the noise on the channel is strictly less than the quantum storage noise. This is optimal for the protocol considered. Finally, we show that our analysis easily carries over to quantum protocols for secure identification.
Additional Information
© 2009 Rinton Press. Received February 17, 2009. Revised July 29, 2009. Communicated by: R Cleve & J Watrous. We thank Robert König and Renato Renner for useful discussions about the additivity of the smooth min-entropy and the permission to include Lemma 2. CS is supported by EU fifth framework project QAP IST 015848 and the NWO VICI project 2004-2009. SW is supported by NSF grant number PHY-04056720.Additional details
- Eprint ID
- 17316
- Resolver ID
- CaltechAUTHORS:20100127-095135193
- QAP IST 015848
- European Union (EU) fifth framework project
- project 2004-2009
- NWO VICI
- PHY-04056720
- NSF
- Created
-
2010-01-29Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field