On the (non)Universality of the One-Time Pad
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Weakening Security Assumptions and Oblivious Transfer (Abstract)
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
The common randomness capacity of a pair of independent discrete memoryless channels
IEEE Transactions on Information Theory
Common randomness and secret key generation with a helper
IEEE Transactions on Information Theory
Wireless Information-Theoretic Security
IEEE Transactions on Information Theory
On the (in)security of two Joint Encryption and Error Correction schemes
International Journal of Security and Networks
Secret key establishment over noisy channels
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
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.00 |
We study the problem of unconditionally secure Secret Key Establishment (SKE) when Alice and Bob are connected by two noisy channels that are eavesdropped by Eve. We consider the case that Alice and Bob do not have any sources of initial randomness at their disposal. We start by discussing special cases of interest where SKE is impossible and then provide a simple SKE construction over binary symmetric channels that achieves some rates of secret key. We next focus on the Secret Key (SK) capacity and provide lower and upper bounds on this capacity. We prove the lower bound by proposing a multi-round SKE protocol, called the main protocol. The main protocol consists of an initialization round and the repetition of a two-round SKE sub-protocol, called the basic protocol. We show that the two bounds coincide when channels do not leak information to the adversary. We apply the results to the case that communicants are connected by binary symmetric channels.