Multiple Secret Key Generation: Information Theoretic Models and Key Capacity Regions

[1]  Lifeng Lai,et al.  Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models , 2015, IEEE Transactions on Information Theory.

[2]  Hua Wang,et al.  The Capacity Region of the Source-Type Model for Secret Key and Private Key Generation , 2014, IEEE Transactions on Information Theory.

[3]  Amin Gohari,et al.  Achievability Proof via Output Statistics of Random Binning , 2012, IEEE Transactions on Information Theory.

[4]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[5]  Shun Watanabe,et al.  Secret key agreement from vector Gaussian sources by rate limited public communication , 2010, 2010 IEEE International Symposium on Information Theory.

[6]  H. Vincent Poor,et al.  A Unified Framework for Key Agreement Over Wireless Fading Channels , 2009, IEEE Transactions on Information Forensics and Security.

[7]  Shlomo Shamai,et al.  Multiple-Input Multiple-Output Gaussian Broadcast Channels With Confidential Messages , 2009, IEEE Transactions on Information Theory.

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

[9]  David Tse,et al.  Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels , 2007, IEEE Transactions on Information Forensics and Security.

[10]  Chunxuan Ye,et al.  Information Theoretic Generation of Multiple Secret Keys , 2005 .

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

[12]  Ueli Maurer,et al.  Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result , 2003, IEEE Trans. Inf. Theory.

[13]  Ueli Maurer,et al.  Secret-key agreement over unauthenticated public channels II: the simulatability condition , 2003, IEEE Trans. Inf. Theory.

[14]  Ueli Maurer,et al.  Secret-key agreement over unauthenticated public channels III: Privacy amplification , 2003, IEEE Trans. Inf. Theory.

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

[16]  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).

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

[18]  Mihalis Yannakakis,et al.  Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..

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

[20]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[21]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .