activity
20162021
most citedSecret Key Agreement under Discussion Rate Constraints

3 citations · 10 across the 10 of their papers we have counts for

collaborators
Showing cs.ITShow all

20 papers · 1 filter

cs.IT2021★ 1 cited

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…

cs.IT2021

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…

cs.IT2021

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…

cs.IT2021

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…

cs.IT2021★ 2 cited

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…

cs.IT2021

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…