An overview of information-theoretic security and privacy: Metrics, limits and applications
This tutorial reviews fundamental contributions to information security. An integrative
viewpoint is taken that explains the security metrics, including secrecy, privacy, and others …
viewpoint is taken that explains the security metrics, including secrecy, privacy, and others …
Multivariate mutual information inspired by secret-key agreement
The capacity for multiterminal secret-key agreement inspires a natural generalization of
Shannon's mutual information from two random variables to multiple random variables …
Shannon's mutual information from two random variables to multiple random variables …
Info-clustering: A mathematical theory for data clustering
C Chan, A Al-Bashabsheh, Q Zhou… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
We formulate an info-clustering paradigm based on a multivariate information measure,
called multivariate mutual information, that naturally extends Shannon's mutual information …
called multivariate mutual information, that naturally extends Shannon's mutual information …
Cooperative group secret key generation based on secure network coding
S **ao, Y Guo, K Huang, L ** - IEEE Communications Letters, 2018 - ieeexplore.ieee.org
Most of the existing works on group secret key (GSK) generation are based on pairwise key
which wasting the total time and power of the group users. We present a cooperative GSK …
which wasting the total time and power of the group users. We present a cooperative GSK …
Coding for positive rate in the source model key agreement problem
A two-party key agreement problem with public discussion, known as the source model
problem, is considered. By relating key agreement to hypothesis testing, a new coding …
problem, is considered. By relating key agreement to hypothesis testing, a new coding …
Optimal rate-limited secret key generation from Gaussian sources using lattices
We propose a lattice-based scheme for secret key generation from Gaussian sources in the
presence of an eavesdropper, and show that it achieves the strong secret key capacity in the …
presence of an eavesdropper, and show that it achieves the strong secret key capacity in the …
Secret key generation from Gaussian sources using lattice-based extractors
We propose a lattice-based scheme for secret key generation from Gaussian sources in the
presence of an eavesdropper, and show that it achieves the strong secret key capacity in the …
presence of an eavesdropper, and show that it achieves the strong secret key capacity in the …
On the Source Model Key Agreement Problem
We consider the source model key agreement problem involving two legitimate parties and
an eavesdropper who observe n iid samples of X and Y and Z respectively. The best-known …
an eavesdropper who observe n iid samples of X and Y and Z respectively. The best-known …
Multiple Key-cast over Networks
The multicast key-dissemination problem over noiseless networks, introduced by Langberg
and Effros [ITW 2022], here called the``key-cast''problem, captures the task of disseminating …
and Effros [ITW 2022], here called the``key-cast''problem, captures the task of disseminating …
Multi-party secret key agreement over state-dependent wireless broadcast channels
We consider a group of m trusted and authenticated nodes that aim to create a shared secret
key K over a wireless channel in the presence of an eavesdropper Eve. We assume that …
key K over a wireless channel in the presence of an eavesdropper Eve. We assume that …