The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Insecurity of quantum secure computations
Open accessAbstract
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 so-called quantum bit commitment, the security of quantum two-party computation itself remains unaddressed. Here I answer this question directly by showing that all one-sided two-party computations (which allow only one of the two parties to learn the result) are necessarily insecure. As corollaries to my results, quantum one-way oblivious password identification and the so-called quantum one-out-of-two oblivious transfer are impossible. I also construct a class of functions that cannot be computed securely in any two-sided two-party computation. Nevertheless, quantum cryptography remains useful in key distribution and can still provide partial security in ``quantum money'' proposed by Wiesner.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406
Quantum cryptography using any two nonorthogonal states
Bennett, C. H. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3121 · Cited by 3,028
Fidelity for Mixed Quantum States
Jozsa, R. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552171 · Cited by 1,911
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Dieks, D. (1982) · Physics Letters A · doi:10.1016/0375-9601(82)90084-6 · Cited by 1,461
Unconditionally Secure Quantum Bit Commitment is Impossible
Mayers, D. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3414 · Cited by 748
Proceedings of the 30th IEEE symposium on Foundations of computer science
Galil, Z., & Blum, E. K. (1994) · Cited by 677
A complete classification of quantum ensembles having a given density matrix
Hughston, L. P., Jozsa, R., & Wootters, W. K. (1993) · Physics Letters A · doi:10.1016/0375-9601(93)90880-9 · Cited by 649
Is Quantum Bit Commitment Really Possible?
Lo, H.-K., & Chau, H. F. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3410 · Cited by 606
Self-citationProceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365747 · Cited by 593
Advances in Cryptology: Proceedings of Crypto 84
Blakley, G. R., & Chaum, D. (1985) · Medical Entomology and Zoology · Cited by 516
Bennett, C. H., Brassard, G., & Ekert, A. K. (1992) · Scientific American · doi:10.1038/scientificamerican1092-50 · Cited by 322
Practical Quantum Oblivious Transfer
Bennett, C. H., Brassard, G., Crépeau, C., & Skubiszewska, M.-H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_29 · Cited by 224
A quantum bit commitment scheme provably unbreakable by both parties
Brassard, G., Crépeau, C., Jozsa, R., & Langlois, D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366851 · Cited by 179
Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
Lo, H.-K., & Chau, H. F. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 177
Self-citationThe Trouble with Quantum Bit CommitmentPreprint
Mayers, D. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9603015 · Cited by 146
Quantum Bit Commitment and Coin Tossing Protocols
Brassard, G., & Crépeau, C. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_4 · Cited by 96
25 years of quantum cryptography
Brassard, G., & Crépeau, C. (1996) · ACM SIGACT News · doi:10.1145/235666.235669 · Cited by 75
SHORT DISTANCE APPLICATIONS OF QUANTUM CRYPTOGRAPHY
Hüttner, B., Imoto, N., & Barnett, S. (1996) · Journal of Nonlinear Optical Physics & Materials · doi:10.1142/s0218863596000581 · Cited by 11
Cited by
The security of practical quantum key distribution
Scarani, V., Bechmann-Pasquinucci, H., Cerf, N. J., Dušek, M., Lütkenhaus, N., & Peev, M. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.1301 · Cited by 3,726
Quantum internet: a vision for the road ahead
Wehner, S., Elkouss, D., & Hanson, R. (2018) · Science · doi:10.1126/science.aam9288 · Cited by 2,467
Unconditional Security of Quantum Key Distribution over Arbitrarily Long Distances
Lo, H.-K., & Chau, H. F. (1999) · Science · doi:10.1126/science.283.5410.2050 · Cited by 1,858
Self-citationSecure quantum key distribution with realistic devices
Xu, F., Ma, X., Zhang, Q., Lo, H.-K., & Pan, J.-W. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.025002 · Cited by 1,543
Self-citationInformation processing in generalized probabilistic theories
Barrett, J. (2007) · Physical Review A · doi:10.1103/physreva.75.032304 · Cited by 768
Metadata
- Authors
- Lo, H.-K.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1997-08-01
- Volume
- 56
- Issue
- 2
- Pages
- 1154-1162
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1508636262
- Cited by
- 479
- References
- 25
- FWCI
- 6.66
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.