Upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources

C Chan, M Mukherjee, N Kashyap… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
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 …

Secret Key Agreement via Secure Omniscience

PK Vippathalla, C Chan, N Kashyap… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
In this paper, we explore the connection between secret key agreement and secure
omniscience within the setting of the multiterminal source model with an eavesdropper …

Secret key agreement and secure omniscience of tree-PIN source with linear wiretapper

PK Vippathalla, C Chan, N Kashyap… - 2021 IEEE International …, 2021 - ieeexplore.ieee.org
In this paper, we obtain a single-letter characterization of the wiretap secret key capacity for
a large class of multiterminal source models (namely, tree-PIN models) with a linear …

Capacity of 2-user linear computation broadcast with partially informed server

Y Yao, SA Jafar - IEEE Communications Letters, 2022 - ieeexplore.ieee.org
A linear computation broadcast (LCBC) setting is comprised of data that is stored at a server
and users who wish to retrieve their respective desired linear functions of the data, while …

Positivity of secret key capacity for hypergraphical sources with a linear wiretapper

PK Vippathalla, C Chan, N Kashyap… - 2022 IEEE Information …, 2022 - ieeexplore.ieee.org
The characterization of the secret key capacity with wiretapper side information is a
challenging open problem. In this paper, we give a necessary and sufficient condition for the …

Wiretap secret key agreement via secure omniscience

PK Vippathalla, C Chan, N Kashyap, Q Zhou - arXiv preprint arXiv …, 2021 - arxiv.org
In this paper, we explore the connection between secret key agreement and secure
omniscience within the setting of the multiterminal source model with a wiretapper who has …

Secure information exchange for omniscience

C Chan, N Kashyap, PK Vippathalla… - 2020 IEEE International …, 2020 - ieeexplore.ieee.org
We consider the problem of exchanging sensitive information in public and provide a
general formulation that can unify and extend various existing scenarios of information …

One-shot perfect secret key agreement for finite linear sources

C Chan, N Kashyap, PK Vippathalla… - 2019 IEEE International …, 2019 - ieeexplore.ieee.org
We consider a non-asymptotic (one-shot) version of the multiterminal secret key agreement
problem on a finite linear source model. In this model, the observation of each terminal is a …

Multiterminal Secret Key Agreement with Nearly No Discussion

C Chan, M Mukherjee, PK Vippathalla… - arXiv preprint arXiv …, 2019 - arxiv.org
We consider the secret key agreement problem under the multiterminal source model
proposed by Csisz\'ar and Narayan. A single-letter characterization of the secrecy capacity is …

Secret key agreement for hypergraphical sources with limited total discussion

C Chan - arXiv preprint arXiv:1910.01894, 2019 - arxiv.org
This work considers the problem of multiterminal secret key agreement by limited total public
discussion under the hypergraphical source model. The secrecy capacity as a function of the …