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

CRC Press eBooks

A privacy amplification protocol against active attacks in information theoretically secret key agreement

Q.H. Wang, X.J. Wang, Q.Y. Lv & X.Y. Ye

Published Jun 29, 2015• 1 citation
Publisher
DOI
10.1201/b18660-4

Related papers

Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement

Stefan Wolf

Lecture notes in computer science•Jan 1, 1998•28 citations

Secret key agreement for cooperative wireless communications: bounds and efficient protocol design

Ning Wang, Ning Zhang, Thomas Aaron Gulliver

We study practical information-theoretically secure secret key agreement protocol design for wireless cooperative communication networks. By assuming the relay selection process is finished in advance, we study the key agreement problem for a classical three-node cooperative wireless communication system over independent additive white Gaussian noise (AWGN) channels. Passive attacks from an eavesdropper collocated with the relay are assumed. We derive upper and lower bounds on the secret key rate under the assumed cooperative wireless system model and find that they are close, which indicates the tightness of the bounds. We then propose an efficient practical secret key agreement protocol with both Bob and the honest relay participating in the public discussion. A compromise between security and efficiency is achieved by the joint advantage distillation and privacy amplification.

Globecom•Dec 1, 2012•0 citations

Protocols for Secret Key Agreement by Public Discussion Based on Common Information

Ueli M. Maurer

Springer eBooks•Aug 5, 2007•88 citations

Cooperative Key Agreement for Wireless Networking: Key Rates and Practical Protocol Design

Ning Wang, Ning Zhang, Thomas Aaron Gulliver

In this paper, we investigate the design of a practical information-theoretically secure secret key agreement protocol for a cooperative wireless network employing standard modulation. Assuming relay selection has been completed, the key agreement problem is studied in a three-node cooperative wireless communication system over block-fading channels. Passive attacks from an eavesdropper collocated with the relay are considered. We derive upper and lower bounds on the secret key rate of this cooperative wireless system. The difference between the bounds is shown to be small for practical communication scenarios, which indicates they are tight. We then propose a practical secret key agreement protocol for this system with both the communicants and the honest relay participating in the public discussion. The tradeoff between security and protocol efficiency is considered in the joint design of advantage distillation, information reconciliation, and privacy amplification. The protocol parameters are optimized to achieve the tight bound on the secret key rate.

IEEE Transactions on Information Forensics and Security•Jan 24, 2014•35 citations

Privacy amplification secure against active adversaries

Ueli M. Maurer, Stefan Wolf

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

Privacy Amplification with Asymptotically Optimal Entropy Loss.

Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky +1 more

We study the problem of “privacy amplification”: key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on the internet, where passwords are the most commonly used security device.) We assume that the key agreement protocol is taking place in the presence of an active computationally unbounded adversary Eve. The adversary may have partial knowledge about w, so we assume only that w has some entropy from Eve’s point of view. Thus, the goal of the protocol is to convert this non-uniform secret w into a uniformly distributed string R that is fully secret from Eve. R may then be used as a key for running symmetric cryptographic protocols (such as encryption, authentication, etc.). Because we make no computational assumptions, the entropy in R can come only from w. Thus such a protocol must minimize the entropy loss during its execution, so that R is as long as possible. The best previous results have entropy loss of Θ(κ 2), where κ is the security parameter, thus requiring the password to be very long even for small values of κ. In this work, we present the first protocol for information-theoretic key agreement that has entropy loss linear in the security parameter. The result is optimal up

•Jan 1, 2012•0 citations
We study practical information-theoretically secure secret key agreement protocol design for wireless cooperative communication networks. By assuming the relay selection process is finished in advance, we study the key agreement problem for a classical three-node cooperative wireless communication system over independent additive white Gaussian noise (AWGN) channels. Passive attacks from an eavesdropper collocated with the relay are assumed. We derive upper and lower bounds on the secret key rate under the assumed cooperative wireless system model and find that they are close, which indicates the tightness of the bounds. We then propose an efficient practical secret key agreement protocol with both Bob and the honest relay participating in the public discussion. A compromise between security and efficiency is achieved by the joint advantage distillation and privacy amplification.
In this paper, we investigate the design of a practical information-theoretically secure secret key agreement protocol for a cooperative wireless network employing standard modulation. Assuming relay selection has been completed, the key agreement problem is studied in a three-node cooperative wireless communication system over block-fading channels. Passive attacks from an eavesdropper collocated with the relay are considered. We derive upper and lower bounds on the secret key rate of this cooperative wireless system. The difference between the bounds is shown to be small for practical communication scenarios, which indicates they are tight. We then propose a practical secret key agreement protocol for this system with both the communicants and the honest relay participating in the public discussion. The tradeoff between security and protocol efficiency is considered in the joint design of advantage distillation, information reconciliation, and privacy amplification. The protocol parameters are optimized to achieve the tight bound on the secret key rate.
We study the problem of “privacy amplification”: key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on the internet, where passwords are the most commonly used security device.) We assume that the key agreement protocol is taking place in the presence of an active computationally unbounded adversary Eve. The adversary may have partial knowledge about w, so we assume only that w has some entropy from Eve’s point of view. Thus, the goal of the protocol is to convert this non-uniform secret w into a uniformly distributed string R that is fully secret from Eve. R may then be used as a key for running symmetric cryptographic protocols (such as encryption, authentication, etc.). Because we make no computational assumptions, the entropy in R can come only from w. Thus such a protocol must minimize the entropy loss during its execution, so that R is as long as possible. The best previous results have entropy loss of Θ(κ 2), where κ is the security parameter, thus requiring the password to be very long even for small values of κ. In this work, we present the first protocol for information-theoretic key agreement that has entropy loss linear in the security parameter. The result is optimal up