Secret key establishment over noisy channels

Authors:
Hadi Ahmadi;Reihaneh Safavi-Naini
Affiliations:
Department of Computer Science, University of Calgary, Canada;Department of Computer Science, University of Calgary, Canada
Venue:
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
Year:
2011

Citing 2
Cited 0

Secret keys from channel noise

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder

General Theory of Information Transfer and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides a reflective overview of the research published in [3,4], which introduces a new realistic scenario for information theoretically secure key establishment. The scenario is when two parties are communicating over "noisy" channels that are eavesdropped by other parties in the environment. We define the secret key capacity as the highest achievable secret key rate, i.e., the highest number of secret key bits that the two parties can share on average per use of the channel. We study the above problem in two settings when the two parties have, or do not have, access to sources of local randomness. In each case, we derive lower and upper bounds on the SK capacity and derive the capacity for special cases. We also compare the bounds in the two settings and discuss the role of local randomness in increasing key rate.