Secrecy Capacities for Multiple Terminals
Top Cited Papers
- 30 November 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 50 (12) , 3047-3061
- https://doi.org/10.1109/tit.2004.838380
Abstract
We derive single-letter characterizations of (strong) secrecy capacities for models with an arbitrary number of terminals, each of which observes a distinct component of a discrete memoryless multiple source, with unrestricted and interactive public communication permitted between the terminals. A subset of these terminals can serve as helpers for the remaining terminals in generating secrecy. According to the extent of an eavesdropper's knowledge, three kinds of secrecy capacity are considered: secret key (SK), private key (PK), and wiretap secret key (WSK) capacity. The characterizations of the SK and PK capacities highlight the innate connections between secrecy generation and multiterminal source coding without secrecy requirements. A general upper bound for WSK capacity is derived which is tight in the case when the eavesdropper can wiretap noisy versions of the components of the underlying multiple source, provided randomization is permitted at the terminals. These secrecy capacities are seen to be achievable with noninteractive communication between the terminals. The achievability results are also shown to be universal.Keywords
This publication has 8 references indexed in Scilit:
- Communicating via a processing broadcast satelliteIEEE Transactions on Information Theory, 2002
- Common randomness and secret key generation with a helperIEEE Transactions on Information Theory, 2000
- Common randomness in information theory and cryptography. II. CR capacityIEEE Transactions on Information Theory, 1998
- The Strong Secret Key Rate of Discrete Random TriplesPublished by Springer Nature ,1994
- 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
- Gibbs Measures and Phase TransitionsPublished by Walter de Gruyter GmbH ,1988
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)IEEE Transactions on Information Theory, 1975