One-way rate-limited sequential key-distillation

We study the problem of key-distillation for a source model, with a one-way and rate-limited public communication between two legitimate users. Although, the secret-key capacity is already known, we provide an alternative achievability scheme, that directly translates into practical designs. We consider a sequential key-distillation strategy, which consists of a reconciliation phase followed by a privacy amplification phase performed with extractors. We determine the reconciliation capacity and show that, for a degraded source, such a sequential strategy leads to an optimal key-distillation strategy that achieves the secret-key capacity. We illustrate our results in the case of a binary source model.

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

[2]  Imre Csiszár,et al.  Secrecy Capacities for Multiterminal Channel Models , 2005, IEEE Transactions on Information Theory.

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

[4]  Gilles Brassard,et al.  Secret-Key Reconciliation by Public Discussion , 1994, EUROCRYPT.

[5]  Masahito Hayashi,et al.  Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification , 2009, IEEE Transactions on Information Theory.

[6]  Matthieu R. Bloch,et al.  Physical-Layer Security: From Information Theory to Security Engineering , 2011 .

[7]  Imre Csiszár,et al.  Towards a general theory of source networks , 1980, IEEE Trans. Inf. Theory.

[8]  Salil P. Vadhan,et al.  Extracting All the Randomness from a Weakly Random Source , 1998, Electron. Colloquium Comput. Complex..

[9]  Sui Tung,et al.  Multiterminal source coding (Ph.D. Thesis abstr.) , 1978, IEEE Trans. Inf. Theory.

[10]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

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

[12]  David Elkouss,et al.  Efficient reconciliation protocol for discrete-variable quantum key distribution , 2009, 2009 IEEE International Symposium on Information Theory.

[13]  Giuseppe Longo,et al.  The information theory approach to communications , 1977 .

[14]  Ueli Maurer,et al.  Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free , 2000, EUROCRYPT.

[15]  Shun Watanabe,et al.  Secret Key Agreement from Correlated Gaussian Sources by Rate Limited Public Communication , 2010, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

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

[17]  Chung Chan,et al.  Matroidal undirected network , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[18]  Himanshu Tyagi,et al.  When Is a Function Securely Computable? , 2010, IEEE Transactions on Information Theory.

[19]  Matthieu R. Bloch,et al.  Wireless Information-Theoretic Security , 2008, IEEE Transactions on Information Theory.

[20]  N. Cerf,et al.  Quantum key distribution using gaussian-modulated coherent states , 2003, Nature.

[21]  Andrew Thangaraj,et al.  LDPC-based Gaussian key reconciliation , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[22]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-I , 1973, IEEE Trans. Inf. Theory.

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

[24]  Rudolf Ahlswede,et al.  Common Randomness in Information Theory and Cryptography - Part II: CR Capacity , 1998, IEEE Trans. Inf. Theory.