Secrecy capacities for multiple terminals

By Imre Csiszár, P. Narayan. IEEE Transactions on Information Theory, 2004

421 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/5b6d7d6820388a56a531d7739e7ef02538449205

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Computer Vision and Pattern Recognition

In Electrical and Electronic Engineering

Citations in the corpus

The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming (2007, background): “Notably, Csiszár and Narayan considered the case of multiple terminals where a number of terminals try to distill a secret key and a subset of these terminals can act as helper terminals to the rest in [24] and [25].”
On the Communication Complexity of Secure Computation (2013, neutral): “[35,11]), secure 2-party computation (e.”
Information-Theoretically Secret Key Generation for Fading Wireless Channels (2009, background): “This connection was formalized by [23] in the general setting of multi-terminal secrecy generation.”
Wireless Information-Theoretic Security (2008, result): “Notice that the secrecy condition used here (and in [2], [3]) is weaker than the one proposed by Maurer and Wolf in [27] or Narayan and Csiszár in [28], where the information obtained by the eavesdropper is negligibly small not just in terms of rate but in absolute terms.”
$f$ -Divergence Inequalities (2015, background): “a bound which finds use in information-theoretic security [30].”
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey (2010, background): “Csisz´ar and Narayan studied the augmentation of key-based secrecy capacity with the aid of a helper which supplies additional correlated information in [177], and obtained a single-letter characterization of the key-based secrecy capacities with an arbitrary number of terminals in [178].”