Securing wireless systems via lower layer enforcements
WiSe '06 Proceedings of the 5th ACM workshop on Wireless security
Secure communications with an asymptotic secrecy model
Knowledge-Based Systems
Bayesian estimates in cryptography
ICCOM'05 Proceedings of the 9th WSEAS International Conference on Communications
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
BodyNets '09 Proceedings of the Fourth International Conference on Body Area Networks
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
Secret sharing over fast-fading MIMO wiretap channels
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
The candidate key protocol for generating secret shared keys from similar sensor data streams
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
Arbitrary jamming can preclude secure communication
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Information-theoretically secret key generation for fading wireless channels
IEEE Transactions on Information Forensics and Security
Secure wireless communication with dynamic secrets
INFOCOM'10 Proceedings of the 29th conference on Information communications
Exploiting multiple-antenna diversity for shared secret key generation in wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Automatic secret keys from reciprocal MIMO wireless channels: measurement and analysis
IEEE Transactions on Information Forensics and Security
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Privacy amplification with social networks
Proceedings of the 15th international conference on Security protocols
| Hi-index | 754.84 |
This is the first part of a three-part paper on secret-key agreement secure against active adversaries. In all three parts, we address the question whether two parties, knowing some correlated pieces of information X and Y, respectively, can generate a string S about which an adversary, knowing some information Z and having read and write access to the communication channel used by the legitimate partners, is almost completely ignorant. Whether such key agreement is possible, and if yes at which rate, is an inherent property of the joint probability distribution PXYZ. In this part, we first prove a number of general impossibility results. We then consider the important special case where the legitimate partners as well as the adversary have access to the outcomes of many independent repetitions of a fixed tripartite random experiment. In this case, the result characterizing the possibility of secret-key agreement secure against active adversaries is of all-or-nothing nature: either a secret key can be generated at the same rate as in the (well-studied) passive-adversary case, or such secret-key agreement is completely impossible. The exact condition characterizing the two cases is presented.