A randomized protocol for signing contracts
Communications of the ACM
Matrix analysis
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Randomized algorithms
Why quantum bit commitment and ideal quantum coin tossing are impossible
PhysComp96 Proceedings of the fourth workshop on Physics and computation
Quantum computation and quantum information
Quantum computation and quantum information
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Practical Quantum Oblivious Transfer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Quantum Bit Commitment from a Physical Assumption
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Convex Optimization
ACM SIGACT News - A special issue on cryptography
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Cryptography in the Bounded-Quantum-Storage Model
SIAM Journal on Computing
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
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
Composing Quantum Protocols in a Classical Environment
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
The operational meaning of min- and max-entropy
IEEE Transactions on Information Theory
A fully quantum asymptotic equipartition property
IEEE Transactions on Information Theory
Efficient cryptographic protocols based on noisy channels
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
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
Security of quantum key distribution with imperfect devices
Quantum Information & Computation
Efficient unconditional oblivious transfer from almost any noisy channel
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Hi-index | 0.00 |
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 quantum-key-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.