Insecurity of Quantum Secure Computations
@article{Lo1996InsecurityOQ, title={Insecurity of Quantum Secure Computations}, author={H. Lo}, journal={ArXiv}, year={1996}, volume={quant-ph/9611031} }
It had been widely claimed that quantum mechanics can protect private information during public decision in, for example, the so-called two-party secure computation. If this were the case, quantum smart-cards, storing confidential information accessible only to a proper reader, could prevent fake teller machines from learning the PIN (personal identification number) from the customers' input. Although such optimism has been challenged by the recent surprising discovery of the insecurity of the… Expand
Topics from this paper
319 Citations
On the Everlasting Security of Password-Authenticated Quantum Key Exchange
- Computer Science, Physics
- ArXiv
- 2019
- PDF
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Computer Science, Physics
- CRYPTO
- 2010
- 56
- PDF
Secure Identification and QKD in the Bounded-Quantum-Storage Model
- Computer Science, Physics
- CRYPTO
- 2007
- 59
- PDF
Secure identification and QKD in the bounded-quantum-storage model
- Computer Science
- Theor. Comput. Sci.
- 2014
- 12
Can relativistic bit commitment lead to secure quantum oblivious transfer?
- Computer Science, Physics
- 2015
- 4
- PDF
References
SHOWING 1-10 OF 46 REFERENCES
Why quantum bit commitment and ideal quantum coin tossing are impossible
- Computer Science, Physics
- 1997
- 216
- PDF
Unconditionally secure quantum bit commitment is impossible
- Computer Science, Physics
- 1997
- 619
- Highly Influential
- PDF
Algorithms for quantum computation: discrete logarithms and factoring
- Mathematics, Computer Science
- Proceedings 35th Annual Symposium on Foundations of Computer Science
- 1994
- 4,899
- PDF
Quantum cryptography using any two nonorthogonal states.
- Computer Science, Medicine
- Physical review letters
- 1992
- 2,167