Secrecy via sources and channels — A secret key - Secret message rate tradeoff region
Authors:
- 1 July 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1010-1014
Abstract
Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. We study this problem of secret communication and secret key generation when two resources are available - correlated sources at Alice, Bob, and Eve, and a noisy broadcast channel from Alice to Bob and Eve. No other resource, in particular, no other channel is available. We are interested in characterizing the fundamental trade-off between the rates of the secret message and secret key. We present an achievable solution based on a separation architecture and prove its optimality under three settings: when Eve's source and channel are degraded versions of Bob's, and either Bob's source or channel is by itself useless in generating a secret key.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Secrecy via sources and channels — A secret key - Secret message rate tradeoff region2008
- Common randomness and secret key generation with a helperIEEE Transactions on Information Theory, 2000
- Common randomness in information theory and cryptography. I. Secret sharingIEEE Transactions on Information Theory, 1993
- Secret key agreement by public discussion from common informationIEEE Transactions on Information Theory, 1993
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978
- The Wire-Tap ChannelBell System Technical Journal, 1975
- Broadcast channelsIEEE Transactions on Information Theory, 1972