9 citations · 36 across the 22 of their papers we have counts for
22 papers
Wiretap Secret Key Agreement Via Secure Omniscience
Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap +1
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 side inf…
Structural Entropy of the Stochastic Block Models
Jie Han, Tao Guo, Qiaoqiao Zhou +3
With the rapid expansion of graphs and networks and the growing magnitude of data from all areas of science, effective treatment and compression schemes of context-dependent data i…
BAR: Blockwise Adaptive Recoding for Batched Network Coding
Hoover H. F. Yin, Shenghao Yang, Qiaoqiao Zhou +2
Multi-hop networks become popular network topologies in various emerging Internet of things applications. Batched network coding (BNC) is a solution to reliable communications in s…
A Unified Adaptive Recoding Framework for Batched Network Coding
Hoover H. F. Yin, Bin Tang, Ka Hei Ng +3
Batched network coding is a variation of random linear network coding which has low computational and storage costs. In order to adapt to random fluctuations in the number of erasu…
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper
Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap +1
While the wiretap secret key capacity remains unknown for general source models even in the two-user case, we obtained a single-letter characterization for a large class of multi-u…
Generalized Group Testing
Xiwei Cheng, Sidharth Jaggi, Qiaoqiao Zhou
In the problem of classical group testing one aims to identify a small subset (of size ) diseased individuals/defective items in a large population (of size ). This process i…
Multiterminal Secret Key Agreement with Nearly No Discussion
Chung Chan, Manuj Mukherjee, Praneeth Kumar Vippathalla +1
We consider the secret key agreement problem under the multiterminal source model proposed by Csiszár and Narayan. A single-letter characterization of the secrecy capacity is desir…
One-Shot Perfect Secret Key Agreement for Finite Linear Sources
Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla +1
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 i…
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources
Chung Chan, Manuj Mukherjee, Navin Kashyap +1
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 orde…
Secret Key Generation for Minimally Connected Hypergraphical Sources
Qiaoqiao Zhou, Chung Chan
This paper investigates the secret key generation in the multiterminal source model, where users observing correlated sources discuss interactively under limited rates to agree on…
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate
Chung Chan, Manuj Mukherjee, Navin Kashyap +1
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 c…
Agglomerative Info-Clustering
Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou
An agglomerative clustering of random variables is proposed, where clusters of random variables sharing the maximum amount of multivariate mutual information are merged successivel…
On the Optimality of Secret Key Agreement via Omniscience
Chung Chan, Manuj Mukherjee, Navin Kashyap +1
For the multiterminal secret key agreement problem under a private source model, it is known that the maximum key rate, i.e., the secrecy capacity, can be achieved through communic…
Info-Clustering: An Efficient Algorithm by Network Information Flow
Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou
Motivated by the fact that entities in a social network or biological system often interact by exchanging information, we propose an efficient info-clustering algorithm that can gr…
Secret Key Agreement under Discussion Rate Constraints
Chung Chan, Manuj Mukherjee, Navin Kashyap +1
For the multiterminal secret key agreement problem, new single-letter lower bounds are obtained on the public discussion rate required to achieve any given secret key rate below th…
Determining Optimal Rates for Communication for Omniscience
Ni Ding, Chung Chan, Qiaoqiao Zhou +2
This paper considers the communication for omniscience (CO) problem: A set of users observe a discrete memoryless multiple source and want to recover the entire multiple source via…
Duality between Feature Selection and Data Clustering
Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou +1
The feature-selection problem is formulated from an information-theoretic perspective. We show that the problem can be efficiently solved by an extension of the recently proposed i…
A Faster Algorithm for Asymptotic Communication for Omniscience
Ni Ding, Chung Chan, Qiaoqiao Zhou +2
We propose a modified decomposition algorithm (MDA) to solve the asymptotic communication for omniscience (CO) problem where the communication rates could be real or fractional. By…
Incremental and Decremental Secret Key Agreement
Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou
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 formula…
Info-Clustering: A Mathematical Theory for Data Clustering
Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou +2
We formulate an info-clustering paradigm based on a multivariate information measure, called multivariate mutual information, that naturally extends Shannon's mutual information be…
Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model
Manuj Mukherjee, Chung Chan, Navin Kashyap +1
In the multiterminal source model of Csiszr and Narayan, the communication complexity, , for secret key (SK) generation is the minimum rate of communicatio…
Fairness in Communication for Omniscience
Ni Ding, Chung Chan, Qiaoqiao Zhou +2
We consider the problem of how to fairly distribute the minimum sum-rate among the users in communication for omniscience (CO). We formulate a problem of minimizing a weighted quad…