The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Quantum cryptography beyond quantum key distribution
Open accessAbstract
Quantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness generation, secure two- and multi-party computation and delegated quantum computation. Quantum cryptography also studies the limitations and challenges resulting from quantum adversaries-including the impossibility of quantum bit commitment, the difficulty of quantum rewinding and the definition of quantum security models for classical primitives. In this review article, aimed primarily at cryptographers unfamiliar with the quantum world, we survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD.
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
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · cited 1×
“This scenario has appealing cryptographic applications, such as the delegated execution of Shor’s algorithm [206] for factoring, and thus breaking RSA public keys [200].”
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252 · cited 1×
“to produce correlations that are stronger than all correlations they could obtain when sharing only classical randomness. In this case, physicists say that the correlations violate a Bell inequality [Bel64]. The most well-known example of such an inequality was proposed by Clauser, Horne, Shimony and Holt [CHSH69]. It…”
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
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
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
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
Proposed Experiment to Test Local Hidden-Variable Theories
Clauser, J. F., Horne, M. A., Shimony, A., & Holt, R. A. (1969) · Physical Review Letters · doi:10.1103/physrevlett.23.880 · Cited by 7,573 · cited 2×
“2.5, the most well-known example of such an inequality is the CHSH game [76].”
InfluentialFully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 1×
“Here, the computation (as given by a quantum circuit) is public, but is executed remotely on an encrypted version of the data (reminiscent of the work on classical fully homomorphic encryption [117,199]).”
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 1×
“One of the most fundamental properties of quantum information is that it is not physically possible, in general, to clone a quantum system [236] (i.e. there is no physical process that takes as input a single quantum system, and outputs two identical copies of its input).”
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
Shor, P. W., & Preskill, J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.441 · Cited by 3,047
Quantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
The ‘transition probability’ in the state space of a—algebra
Uhlmann, A. (1976) · Reports on Mathematical Physics · doi:10.1016/0034-4877(76)90060-4 · Cited by 1,649
Random numbers certified by Bell’s theorem
Pironio, S., Acín, A., Massar, S., de la Giroday, A. B., Matsukevich, D. N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A., et al. (2010) · Nature · doi:10.1038/nature09008 · Cited by 1,420
Cleve, R., Gottesman, D., & Lo, H.-K. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.648 · Cited by 1,373
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
Secure communications over insecure channels
Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757 · cited 1×
“2 • Merkle puzzles in a quantum world The first unclassified proposal for secure communication over insecure channels was made by Merkle in 1974 (published years later [176]).”
Quantum Computer Science: An Introduction
Mermin, N. D. (2007) · doi:10.1017/cbo9780511813870 · Cited by 592
Universal Blind Quantum Computation
Broadbent, A., Fitzsimons, J., & Kashefi, E. (2009) · 2009 50th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.36 · Cited by 521
Self-citationDetection-Loophole-Free Test of Quantum Nonlocality, and Applications
Christensen, B. G., McCusker, K. T., Altepeter, J. B., Calkins, B., Gerrits, T., Lita, A. E., Miller, A., Shalm, L. K., Zhang, Y., Nam, S. W., et al. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.130406 · Cited by 477 · cited 2×
“…are mostly focused on QKD (see [8]), but also include quantum coin flipping [31,182,189], quantum secret sharing [212], delegated quantum computation [17,114], limited-quantum-storage cryptography [105,188], and device-independent randomness generation [75,194].”
Demonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
Self-citationFree randomness can be amplified
Colbeck, R., & Renner, R. (2012) · Nature Physics · doi:10.1038/nphys2300 · Cited by 379
Randomizing Quantum States: Constructions and Applications
Hayden, P., Leung, D., Shor, P. W., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1087-6 · Cited by 345 · cited 1×
“This includes topics such as the encryption of quantum messages in the information-theoretic [9,41,134,153], entropic [95,96] and computational [52] settings, quantum secret sharing [77], multi-party quantum computation [22], authentication of quantum messages [15], two-party secure function evaluation [98,99], quantu…”
Quantum Computation and Lattice Problems
Regev, O. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539703440678 · Cited by 188
Security of practical private randomness generation
Pironio, S., & Massar, S. (2013) · Physical Review A · doi:10.1103/physreva.87.012336 · Cited by 169 · cited 1×
“Providingformal securityproofshasturnedouttoberatherchallengingandwasfirstestablishedagainstclas-sicaladversaries[112,193,194],andlateralsoagainstquantumadversaries[179,224].”
Security and composability of randomness expansion from Bell inequalities
Fehr, S., Gelles, R., & Schaffner, C. (2013) · Physical Review A · doi:10.1103/physreva.87.012335 · Cited by 104 · cited 1×
“Providing formal security proofs has turned out to be rather challenging and was first established against classical adversaries [112,193,194], and later also against quantum adversaries [179,224].”
Self-citation(2014) · doi:10.1007/978-3-642-55220-5 · Cited by 97
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
Vazirani, U., & Vidick, T. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2213984 · Cited by 80
Self-testing of Quantum Circuits
Magniez, F., Mayers, D., Mosca, M., & Ollivier, H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11786986_8 · Cited by 58 · cited 1×
“In fact, on the topic of self-testing quantum devices [163,174,175,178], Reichardt, Unger and Vazirani have shown a strong robustness result [197] in the sense that being close to winning the CHSH-game with optimal probability implies that the players must essentially be in possession of a state…”
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Secure 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
Practical challenges in quantum key distribution
Diamanti, E., Lo, H.-K., Qi, B., & Yuan, Z. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.25 · Cited by 737
Entropic uncertainty relations and their applications
Coles, P. J., Berta, M., Tomamichel, M., & Wehner, S. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015002 · Cited by 658
Quantum repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
Metadata
- Authors
- Broadbent, A., & Schaffner, C.
- Venue
- Designs, Codes and Cryptography
- Published
- 2015-12-21
- Volume
- 78
- Issue
- 1
- Pages
- 351-382
- ISSN
- 0925-1022 (ISSN-L)
- 1573-7586
- OpenAlex
- W1762828224
- Cited by
- 230
- References
- 31
- FWCI
- 9.70
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.