The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Experimental Quantum Cryptography
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
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
Self-citationQuantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
Self-citationQuantum cryptography without Bell’s theorem
Bennett, C. H., Brassard, G., & Mermin, N. D. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.557 · Cited by 2,460
Self-citationWiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
New hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402
Privacy Amplification by Public Discussion
Bennett, C. H., Brassard, G., & Robert, J.-M. (1988) · SIAM Journal on Computing · doi:10.1137/0217014 · Cited by 867
Self-citationImpagliazzo, R., & Zuckerman, D. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63486 · Cited by 387
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
Self-citationQuantum Cryptography, or Unforgeable Subway Tokens
Bennett, C. H., Brassard, G., Breidbart, S., & Wiesner, S. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_26 · Cited by 192
Self-citationAn Update on Quantum Cryptography
Bennett, C. H., & Brassard, G. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_39 · Cited by 180
Self-citationBennett, C. H., & Brassard, G. (1989) · ACM SIGACT News · doi:10.1145/74074.74087 · Cited by 170
Self-citationCryptanalysis: a survey of recent results
Brickell, E. F., & Odlyzko, A. M. (1988) · Proceedings of the IEEE · doi:10.1109/5.4443 · Cited by 134
Secure implementation of identification systems
Samy Bengio, A., Brassard, G., Desmedt, Y., Goutier, C., & Quisquater, J.-J. (1991) · Journal of Cryptology · doi:10.1007/bf00196726 · Cited by 103
Self-citationQuantum 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
Self-citation(1989) · Choice Reviews Online · doi:10.5860/choice.26-5690 · Cited by 67
How to Reduce your Enemy’s Information (extended abstract)
Bennett, C. H., Gilles Brassard, A., & Robert, J. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_37 · Cited by 27
Self-citation
Cited by
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Juels, A., & Wattenberg, M. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319714 · Cited by 1,591
Generalized privacy amplification
Bennett, C. H., Brassard, G., Crepeau, C., & Maurer, U. M. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.476316 · Cited by 1,417
Self-citationSteane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Metadata
- Authors
- Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1991
- Pages
- 253-265
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2001466659
- Cited by
- 959
- References
- 17
- FWCI
- 4.36
- Type
- conference paper
- Language
- en
- Open access
- closed
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.