On Achieving a Positive Rate in the Source Model Key Agreement Problem

The two-party key agreement problem with public discussion, known as the source model problem, is considered for an erasure model for Eve's side information. By relating the key agreement problem to hypothesis testing, a new coding scheme is developed that yields an upper bound on the maximum erasure probability for which the secret-key (SK) capacity is zero. The bound is shown to be tight when Alice's or Bob's source is binary, and this shows that the new code achieves larger SK rates than the best known coding scheme. A full version of this paper with extensions to general models for Eve's side information is available in [1].

[1]  Alon Orlitsky,et al.  Secrecy Enhancement via Public Discussion , 1993, Proceedings. IEEE International Symposium on Information Theory.

[2]  Te Sun Han,et al.  The asymptotics of posterior entropy and error probability for Bayesian estimation , 1995, IEEE Trans. Inf. Theory.

[3]  Ueli Maurer,et al.  Protocols for Secret Key Agreement by Public Discussion Based on Common Information , 1992, CRYPTO.

[4]  P. Gács,et al.  Spreading of Sets in Product Spaces and Hypercontraction of the Markov Operator , 1976 .

[5]  Amin Gohari,et al.  From source model to quantum key distillation: An improved upper bound , 2014, 2014 Iran Workshop on Communication and Information Theory (IWCIT).

[6]  Chung Chan,et al.  On the Optimality of Secret Key Agreement via Omniscience , 2018, IEEE Transactions on Information Theory.

[7]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[8]  Himanshu Tyagi,et al.  A Bound For Multiparty Secret Key Agreement And Implications For A Problem Of Secure Computing , 2014, IACR Cryptol. ePrint Arch..

[9]  Sergio Verdú,et al.  Secret Key Generation With Limited Interaction , 2016, IEEE Transactions on Information Theory.

[10]  Chandra Nair,et al.  Upper concave envelopes and auxiliary random variables , 2013 .

[11]  U. Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[12]  Alexander Barg,et al.  Secret Key Generation for a Pairwise Independent Network Model , 2008, IEEE Transactions on Information Theory.

[13]  Imre Csiszár,et al.  Secrecy capacities for multiple terminals , 2004, IEEE Transactions on Information Theory.

[14]  Renato Renner,et al.  New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction , 2003, EUROCRYPT.

[15]  Joel E. Cohen,et al.  Relative entropy under mappings by stochastic matrices , 1993 .

[16]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[17]  Ueli Maurer,et al.  Unconditionally Secure Key Agreement and the Intrinsic Conditional Information , 1999, IEEE Trans. Inf. Theory.

[18]  Anuran Makur,et al.  Comparison of Channels: Criteria for Domination by a Symmetric Channel , 2016, IEEE Transactions on Information Theory.

[19]  Chung Chan,et al.  Multiterminal Secret Key Agreement , 2014, IEEE Transactions on Information Theory.

[20]  Chung Chan,et al.  When is omniscience a rate-optimal strategy for achieving secret key capacity? , 2016, 2016 IEEE Information Theory Workshop (ITW).

[21]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[22]  Amin Gohari,et al.  Coding for Positive Rate in the Source Model Key Agreement Problem , 2017, IEEE Transactions on Information Theory.

[23]  Himanshu Tyagi,et al.  Common Information and Secret Key Capacity , 2013, IEEE Transactions on Information Theory.

[24]  Prakash Ishwar,et al.  The Infinite-Message Limit of Two-Terminal Interactive Source Coding , 2009, IEEE Transactions on Information Theory.

[25]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[26]  Venkat Anantharam,et al.  Information-Theoretic Key Agreement of Multiple Terminals—Part I , 2010, IEEE Transactions on Information Theory.

[27]  Shun Watanabe,et al.  Key rate of quantum key distribution with hashed two-way classical communication , 2007, 2007 IEEE International Symposium on Information Theory.

[28]  Renato Renner,et al.  A property of the intrinsic mutual information , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..