Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Capacity bounds for broadcast channels with confidential messages
IEEE Transactions on Information Theory
Secrecy generation for multiple input multiple output channel models
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Perfect secrecy, perfect omniscience and steiner tree packing
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Secret sharing over fast-fading MIMO wiretap channels
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
Secrecy capacity region of a multiple-antenna Gaussian broadcast channel with confidential messages
IEEE Transactions on Information Theory
On the location of an eavesdropper in multiterminal networks
IEEE Transactions on Information Forensics and Security
Automation and Remote Control
Information-theoretically secret key generation for fading wireless channels
IEEE Transactions on Information Forensics and Security
Information-theoretic key agreement of multiple terminals: part I
IEEE Transactions on Information Theory
Information-theoretic key agreement of multiple terminal: part II: channel model
IEEE Transactions on Information Theory
Secret key generation for a pairwise independent network model
IEEE Transactions on Information Theory
Perfect omniscience, perfect secrecy, and Steiner tree packing
IEEE Transactions on Information Theory
On information theoretic security: mathematical models and techniques
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Biometric Security from an Information-Theoretical Perspective
Foundations and Trends in Communications and Information Theory
| Hi-index | 755.20 |
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.