Protocols for Secret Key Agreement by Public Discussion Based on Common Information
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Privacy Amplification Theorem for Noisy Main Channel
ISC '01 Proceedings of the 4th International Conference on Information Security
On the (im)possibility of non-interactive correlation distillation
Theoretical Computer Science
Effect of source kurtosis on MIMO information rate
Digital Signal Processing
Security and privacy issues for the network of the future
Security and Communication Networks
Creating shared secrets out of thin air
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
Public and private resource trade-offs for a quantum channel
Quantum Information Processing
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
Limitations of generating a secret key using wireless fading under active adversary
IEEE/ACM Transactions on Networking (TON)
Low-power secret-key agreement over OFDM
Proceedings of the 2nd ACM workshop on Hot topics on wireless network security and privacy
Can bipartite classical information be activated?
Quantum Information & Computation
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
Creating secrets out of erasures
Proceedings of the 19th annual international conference on Mobile computing & networking
An approach for designing neural cryptography
ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part I
Security of plug-and-play QKD arrangements with finite resources
Quantum Information & Computation
Strong secrecy for multiple access channels
Information Theory, Combinatorics, and Search Theory
On oblivious transfer capacity
Information Theory, Combinatorics, and Search Theory
Multi-user wireless channel probing for shared key generation with a fuzzy controller
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 754.84 |
The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y, respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution P/sub XYZ/, can also receive all messages exchanged by the two parties over a public channel. The goal of a protocol is that the enemy obtains at most a negligible amount of information about S. Upper bounds on H(S) as a function of P/sub XYZ/ are presented. Lower bounds on the rate H(S)/N (as N to infinity ) are derived for the case in which X=(X/sub 1/, . . ., X/sub N/), Y=(Y/sub 1/, . . ., Y/sub N/) and Z=(Z/sub 1/, . . ., Z/sub N/) result from N independent executions of a random experiment generating X/sub i/, Y/sub i/ and Z/sub i/ for i=1, . . ., N. It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary symmetric channels, even when the enemy's channel is superior to the other two channels.