Communication for Generating Correlation: A Unifying Survey

被引:26
作者
Sudan, Madhu [1 ]
Tyagi, Himanshu [2 ]
Watanabe, Shun [3 ]
机构
[1] Harvard Univ, John A Paulson Sch Engn & Appl Sci, Cambridge, MA 02138 USA
[2] Indian Inst Sci, Dept Elect Commun Engn, Bengaluru 560012, India
[3] Tokyo Univ Agr & Technol, Dept Comp & Informat Sci, Tokyo 1848588, Japan
基金
日本学术振兴会;
关键词
Random variables; Information theory; Correlation; Couplings; Task analysis; Computer science; Protocols; Common randomness; secret key generation; channel simulation; correlation generation; interactive communication; SECRET KEY AGREEMENT; COMMON RANDOMNESS CAPACITY; PRIVACY AMPLIFICATION; SIDE INFORMATION; CHANNEL SIMULATION; FUZZY EXTRACTORS; NOISE STABILITY; RANDOM BITS; IDENTIFICATION; CRYPTOGRAPHY;
D O I
10.1109/TIT.2019.2946364
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The task of manipulating correlated random variables in a distributed setting has received attention in the fields of both Information Theory and Computer Science. Often shared correlations can be converted, using a little amount of communication, into perfectly shared uniform random variables. Such perfect shared randomness, in turn, enables the solutions of many tasks. Even the reverse conversion of perfectly shared uniform randomness into variables with a desired form of correlation turns out to be insightful and technically useful. In this article, we describe progress-to-date on such problems and lay out pertinent measures, achievability results, limits of performance, and point to new directions.
引用
收藏
页码:5 / 37
页数:33
相关论文
共 192 条
[81]  
El Gamal A., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P100, DOI 10.1109/SFCS.1984.715906
[82]  
El Gamal A., 2011, Network Information Theory
[83]   On the Conditional Renyi Entropy [J].
Fehr, Serge ;
Berens, Stefan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (11) :6801-6810
[84]   COMPUTING WITH NOISY INFORMATION [J].
FEIGE, U ;
RAGHAVAN, P ;
PELEG, D ;
UPFAL, E .
SIAM JOURNAL ON COMPUTING, 1994, 23 (05) :1001-1018
[85]   When Are Fuzzy Extractors Possible? [J].
Fuller, Benjamin ;
Reyzin, Leonid ;
Smith, Adam .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2016, PT I, 2016, 10031 :277-306
[86]   Exponential Separation of Information and Communication for Boolean Functions [J].
Ganor, Anat ;
Kol, Gillat ;
Raz, Ran .
JOURNAL OF THE ACM, 2016, 63 (05)
[87]   The statistical problem of correlation as a variation and eigenvalue problem and its connection with the calculus of observations. [J].
Gebelein, H .
ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1941, 21 :364-379
[88]  
Ghazi B, 2018, SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1834
[89]   Decidability of Non-Interactive Simulation of Joint Distributions [J].
Ghazi, Badih ;
Kamath, Pritish ;
Sudan, Madhu .
2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, :545-554
[90]   Information-Theoretic Key Agreement of Multiple Terminals-Part II: Channel Model [J].
Gohari, Amin Aminzadeh ;
Anantharam, Venkat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 57 (08) :3997-4010