The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Privacy Amplification by Public Discussion
Abstract
In this paper, we investigate how the use of a channel with perfect authenticity but no privacy can be used to repair the defects of a channel with imperfect privacy but no authenticity. More precisely, let us assume that Alice and Bob wish to agree on a secret random bit string, and have at their disposal an imperfect private channel and a perfect public channel. The private channel is imperfect in various ways: transmission errors can occur, and partial information can leak to an eavesdropper, Eve, who also has the power to suppress, inject, and modify transmissions arbitrarily. On the other hand, the public channel transmits information accurately, and these transmissions cannot be modified or suppressed by Eve, but their entire contents becomes known to her. We consider the situation in which a random bit string x has already been transmitted from Alice to Bob over the private channel, and we describe interactive public channel protocols that allow them, with high probability: (1) to assess the extent to which the private channel transmission has been corrupted by tampering and channel noise; and (2) if this corruption is not too severe, to repair Bob’s partial ignorance of the transmitted string and Eve’s partial knowledge of it by distilling from the transmitted and received versions of the string another string, in general shorter than x, upon which Alice and Bob have perfect information, while Eve has nearly no information (or in some cases exactly none), except for its length. These protocols remain secure against unlimited computing power.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Wyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
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
Cited by
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
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 cryptography using any two nonorthogonal states
Bennett, C. H. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3121 · Cited by 3,028
Self-citationFuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Reyzin, L., & Smith, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_31 · Cited by 2,038
Secret key agreement by public discussion from common information
Maurer, U. M. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256484 · Cited by 2,005
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Ostrovsky, R., Reyzin, L., & Smith, A. (2008) · SIAM Journal on Computing · doi:10.1137/060651380 · Cited by 1,717
A Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
Experimental quantum cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1992) · Journal of Cryptology · doi:10.1007/bf00191318 · Cited by 1,614
Self-citationGeneralized 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-citationInvited Review Article: Single-photon sources and detectors
Eisaman, M. D., Fan, J., Migdall, A., & Polyakov, S. V. (2011) · Review of Scientific Instruments · doi:10.1063/1.3610677 · Cited by 1,358
Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels
Deutsch, D., Ekert, A., Jozsa, R., Macchiavello, C., Popescu, S., & Sanpera, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.2818 · Cited by 1,268
Entanglement-based quantum communication over 144 km
Ursin, R., Tiefenbacher, F., Schmitt-Manderbach, T., Weier, H., Scheidl, T., Lindenthal, M., Blauensteiner, B., Jennewein, T., Perdigues, J., Trojek, P., et al. (2007) · Nature Physics · doi:10.1038/nphys629 · Cited by 1,210
SECURITY OF QUANTUM KEY DISTRIBUTION
RENNER, R. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908003256 · Cited by 1,047
Unconditional security in quantum cryptography
Mayers, D. (2001) · Journal of the ACM · doi:10.1145/382780.382781 · Cited by 1,033
Experimental Quantum Cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3_23 · Cited by 959
Self-citationLounis, B., & Orrit, M. (2005) · Reports on Progress in Physics · doi:10.1088/0034-4885/68/5/r04 · Cited by 908
Quantum random number generators
Herrero-Collantes, M., & Garcia-Escartin, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 791
Secret-Key Reconciliation by Public Discussion
Brassard, G., & Salvail, L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_35 · Cited by 781
Self-citationHamamreh, J. M., Furqan, H. M., & Arslan, H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2878035 · Cited by 742
Radio-telepathy: extracting a secret key from an unauthenticated wireless channel
Mathur, S., Trappe, W., Mandayam, N., Ye, C., & Reznik, A. (2008) · Proceedings of the 14th ACM international conference on Mobile computing and networking · doi:10.1145/1409944.1409960 · Cited by 739
Quantum cryptography with coherent states
Huttner, B., Imoto, N., Gisin, N., & Mor, T. (1995) · Physical Review A · doi:10.1103/physreva.51.1863 · Cited by 611
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
Maurer, U., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_24 · Cited by 483
(2004) · Thammasat University Digital Collections · doi:10.1007/b97564 · Cited by 427
Information-Theoretically Secret Key Generation for Fading Wireless Channels
Ye, C., Mathur, S., Reznik, A., Shah, Y., Trappe, W., & Mandayam, N. B. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2043187 · Cited by 417
Engineered quantum dot single-photon sources
Buckley, S., Rivoire, K., & Vučković, J. (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/12/126503 · Cited by 431
Security in quantum cryptography
Portmann, C., & Renner, R. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.025008 · Cited by 390
Free randomness can be amplified
Colbeck, R., & Renner, R. (2012) · Nature Physics · doi:10.1038/nphys2300 · Cited by 379
Self testing quantum apparatus
Mayers, D., & Yao, A. (2004) · Quantum Information and Computation · doi:10.26421/qic4.4-3 · Cited by 366
Renner, R., & Cirac, J. I. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110504 · Cited by 366
Practical quantum cryptography based on two-photon interferometry
Ekert, A. K., Rarity, J. G., Tapster, P. R., & Massimo Palma, G. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.1293 · Cited by 340
Universally Composable Privacy Amplification Against Quantum Adversaries
Renner, R., & König, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_22 · Cited by 337
Private randomness expansion with untrusted devices
Colbeck, R., & Kent, A. (2011) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/44/9/095305 · Cited by 333
Quantum secure direct communication and deterministic secure quantum communication
Long, G.-L., Deng, F.-G., Wang, C., Li, X.-H., Wen, K., & Wang, W.-Y. (2007) · Frontiers of Physics in China · doi:10.1007/s11467-007-0050-3 · Cited by 308
Leftover Hashing Against Quantum Side Information
Tomamichel, M., Schaffner, C., Smith, A., & Renner, R. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158473 · Cited by 303
A personal view of average-case complexity
Impagliazzo, R. (2002) · Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference · doi:10.1109/sct.1995.514853 · Cited by 298
Quantum computation and quantum information
Nagy, M., & Akl, S. G. (2006) · International Journal of Parallel, Emergent and Distributed Systems · doi:10.1080/17445760500355678 · Cited by 287
Satellite-to-Ground Entanglement-Based Quantum Key Distribution
Yin, J., Cao, Y., Li, Y.-H., Ren, J.-G., Liao, S.-K., Zhang, L., Cai, W.-Q., Liu, W.-Y., Li, B., Dai, H., et al. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.200501 · Cited by 269
Security of quantum key distribution
Renner, R. (2005) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-005115027 · Cited by 263
Conditionally-perfect secrecy and a provably-secure randomized cipher
Maurer, U. M. (1992) · Journal of Cryptology · doi:10.1007/bf00191321 · Cited by 259
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
Renner, R., & Wolf, S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11593447_11 · Cited by 258
Quantum key distribution over distances as long as 30 km
Marand, C., & Townsend, P. D. (1995) · Optics Letters · doi:10.1364/ol.20.001695 · Cited by 254
He, J., Treude, C., & Lo, D. (2025) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3712003 · Cited by 246
LLM-Based Multi-Agent Systems for Software Engineering: Literature Review, Vision and the Road Ahead
He, J., Treude, C., & Lo, D. (2024) · arXiv · doi:10.48550/arxiv.2404.04834 · Cited by 246
Ground to satellite secure key exchange using quantum cryptography
Rarity, J. G., Tapster, P. R., Gorman, P. M., & Knight, P. (2002) · New Journal of Physics · doi:10.1088/1367-2630/4/1/382 · Cited by 238
Quantum Random-number Generation and Key Sharing
Rarity, J. G., Owens, P. C. M., & Tapster, P. R. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552281 · Cited by 232
Trevisan's Extractor in the Presence of Quantum Side Information
De, A., Portmann, C., Vidick, T., & Renner, R. (2012) · SIAM Journal on Computing · doi:10.1137/100813683 · Cited by 161
Quantum Key Distribution Networks - Key Management: A Survey
Dervisevic, E., Tankovic, A., Fazel, E., Kompella, R., Fazio, P., Voznak, M., & Mehic, M. (2025) · ACM Computing Surveys · doi:10.1145/3730575 · Cited by 74
The Bounded-Storage Model in the Presence of a Quantum Adversary
Konig, R. T., & Terhal, B. M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913245 · Cited by 65
Experimental Quantum Communication without a Shared Reference Frame
Chen, T.-Y., Zhang, J., Boileau, J.-C., Jin, X.-M., Yang, B., Zhang, Q., Yang, T., Laflamme, R., & Pan, J.-W. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.150504 · Cited by 58
Quantum-Proof Randomness Extractors via Operator Space Theory
Berta, M., Fawzi, O., & Scholz, V. B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2627531 · Cited by 12
Metadata
- Authors
- Bennett, C. H., Brassard, G., & Robert, J.-M.
- Venue
- SIAM Journal on Computing
- Published
- 1988-04
- Volume
- 17
- Issue
- 2
- Pages
- 210-229
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2007661134
- Cited by
- 867
- References
- 16
- FWCI
- 2.48
- Type
- journal article
- 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.