Universal secure network coding by non-linear secret key agreement

A non-linear secure network coding scheme is proposed where the secret is hidden by a non-linear function against any linear wiretappers. It is shown to achieve stronger notions of universality and security than linear secure network coding.

[1]  Masahito Hayashi,et al.  Secure Multiplex Network Coding , 2011, 2011 International Symposium on Networking Coding.

[2]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

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

[4]  Ning Cai,et al.  Secure Network Coding on a Wiretap Network , 2011, IEEE Transactions on Information Theory.

[5]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .

[6]  Emina Soljanin,et al.  Secure Network Coding for Wiretap Networks of Type II , 2009, IEEE Transactions on Information Theory.

[7]  Frank R. Kschischang,et al.  Universal Secure Network Coding via Rank-Metric Codes , 2008, IEEE Transactions on Information Theory.

[8]  Ueli Maurer,et al.  Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[9]  Gilles Brassard,et al.  Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..

[10]  Tomohiko Uyematsu,et al.  Explicit construction of universal strongly secure network coding via MRD codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[11]  Kunihiko Harada,et al.  Strongly Secure Linear Network Coding , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[12]  Anne Canteaut,et al.  A New Characterization of Almost Bent Functions , 1999, FSE.

[13]  Lawrence H. Ozarow,et al.  Wire-tap channel II , 1984, AT&T Bell Lab. Tech. J..