Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
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
Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols
ACM Transactions on Sensor Networks (TOSN)
Robust fuzzy extractors and authenticated key agreement from close secrets
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Opportunistic beamforming using dumb antennas
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
An overview of public key cryptography
IEEE Communications Magazine - Part Anniversary
Limitations of generating a secret key using wireless fading under active adversary
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
For wireless channels, a number of information-theoretic secret key exchange protocols have been proposed and analyzed for their efficiency in the literature. We contend that for such protocols in a realistic adversarial model that includes an active adversary, average number of message-bits that need to be exchanged to obtain one-bit of secret key is an important performance metric, which has been previously overlooked in the literature. Using this insight, we analytically study a recently popular class of information-theoretic secret key exchange protocols that is based on wireless channel fading. We obtain analytical results for specific cases and provide fundamental insights into the competitive performance of this class of information-theoretic secret key exchange protocols.