暂无分享,去创建一个
[1] Miklos Santha,et al. Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..
[2] W. Beckner. Inequalities in Fourier analysis , 1975 .
[3] Himanshu Tyagi,et al. Universal Multiparty Data Exchange and Secret Key Agreement , 2016, IEEE Transactions on Information Theory.
[4] Venkatesan Guruswami,et al. Tight Bounds for Communication-Assisted Agreement Distillation , 2016, CCC.
[5] Sergio Verdú,et al. Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.
[6] A. Rényi. On measures of dependence , 1959 .
[7] M. Horodecki,et al. Quantum entanglement , 2007, quant-ph/0702225.
[8] M. Maurer,et al. Secret Key Agreement by Public Discussion from Common Information , 2004 .
[9] S. Watanabe,et al. Secret Key Agreement From Vector Gaussian Sources by Rate Limited Public Communication , 2011, IEEE Transactions on Information Forensics and Security.
[10] Neri Merhav,et al. Exact Random Coding Secrecy Exponents for the Wiretap Channel , 2017, IEEE Trans. Inf. Theory.
[11] H. Hirschfeld. A Connection between Correlation and Contingency , 1935, Mathematical Proceedings of the Cambridge Philosophical Society.
[12] H. Gebelein. Das statistische Problem der Korrelation als Variations‐ und Eigenwertproblem und sein Zusammenhang mit der Ausgleichsrechnung , 1941 .
[13] Remi A. Chou,et al. Separation of Reliability and Secrecy in Rate-Limited Secret-Key Generation , 2012, IEEE Transactions on Information Theory.
[14] Matthieu R. Bloch,et al. Strong Secrecy From Channel Resolvability , 2011, IEEE Transactions on Information Theory.
[15] Venkat Anantharam,et al. Information-Theoretic Key Agreement of Multiple Terminals—Part II: Channel Model , 2010, IEEE Transactions on Information Theory.
[16] Sergio Verdú,et al. Key generation with limited interaction , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[17] Sergio Verdú,et al. A Forward-Reverse Brascamp-Lieb Inequality: Entropic Duality and Gaussian Optimality , 2018, Entropy.
[18] Peter W. Shor,et al. Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem , 2001, IEEE Trans. Inf. Theory.
[19] L. Gross. LOGARITHMIC SOBOLEV INEQUALITIES. , 1975 .
[20] H. Vincent Poor,et al. The Likelihood Encoder for Lossy Compression , 2014, IEEE Transactions on Information Theory.
[21] Vincent Y. F. Tan,et al. On Exact and $\infty$-R\'enyi Common Informations , 2018, 1810.00295.
[22] M. Horodecki,et al. The Uniqueness Theorem for Entanglement Measures , 2001, quant-ph/0105017.
[23] Mark Braverman,et al. Information Equals Amortized Communication , 2011, IEEE Transactions on Information Theory.
[24] Venkat Anantharam,et al. The common randomness capacity of a network of discrete memoryless channels , 2000, IEEE Trans. Inf. Theory.
[25] Rudolf Ahlswede,et al. Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.
[26] Himanshu Tyagi,et al. Secret Key Agreement: General Capacity and Second-Order Asymptotics , 2016, IEEE Trans. Inf. Theory.
[27] Amin Gohari,et al. Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources , 2015, ICALP.
[28] R. Ahlswede. Elimination of correlation in random codes for arbitrarily varying channels , 1978 .
[29] Mark M. Wilde,et al. Quantum Rate-Distortion Coding With Auxiliary Resources , 2012, IEEE Transactions on Information Theory.
[30] A. Winter. Compression of sources of probability distributions and density operators , 2002, quant-ph/0208131.
[31] Shun Watanabe,et al. Key rate of quantum key distribution with hashed two-way classical communication , 2007, 2007 IEEE International Symposium on Information Theory.
[32] Himanshu Tyagi,et al. Strong Converse using Change of Measure Arguments , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[33] Ueli Maurer,et al. Unconditionally Secure Key Agreement and the Intrinsic Conditional Information , 1999, IEEE Trans. Inf. Theory.
[34] Himanshu Tyagi,et al. Information Complexity Density and Simulation of Protocols , 2017, IEEE Trans. Inf. Theory.
[35] Konstantin Makarychev,et al. Chain Independence and Common Information , 2012, IEEE Transactions on Information Theory.
[36] D. Zuckerman,et al. Explicit two-source extractors and resilient functions , 2016, Electron. Colloquium Comput. Complex..
[37] Imre Csisźar,et al. The Method of Types , 1998, IEEE Trans. Inf. Theory.
[38] Venkat Anantharam,et al. On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover , 2013, ArXiv.
[39] Chung Chan. Agreement of a restricted secret key , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[40] Rudolf Ahlswede,et al. Source coding with side information and a converse for degraded broadcast channels , 1975, IEEE Trans. Inf. Theory.
[41] O. F. Cook. The Method of Types , 1898 .
[42] A. Winter,et al. Quantum privacy and quantum wiretap channels , 2004 .
[43] Vinod M. Prabhakaran,et al. Assisted Common Information With an Application to Secure Two-Party Sampling , 2014, IEEE Transactions on Information Theory.
[44] S. Wehner,et al. Bell Nonlocality , 2013, 1303.2849.
[45] Amiram H. Kaspi,et al. Two-way source coding with a fidelity criterion , 1985, IEEE Trans. Inf. Theory.
[46] Xi Chen,et al. How to Compress Interactive Communication , 2013, SIAM J. Comput..
[47] Prakash Ishwar,et al. The Infinite-Message Limit of Two-Terminal Interactive Source Coding , 2009, IEEE Transactions on Information Theory.
[48] Amin Gohari,et al. Achievability Proof via Output Statistics of Random Binning , 2014, IEEE Trans. Inf. Theory.
[49] Prakash Ishwar,et al. Two-terminal distributed source coding with alternating messages for function computation , 2008, 2008 IEEE International Symposium on Information Theory.
[50] Venkat Anantharam,et al. The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels , 1998, IEEE Trans. Inf. Theory.
[51] Ronald L. Rivest,et al. The Optimality of Correlated Sampling , 2016, Electron. Colloquium Comput. Complex..
[52] Renato Renner,et al. Simple and Tight Bounds for Information Reconciliation and Privacy Amplification , 2005, ASIACRYPT.
[53] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[54] Vivek S. Borkar,et al. Common randomness and distributed control: A counterexample , 2007, Systems & control letters (Print).
[55] Sergio Verdú,et al. Key Capacity for Product Sources With Application to Stationary Gaussian Processes , 2014, IEEE Transactions on Information Theory.
[56] Navin Kashyap,et al. On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model , 2015, IEEE Transactions on Information Theory.
[57] Vincent Y. F. Tan,et al. Wyner's Common Information under Renyi Divergence Measures , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[58] Himanshu Tyagi,et al. Multiterminal Secrecy by Public Discussion , 2016, Found. Trends Commun. Inf. Theory.
[59] Aaron D. Wyner,et al. The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.
[60] A. Bonami. Étude des coefficients de Fourier des fonctions de $L^p(G)$ , 1970 .
[61] Vincent Y. F. Tan,et al. Exact Channel Synthesis , 2020, IEEE Transactions on Information Theory.
[62] Stefan Wolf,et al. New Monotones and Lower Bounds in Unconditional Two-Party Computation , 2008, IEEE Transactions on Information Theory.
[63] Masahito Hayashi,et al. Security analysis of ε-almost dual universal 2 hash functions , 2014 .
[64] Hideki Yagi. Channel resolvability theorems for general sources and channels , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[65] Renato Renner,et al. New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction , 2003, EUROCRYPT.
[66] Alon Orlitsky,et al. Interactive Data Comparison , 1984, FOCS.
[67] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.
[68] Sergio Verdú,et al. Beyond the blowing-up lemma: Sharp converses via reverse hypercontractivity , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[69] Masahito Hayashi,et al. Strong converse and second-order asymptotics of channel resolvability , 2014, 2014 IEEE International Symposium on Information Theory.
[70] Andrew Chi-Chih Yao,et al. Informational complexity and the direct sum problem for simultaneous message complexity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[71] Robert König,et al. The Operational Meaning of Min- and Max-Entropy , 2008, IEEE Transactions on Information Theory.
[72] S. Vadhan. Pseudorandomness II , 2009 .
[73] Leonid Reyzin,et al. When Are Fuzzy Extractors Possible? , 2016, IEEE Transactions on Information Theory.
[74] V. Strassen. The Existence of Probability Measures with Given Marginals , 1965 .
[75] Jun Muramatsu,et al. Channel Coding and Lossy Source Coding Using a Generator of Constrained Random Numbers , 2013, IEEE Transactions on Information Theory.
[76] Andreas J. Winter,et al. The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels , 2009, IEEE Transactions on Information Theory.
[77] Mark Braverman. Coding for interactive computation: Progress and challenges , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[78] Ryan O'Donnell,et al. Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[79] Imre Csiszár,et al. Secrecy capacities for multiple terminals , 2004, IEEE Transactions on Information Theory.
[80] Haim H. Permuter,et al. Coordination Capacity , 2009, IEEE Transactions on Information Theory.
[81] M. Mitzenmacher,et al. Probability and Computing: Chernoff Bounds , 2005 .
[82] Imre Csiszár,et al. Secrecy capacities for multiterminal channel models , 2005, ISIT.
[83] Chunxuan Ye,et al. Information Theoretic Generation of Multiple Secret Keys , 2005 .
[84] Joseph M. Renes,et al. Noisy Channel Coding via Privacy Amplification and Information Reconciliation , 2010, IEEE Transactions on Information Theory.
[85] Amin Gohari,et al. On Achieving a Positive Rate in the Source Model Key Agreement Problem , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).
[86] E. Carlen,et al. Subadditivity of The Entropy and its Relation to Brascamp–Lieb Type Inequalities , 2007, 0710.0870.
[87] P. Gács,et al. Spreading of Sets in Product Spaces and Hypercontraction of the Markov Operator , 1976 .
[88] Abbas El Gamal,et al. Exact common information , 2014, 2014 IEEE International Symposium on Information Theory.
[89] Eli Upfal,et al. Computing with Noisy Information , 1994, SIAM J. Comput..
[90] R. Renner,et al. The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory , 2009, 0912.3805.
[91] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[92] Salman Beigi,et al. $\Phi$ -Entropic Measures of Correlation , 2016, IEEE Transactions on Information Theory.
[93] Sergio Verdú,et al. Secret key generation with one communicator and a one-shot converse via hypercontractivity , 2015, ISIT.
[94] Venkat Anantharam,et al. On Non-Interactive Simulation of Joint Distributions , 2015, IEEE Transactions on Information Theory.
[95] Abbas El Gamal,et al. Strong functional representation lemma and applications to coding theorems , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[96] Vincent Yan Fu Tan,et al. Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information , 2013, IEEE Transactions on Information Theory.
[97] Elchanan Mossel,et al. On Extracting Common Random Bits From Correlated Sources , 2011, IEEE Transactions on Information Theory.
[98] Himanshu Tyagi,et al. A Bound For Multiparty Secret Key Agreement And Implications For A Problem Of Secure Computing , 2014, IACR Cryptol. ePrint Arch..
[99] Amin Gohari,et al. Coding for Positive Rate in the Source Model Key Agreement Problem , 2017, IEEE Transactions on Information Theory.
[100] Himanshu Tyagi,et al. Common Information and Secret Key Capacity , 2013, IEEE Transactions on Information Theory.
[101] Mark M. Wilde,et al. The information-theoretic costs of simulating quantum measurements , 2012, ArXiv.
[102] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[103] C. Borell. Geometric bounds on the Ornstein-Uhlenbeck velocity process , 1985 .
[104] Salman Beigi,et al. Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources , 2018, APPROX-RANDOM.
[105] R. A. McDonald,et al. Noiseless Coding of Correlated Information Sources , 1973 .
[106] Mark Braverman. Interactive information complexity , 2012, STOC '12.
[107] Venkat Anantharam,et al. Non-interactive simulation of joint distributions: The Hirschfeld-Gebelein-Rényi maximal correlation and the hypercontractivity ribbon , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[108] Masahito Hayashi,et al. General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel , 2006, IEEE Transactions on Information Theory.
[109] Himanshu Tyagi,et al. Converses For Secret Key Agreement and Secure Computing , 2014, IEEE Transactions on Information Theory.
[110] Imre Csiszár,et al. Secrecy Generation for Multiaccess Channel Models , 2013, IEEE Transactions on Information Theory.
[111] Elchanan Mossel,et al. Non interactive simulation of correlated distributions is decidable , 2018, SODA.
[112] Renato Renner,et al. Security of quantum key distribution , 2005, Ausgezeichnete Informatikdissertationen.
[113] Andrei Z. Broder,et al. On the resemblance and containment of documents , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).
[114] Alon Orlitsky,et al. Coding for computing , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[115] Gilles Brassard,et al. Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..
[116] Aaron D. Wyner,et al. The common information of two dependent random variables , 1975, IEEE Trans. Inf. Theory.
[117] Éva Tardos,et al. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[118] Jun Muramatsu,et al. Secret Key Capacity and Advantage Distillation Capacity , 2006, ISIT.
[119] Yasutada Oohama. Converse Coding Theorems for Identification via Channels , 2013, IEEE Transactions on Information Theory.
[120] Sergio Verdú,et al. Secret Key Generation With Limited Interaction , 2016, IEEE Transactions on Information Theory.
[121] I. Csiszár,et al. Common randomness and secret key generation with a helper , 1997, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).
[122] Piotr Indyk,et al. Nearest Neighbors in High-Dimensional Spaces , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[123] Prakash Ishwar,et al. Some Results on Distributed Source Coding for Interactive Function Computation , 2011, IEEE Transactions on Information Theory.
[124] Mohammad Reza Aref,et al. Simulation of a Channel With Another Channel , 2013, IEEE Transactions on Information Theory.
[125] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[126] Amin Gohari,et al. On the duality of additivity and tensorization , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[127] Gerhard Kramer,et al. Informational divergence approximations to product distributions , 2013, 2013 13th Canadian Workshop on Information Theory.
[128] Aaron D. Wyner,et al. On source coding with side information at the decoder , 1975, IEEE Trans. Inf. Theory.
[129] S. Massar,et al. Multipartite classical and quantum secrecy monotones , 2002, quant-ph/0202103.
[130] Paul W. Cuff,et al. Exact Soft-Covering Exponent , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[131] Junji Shikata,et al. Information Theoretic Security for Encryption Based on Conditional Rényi Entropies , 2013, ICITS.
[132] Masahito Hayashi,et al. General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel , 2005, ArXiv.
[133] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[134] Jun Muramatsu,et al. Secret Key Capacity for Optimally Correlated Sources Under Sampling Attack , 2006, IEEE Transactions on Information Theory.
[135] Mark Braverman,et al. From information to exact communication , 2013, STOC '13.
[136] Salman Beigi,et al. Equivalent characterization of reverse Brascamp-Lieb-type inequalities using information measures , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[137] Charles H. Bennett,et al. Mixed-state entanglement and quantum error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.
[138] Elchanan Mossel,et al. On Extracting Common Random Bits From Correlated Sources on Large Alphabets , 2010, IEEE Transactions on Information Theory.
[139] Shun Watanabe,et al. Channel Simulation and Coded Source Compression , 2015, IEEE Transactions on Information Theory.
[140] Rudolf Ahlswede,et al. Identification via channels , 1989, IEEE Trans. Inf. Theory.
[141] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[142] Ryan O'Donnell,et al. Analysis of Boolean Functions , 2014, ArXiv.
[143] H. Witsenhausen. ON SEQUENCES OF PAIRS OF DEPENDENT RANDOM VARIABLES , 1975 .
[144] T. S. Jayram,et al. Resource-Efficient Common Randomness and Secret-Key Schemes , 2017, SODA.
[145] Udi Manber,et al. Finding Similar Files in a Large File System , 1994, USENIX Winter.
[146] Ravi Kumar,et al. An information statistics approach to data stream and communication complexity , 2004, J. Comput. Syst. Sci..
[147] Ueli Maurer,et al. Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free , 2000, EUROCRYPT.
[148] Venkat Anantharam,et al. Information-Theoretic Key Agreement of Multiple Terminals—Part I , 2010, IEEE Transactions on Information Theory.
[149] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[150] Serge Fehr,et al. On the Conditional Rényi Entropy , 2014, IEEE Transactions on Information Theory.
[151] Paul W. Cuff,et al. Distributed Channel Synthesis , 2012, IEEE Transactions on Information Theory.
[152] Jingbo Liu,et al. Information Theory from A Functional Viewpoint , 2018 .
[153] Chung Chan,et al. On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals , 2008, ArXiv.
[154] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[155] Oleg Verbitsky. Towards the Parallel Repetition Conjecture , 1996, Theor. Comput. Sci..
[156] Amin Gohari,et al. Channel Simulation via Interactive Communications , 2012, IEEE Transactions on Information Theory.
[157] R. Cleve,et al. Nonlocality and communication complexity , 2009, 0907.3584.
[158] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[159] Omri Weinstein,et al. Information Complexity and the Quest for Interactive Compression , 2015, SIGA.
[160] Sik Kow Leung-Yan-Cheong. Multi-user and wiretap channels including feedback , 1976 .
[161] Masahito Hayashi,et al. Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification , 2009, IEEE Transactions on Information Theory.
[162] Suela Kodra. Fuzzy extractors : How to generate strong keys from biometrics and other noisy data , 2015 .
[163] Iordanis Kerenidis,et al. Multi-Party Protocols, Information Complexity and Privacy , 2019, ACM Trans. Comput. Theory.
[164] H. Vincent Poor,et al. Wiretap Channels: Nonasymptotic Fundamental Limits , 2017, IEEE Transactions on Information Theory.
[165] Himanshu Tyagi,et al. Secret key capacity for multipleaccess channel with public feedback , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[166] Ran Raz,et al. Exponential Separation of Information and Communication , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[167] Abbas El Gamal,et al. Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).
[168] Jaikumar Radhakrishnan,et al. The Communication Complexity of Correlation , 2007, IEEE Transactions on Information Theory.
[169] Rudolf Ahlswede,et al. Common Randomness in Information Theory and Cryptography - Part II: CR Capacity , 1998, IEEE Trans. Inf. Theory.
[170] Abbas El,et al. Interactive Data Compression , 2004 .
[171] Madhu Sudan,et al. Decidability of Non-interactive Simulation of Joint Distributions , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[172] Hiroki Koga,et al. Information-Spectrum Methods in Information Theory , 2002 .
[173] Mark Braverman,et al. Direct Products in Communication Complexity , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[174] Chung Chan,et al. Multiterminal secure source coding for a common secret source , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[175] Masahito Hayashi,et al. Tight Exponential Analysis of Universally Composable Privacy Amplification and Its Applications , 2010, IEEE Transactions on Information Theory.
[176] Vincent Y. F. Tan,et al. On Exact and ∞-Rényi Common Informations , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).
[177] Igor Devetak,et al. Channel Simulation With Quantum Side Information , 2009, IEEE Transactions on Information Theory.
[178] CHANDRA NAIR,et al. EQUIVALENT FORMULATIONS OF HYPERCONTRACTIVITY USING INFORMATION MEASURES , 2014 .
[179] Thomas Holenstein,et al. Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.
[180] A. Winter. ‘‘Extrinsic’’ and ‘‘Intrinsic’’ Data in Quantum Measurements: Asymptotic Convex Decomposition of Positive Operator Valued Measures , 2001, quant-ph/0109050.
[181] Salman Beigi,et al. Complete Classi fication of Generalized Santha-Vazirani Sources , 2017, Electron. Colloquium Comput. Complex..
[182] Eyal Kushilevitz,et al. Communication Complexity , 1997, Adv. Comput..