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

Optimization of Key Distribution Protocols Based on Extractors for Noisy Channels within Active Adversaries

Viktor Yakovlev, Коржик Валерий Иванович, Mihail Bakaev, Guillermo B. Morales-Luna

Published Jan 1, 2012• 1 citation
Publisher
DOI
10.1007/978-3-642-33704-8_5

Related papers

Efficient Cryptographic Protocols Based on Noisy Channels

Claude Crépeau

Lecture notes in computer science•Jan 1, 1997•173 citations

Key Distribution Protocols Based on Extractors Under the Condition of Noisy Channels in the Presence of an Active Adversary

Viktor Yakovlev, Коржик Валерий Иванович, Guillermo B. Morales-Luna +1 more

We consider in this paper the information-theoretic secure key distribution problem over main and wire-tap noise channels with a public discussion in presence of an active adversary. In contrast to the solution proposed by ourselves for a similar problem using hashing for privacy amplification, in the current paper we use a technique of extractors. We propose modified key distribution protocols for which we prove explicit estimates of key rates without the use of estimates with uncertain coefficients in notations $O,Ω,Θ$. This leads in the new conclusion that the use of extractors is superior to the use of hash functions only with the very large key lengths $\ell$ (of order $\ell>10^5$ bits). We suggest hybrid key distribution protocols consisting from two consecutively executed stages. At the fist stage it is generated a short authentication key based on hash function, whereas at the second stage it is generated the final key with the use of extractors. We show that in fact the use of extraction procedure is effective only at the second stage. We get also some constructive estimates of the key rates for such protocols.

arXiv:1005.3184•May 18, 2010•2 citations

Key Distribution Protocol Based on Noisy Channel and Error Detecting Codes

Lecture notes in computer science•Jan 1, 2001•2 citations

Key Distribution Protocols Based on Noisy Channels in Presence of an Active Adversary: Conventional and New Versions With Parameter Optimization

Viktor Yakovlev, Коржик Валерий Иванович, Guillermo B. Morales-Luna

In this paper, we consider the information-theoretic secure key distribution problem over noisy wiretap channels with public discussion and in the presence of an active adversary. There are several well-known versions of the protocols proposed by Maurer and Wolf to solve this problem. We describe several new versions of the key distribution protocols for the same channel model allowing to increase the key rate given a fixed key security and under an optimization of the protocol parameters. Both asymptotic and nonasymptotic cases are presented. It is shown that in some cases the nonasymptotic key rate is not so far from the asymptotic one whenever the lengths of the transmitted strings are of the order of thousands of bits.

IEEE Transactions on Information Theory•May 29, 2008•23 citations

Position-Based Cryptography from Noisy Channels

Stefan Dziembowski, Maciej Zdanowicz

Lecture notes in computer science•Jan 1, 2014•7 citations

Privacy Amplification Against Active Quantum Adversaries

Cohen, Gil, Thomas Vidick

Privacy amplification is the task by which two cooperating parties transform a shared weak secret, about which an eavesdropper may have side information, into a uniformly random string uncorrelated from the eavesdropper. Privacy amplification against passive adversaries, where it is assumed that the communication is over a public but authenticated channel, can be achieved in the presence of classical as well as quantum side information by a single-message protocol based on strong extractors. In 2009 Dodis and Wichs devised a two-message protocol to achieve privacy amplification against active adversaries, where the public communication channel is no longer assumed to be authenticated, through the use of a strengthening of strong extractors called non-malleable extractors which they introduced. Dodis and Wichs only analyzed the case of classical side information. We consider the task of privacy amplification against active adversaries with quantum side information. Our main result is showing that the Dodis-Wichs protocol remains secure in this scenario provided its main building block, the non-malleable extractor, satisfies a notion of quantum-proof non-malleability which we introduce. We show that an adaptation of a recent construction of non-malleable extractors due to Chattopadhyay et al. is quantum proof, thereby providing the first protocol for privacy amplification that is secure against active quantum adversaries. Our protocol is quantitatively comparable to the near-optimal protocols known in the classical setting.

arXiv:1608.06318•Aug 22, 2016•4 citations
We consider in this paper the information-theoretic secure key distribution problem over main and wire-tap noise channels with a public discussion in presence of an active adversary. In contrast to the solution proposed by ourselves for a similar problem using hashing for privacy amplification, in the current paper we use a technique of extractors. We propose modified key distribution protocols for which we prove explicit estimates of key rates without the use of estimates with uncertain coefficients in notations O,Ω,ΘO,Ω,ΘO,Ω,Θ. This leads in the new conclusion that the use of extractors is superior to the use of hash functions only with the very large key lengths ℓ\ellℓ (of order ℓ>105\ell>10^5ℓ>105 bits). We suggest hybrid key distribution protocols consisting from two consecutively executed stages. At the fist stage it is generated a short authentication key based on hash function, whereas at the second stage it is generated the final key with the use of extractors. We show that in fact the use of extraction procedure is effective only at the second stage. We get also some constructive estimates of the key rates for such protocols.
In this paper, we consider the information-theoretic secure key distribution problem over noisy wiretap channels with public discussion and in the presence of an active adversary. There are several well-known versions of the protocols proposed by Maurer and Wolf to solve this problem. We describe several new versions of the key distribution protocols for the same channel model allowing to increase the key rate given a fixed key security and under an optimization of the protocol parameters. Both asymptotic and nonasymptotic cases are presented. It is shown that in some cases the nonasymptotic key rate is not so far from the asymptotic one whenever the lengths of the transmitted strings are of the order of thousands of bits.
Privacy amplification is the task by which two cooperating parties transform a shared weak secret, about which an eavesdropper may have side information, into a uniformly random string uncorrelated from the eavesdropper. Privacy amplification against passive adversaries, where it is assumed that the communication is over a public but authenticated channel, can be achieved in the presence of classical as well as quantum side information by a single-message protocol based on strong extractors. In 2009 Dodis and Wichs devised a two-message protocol to achieve privacy amplification against active adversaries, where the public communication channel is no longer assumed to be authenticated, through the use of a strengthening of strong extractors called non-malleable extractors which they introduced. Dodis and Wichs only analyzed the case of classical side information. We consider the task of privacy amplification against active adversaries with quantum side information. Our main result is showing that the Dodis-Wichs protocol remains secure in this scenario provided its main building block, the non-malleable extractor, satisfies a notion of quantum-proof non-malleability which we introduce. We show that an adaptation of a recent construction of non-malleable extractors due to Chattopadhyay et al. is quantum proof, thereby providing the first protocol for privacy amplification that is secure against active quantum adversaries. Our protocol is quantitatively comparable to the near-optimal protocols known in the classical setting.