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 …
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 …
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 …
On the optimality of secret key agreement via omniscience
For the multiterminal secret key agreement problem under a private source model, it is
known that the maximum key rate, ie, the secrecy capacity, can be achieved through …
known that the maximum key rate, ie, the secrecy capacity, can be achieved through …
Upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources
Hypergraphical sources are a natural class of sources for secret key generation, within
which different subsets of terminals sharing secrets are allowed to discuss publicly in order …
which different subsets of terminals sharing secrets are allowed to discuss publicly in order …
Secret key agreement under discussion rate constraints
For the multiterminal secret key agreement problem, new single-letter lower bounds are
obtained on the minimum public discussion rate required to achieve any given secret key …
obtained on the minimum public discussion rate required to achieve any given secret key …
Multiterminal secret key agreement at asymptotically zero discussion rate
In the multiterminal secret key agreement problem, a set of users want to discuss with each
other until they share a common secret key independent of their discussion. We want to …
other until they share a common secret key independent of their discussion. We want to …
Incremental and decremental secret key agreement
C Chan, A Al-Bashabsheh… - 2016 IEEE International …, 2016 - ieeexplore.ieee.org
We study the rate of change of the multivariate mutual information among a set of random
variables when some common randomness is added to or removed from a subset. This is …
variables when some common randomness is added to or removed from a subset. This is …
Comments On “Information-Theoretic Key Agreement of Multiple Terminals—Part I”
A Gohari, V Anantharam - IEEE Transactions on Information …, 2017 - ieeexplore.ieee.org
Theorem 5 of A. Gohari, V. Anantharam, IEEE Transactions on Information Theory, vol. 56,
no. 8, pp. 3973-3996, 2010, states an upper bound on the secrecy capacity for the source …
no. 8, pp. 3973-3996, 2010, states an upper bound on the secrecy capacity for the source …
Change of multivariate mutual information: From local to global
C Chan, A Al-Bashabsheh… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
We study the change of multivariate mutual information among a set of random variables
when some common randomness is added to or removed from a subset of the random …
when some common randomness is added to or removed from a subset of the random …