Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels
Top Cited Papers
- 20 August 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 2 (3) , 364-375
- https://doi.org/10.1109/tifs.2007.902666
Abstract
To establish a secure communications link between any two transceivers, the communicating parties require some shared secret, or key, with which to encrypt the message so that it cannot be understood by an enemy observer. Using the theory of reciprocity for antennas and electromagnetic propagation, a key distribution method is proposed that uses the ultrawideband (UWB) channel pulse response between two transceivers as a source of common randomness that is not available to enemy observers in other locations. The maximum size of a key that can be shared in this way is characterized by the mutual information between the observations of two radios, and an approximation and upper bound on mutual information is found for a general multipath channel and examples given for UWB channel models. The exchange of some information between the parties is necessary to achieve these bounds, and various information-sharing strategies are considered and their performance is simulated. A qualitative assessment of the vulnerability of such a secret sharing system to attack from a radio in a nearby location is also given.Keywords
This publication has 17 references indexed in Scilit:
- A Direct Derivation of a Single-Antenna Reciprocity Relation for the Time DomainIEEE Transactions on Antennas and Propagation, 2004
- Channel models for ultrawideband personal area networksIEEE Wireless Communications, 2003
- Distributed source coding using syndromes (DISCUS): design and constructionIEEE Transactions on Information Theory, 2003
- The ultra-wide bandwidth indoor channel: from statistical model to simulationsIEEE Journal on Selected Areas in Communications, 2002
- Common randomness and secret key generation with a helperIEEE Transactions on Information Theory, 2000
- Code-spread CDMA using maximum free distance low-rate convolutional codesIEEE Transactions on Communications, 2000
- Unconditionally secure key agreement and the intrinsic conditional informationIEEE Transactions on Information Theory, 1999
- Unconventional cryptographic keying variable managementIEEE Transactions on Communications, 1995
- Common randomness in information theory and cryptography. I. Secret sharingIEEE Transactions on Information Theory, 1993
- Channel coding with multilevel/phase signalsIEEE Transactions on Information Theory, 1982