Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Fundamentals of wireless communication
Fundamentals of wireless communication
Robust key generation from signal envelopes in wireless networks
Proceedings of the 14th ACM conference on Computer and communications security
Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
SIAM Journal on Computing
Radio-telepathy: extracting a secret key from an unauthenticated wireless channel
Proceedings of the 14th ACM international conference on Mobile computing and networking
Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols
ACM Transactions on Sensor Networks (TOSN)
Zero pre-shared secret key establishment in the presence of jammers
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
On the effectiveness of secret key extraction from wireless signal strength in real environments
Proceedings of the 15th annual international conference on Mobile computing and networking
A note on information-theoretic secret key exchange over wireless channels
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Secure physical layer key generation schemes: performance and information theoretic limits
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Exploiting multiple-antenna diversity for shared secret key generation in wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels
IEEE Transactions on Information Forensics and Security - Part 1
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Noiseless coding of correlated information sources
IEEE Transactions on Information Theory
New directions in cryptography
IEEE Transactions on Information Theory
Distributed source coding using syndromes (DISCUS): design and construction
IEEE Transactions on Information Theory
Secure space-time communication
IEEE Transactions on Information Theory
Wireless Information-Theoretic Security
IEEE Transactions on Information Theory
Secure Broadcasting Over Fading Channels
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. I. Secret sharing
IEEE Transactions on Information Theory
Secret key agreement by public discussion from common information
IEEE Transactions on Information Theory
Secret Key Agreement From Vector Gaussian Sources by Rate Limited Public Communication
IEEE Transactions on Information Forensics and Security - Part 1
| Hi-index | 0.00 |
Recently, many research studies have explored the use of wireless fading to generate an information-theoretic shared secret key over an open wireless channel. While this line of research is now mature enough to be built into demonstrative working systems for scenarios involving a (limited) passive/eavesdropping adversary model, the case of an active (jamming) adversary has not been sufficiently studied. Under an active adversary, information-bits that need to be exchanged during the process of key setup will not only be subject to eavesdropping, but also message disruptions that could lead to a high communication cost per bit of secret key generated. Measuring efficiency of key exchange as the ratio of communication cost to the size of secret key generated, in this paper, we address the following question: Is generating a secret key by exploiting wireless fading an efficient process? We obtain analytical results that quantify the minimum number of information-bits that must be exchanged to obtain one bit of shared secret key and show that this number rapidly increases with an active adversary's signal power. Thus, through our analysis, we conclude that the effectiveness of generating a secret key from wireless fading is limited when considering active adversaries.