Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Privacy Amplification Theorem for Noisy Main Channel

Valeri Korjik, Guillermo B. Morales-Luna, Vladimir B. Balakirsky

Published Jan 1, 2001• 19 citations
Publisher
DOI
10.1007/3-540-45439-x_2

Related papers

Privacy amplification theorem for bounded storage eavesdropper (情報理論)

峻 渡辺, 靖匡 大濱

Information technology newsletter•May 13, 2011•0 citations

Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels

David Deutsch, ARTUR K. EKERT, Richard Jozsa +3 more

Existing quantum cryptographic schemes are not, as they stand, operable in the presence of noise on the quantum communication channel. Although they become operable if they are supplemented by classical privacy-amplification techniques, the resulting schemes are difficult to analyze and have not been proved secure. We introduce the concept of quantum privacy amplification and a cryptographic scheme incorporating it which is provably secure over a noisy channel. The scheme uses an ``entanglement purification'' procedure which, because it requires only a few quantum controlled-not and single-qubit operations, could be implemented using technology that is currently being developed.

arXiv:quant-ph/9604039•Physical Review Letters•Sep 23, 1996•1,292 citations

Transmission of signals with privacy

John M. Fraser

The Journal of the Acoustical Society of America•Nov 1, 1984•0 citations

Oblivious Transfer from Weak Noisy Channels

Jürg Wullschleger

Lecture notes in computer science•Jan 1, 2009•42 citations

Noisy Channel Coding via Privacy Amplification and Information Reconciliation

Joseph M. Renes, Renato Renner

We show that optimal protocols for noisy channel coding of public or private information over either classical or quantum channels can be directly constructed from two more primitive information-theoretic protocols: privacy amplification and information reconciliation, also known as data compression with side information. We do this in the one-shot scenario of structureless resources, and formulate our results in terms of the smooth min- and max-entropy. In the context of classical information theory, this shows that essentially all two-terminal protocols can be reduced to these two primitives, which are in turn governed by the smooth min- and max-entropies, respectively. In the context of quantum information theory, the recently-established duality of these two protocols means essentially all two-terminal protocols can be constructed using just a single primitive. As an illustration, we show how optimal noisy channel coding protocols can be constructed solely from privacy amplification.

arXiv:1012.4814•IEEE Transactions on Information Theory•Aug 3, 2011•110 citations

The impossibility of non-signaling privacy amplification

Esther Hänggi, Renato Renner, Stefan Wolf

arXiv:0906.4760•Theoretical Computer Science•Dec 22, 2012•56 citations
Existing quantum cryptographic schemes are not, as they stand, operable in the presence of noise on the quantum communication channel. Although they become operable if they are supplemented by classical privacy-amplification techniques, the resulting schemes are difficult to analyze and have not been proved secure. We introduce the concept of quantum privacy amplification and a cryptographic scheme incorporating it which is provably secure over a noisy channel. The scheme uses an ``entanglement purification'' procedure which, because it requires only a few quantum controlled-not and single-qubit operations, could be implemented using technology that is currently being developed.
We show that optimal protocols for noisy channel coding of public or private information over either classical or quantum channels can be directly constructed from two more primitive information-theoretic protocols: privacy amplification and information reconciliation, also known as data compression with side information. We do this in the one-shot scenario of structureless resources, and formulate our results in terms of the smooth min- and max-entropy. In the context of classical information theory, this shows that essentially all two-terminal protocols can be reduced to these two primitives, which are in turn governed by the smooth min- and max-entropies, respectively. In the context of quantum information theory, the recently-established duality of these two protocols means essentially all two-terminal protocols can be constructed using just a single primitive. As an illustration, we show how optimal noisy channel coding protocols can be constructed solely from privacy amplification.