Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Elements of information theory
Elements of information theory
Secret-key reconciliation by public discussion
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting all the Randomness from a Weakly Random Source
Extracting all the Randomness from a Weakly Random Source
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Unconditionally secure key agreement and the intrinsic conditional information
IEEE Transactions on Information Theory
Hyper-Encryption and Everlasting Security
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Linking Classical and Quantum Key Agreement: Is There ``Bound Information''?
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
General paradigm for distilling classical key from quantum states
IEEE Transactions on Information Theory
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
Secrecy generation for multiple input multiple output channel models
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Channel scrambling for secrecy
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On the interplay between Shannon's information measures and reliability criteria
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Unifying classical and quantum key distillation
TCC'07 Proceedings of the 4th conference on Theory of cryptography
New bounds in secret-key agreement: the gap between formation and secrecy extraction
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Information-theoretically secret key generation for fading wireless channels
IEEE Transactions on Information Forensics and Security
Secure transmission with multiple antennas I: the MISOME wiretap channel
IEEE Transactions on Information Theory
On multiuser secrecy rate in flat fading channel
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Information-theoretic key agreement of multiple terminals: part I
IEEE Transactions on Information Theory
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
On information theoretic security: mathematical models and techniques
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Common randomness and secret key capacities of two-way channels
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Secure sketch for biometric templates
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Secrecy results for compound wiretap channels
Problems of Information Transmission
Message transmission and key establishment: conditions for equality of weak and strong capacities
FPS'12 Proceedings of the 5th international conference on Foundations and Practice of Security
Hi-index | 0.18 |
One of the basic problems in cryptography is the generation of a common secret key between two parties, for instance in order to communicate privately. In this paper we consider information-theoretically secure key agreement. Wyner and subsequently Csiszár and Körner described and analyzed settings for secret-key agreement based on noisy communication channels. Maurer as well as Ahlswede and Csiszár generalized these models to a scenario based on correlated randomness and public discussion. In all these settings, the secrecy capacity and the secret-key rate, respectively, have been defined as the maximal achievable rates at which a highly-secret key can be generated by the legitimate partners. However, the privacy requirements were too weak in all these definitions, requiring only the ratio between the adversary's information and the length of the key to be negligible, but hence tolerating her to obtain a possibly substantial amount of information about the resulting key in an absolute sense. We give natural stronger definitions of secrecy capacity and secret-key rate, requiring that the adversary obtains virtually no information about the entire key. We show that not only secret-key agreement satisfying the strong secrecy condition is possible, but even that the achievable key-generation rates are equal to the previous weak notions of secrecy capacity and secret-key rate. Hence the unsatisfactory old definitions can be completely replaced by the new ones. We prove these results by a generic reduction of strong to weak key agreement. The reduction makes use of extractors, which allow to keep the required amount of communication negligible as compared to the length of the resulting key.