The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Generalized privacy amplification
Abstract
This paper, provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario. Privacy amplification is a process that allows two parties to distil a secret key from a common random variable about which an eavesdropper has partial information. The two parties generally know nothing about the eavesdropper's information except that it satisfies a certain constraint. The results have applications to unconditionally secure secret-key agreement protocols and quantum cryptography, and they yield results on wiretap and broadcast channels for a considerably strengthened definition of secrecy capacity.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Wyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
On Measures of Entropy and Information
Rényi, A. (1961) · Project Euclid (Cornell University) · Cited by 4,031
Broadcast channels with confidential messages
Csiszar, I., & Korner, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055892 · Cited by 3,332
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
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
Quantum 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-citationSecret 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
Self-citationExperimental 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-citationNew 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
Common randomness in information theory and cryptography. I. Secret sharing
Ahlswede, R., & Csiszar, I. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.243431 · Cited by 1,325
Principles and practice of information theory
Blahut, R. E. (1987) · Medical Entomology and Zoology · Cited by 1,008
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-citationPrivacy 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-citationSecret-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-citationPseudo-random generation from one-way functions
Impagliazzo, R., Levin, L. A., & Luby, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73009 · Cited by 724
Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications
Vernam, G. S. (1926) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1926.5061224 · Cited by 480
Impagliazzo, R., & Zuckerman, D. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63486 · Cited by 387
The bit extraction problem or t-resilient functions
Chor, B., Goldreich, O., Hasted, J., Freidmann, J., Rudich, S., & Smolensky, R. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.55 · Cited by 361
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
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-citationMuller, A., Breguet, J., & Gisin, N. (1993) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/23/6/001 · Cited by 215
A quantum bit commitment scheme provably unbreakable by both parties
Gilles Brassard, A., Crépeau, C., Jozsa, R., & Langlois, D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366851 · Cited by 148
Linking information reconciliation and privacy amplification
Cachin, C., & Maurer, U. M. (1997) · Journal of Cryptology · doi:10.1007/s001459900023 · Cited by 144
Self-citationThe Strong Secret Key Rate of Discrete Random Triples
Maurer, U. M. (1994) · Springer eBooks · doi:10.1007/978-1-4615-2694-0_27 · Cited by 134
Self-citationSecure key distribution system based on quantumcryptography
Townsend, P. D. (1994) · Electronics Letters · doi:10.1049/el:19940558 · Cited by 117
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-citationGoodrich, M. T. (1993) · ACM SIGACT News · doi:10.1145/164996.165002 · Cited by 14
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
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Self-citationQuantum information with continuous variables
Braunstein, S. L., & van Loock, P. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.513 · Cited by 3,858
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
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Bennett, C. H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.722 · Cited by 2,961
Self-citation
Metadata
- Authors
- Bennett, C. H., Brassard, G., Crepeau, C., & Maurer, U. M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1995
- Volume
- 41
- Issue
- 6
- Pages
- 1915-1923
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2154300278
- Cited by
- 1,417
- References
- 30
- FWCI
- 21.54
- 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.