Simultaneous Secrecy and Reliability Amplification for a General Channel Model

We present a general notion of channel for cryptographic purposes, which can model either a classical physical channel or the consequences of a cryptographic protocol, or any hybrid. We consider simultaneous secrecy and reliability amplification for such channels. We show that simultaneous secrecy and reliability amplification is not possible for the most general model of channel, but, at least for some values of the parameters, it is possible for a restricted class of channels that still includes both standard information-theoretic channels and keyless cryptographic protocols. Even in the restricted model, we require that for the original channel, the failure chance for the attacker must be a factor c more than that for the intended receiver. We show that for any $$c > 4 $$c>4, there is a one-way protocol where the sender sends information to the receiver only which achieves simultaneous secrecy and reliability. From results of Holenstein and Renner CRYPTO'05, there are no such one-way protocols for $$c 1.5$$c>1.5, there are two-way protocols that achieve simultaneous secrecy and reliability. We propose using similar models to address other questions in the theory of cryptography, such as using noisy channels for secret agreement, trade-offs between reliability and secrecy, and the equivalence of various notions of oblivious channels and secure computation.

[1]  Krzysztof Pietrzak,et al.  Parallel Repetition of Computationally Sound Protocols Revisited , 2010, Journal of Cryptology.

[2]  Yevgeniy Dodis,et al.  Shannon Impossibility, Revisited , 2012, ICITS.

[3]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[4]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[5]  Junji Shikata.  Formalization of information-theoretic security for key agreement, revisited , 2013, 2013 IEEE International Symposium on Information Theory.

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

[7]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[8]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[9]  Ueli Maurer,et al.  Perfect cryptographic security from partially independent channels , 1991, STOC '91.

[10]  C. Crepeau,et al.  "Efficient cryptographic protocols based on noisy channels," Advances in Cryptology-EUROCRYPT'97 , 1997 .

[11]  Thomas Holenstein,et al.  One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption , 2005, CRYPTO.

[12]  Ueli Maurer,et al.  Constructive Cryptography - A New Paradigm for Security Definitions and Proofs , 2011, TOSCA.

[13]  Mitsugu Iwamoto,et al.  Security notions for information theoretically secure encryptions , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[14]  Jürg Wullschleger.  Oblivious-transfer amplification , 2007, Ausgezeichnete Informatikdissertationen.

[15]  Ran Canetti,et al.  Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[16]  Claude Crépeau,et al.  Efficient Cryptographic Protocols Based on Noisy Channels , 1997, EUROCRYPT.

[17]  Iftach Haitner.  A Parallel Repetition Theorem for Any Interactive Argument , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Joe Kilian,et al.  Achieving oblivious transfer using weakened security assumptions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[19]  Stefano Tessaro,et al.  Amplification of Chosen-Ciphertext Security , 2013, EUROCRYPT.

[20]  Rafail Ostrovsky,et al.  Constant-Rate Oblivious Transfer from Noisy Channels , 2011, CRYPTO.

[21]  Amit Sahai,et al.  A complete promise problem for statistical zero-knowledge , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[22]  Ueli Maurer,et al.  Abstract Cryptography , 2011, ICS.

[23]  Rafael Pass,et al.  An Efficient Parallel Repetition Theorem , 2010, TCC.

[24]  Jürg Wullschleger.  Oblivious Transfer from Weak Noisy Channels , 2009, TCC.

[25]  Grant Schoenebeck,et al.  General Hardness Amplification of Predicates and Puzzles - (Extended Abstract) , 2011, TCC.

[26]  Thomas Holenstein,et al.  Key agreement from weak bit agreement , 2005, STOC '05.

[27]  Alexander Vardy,et al.  Semantic Security for the Wiretap Channel , 2012, CRYPTO.

[28]  Leonid A. Levin,et al.  One-way functions and pseudorandom generators , 1985, STOC '85.

[29]  Rafael Pass,et al.  An efficient parallel repetition theorem for Arthur-Merlin games , 2007, STOC '07.

[30]  Moni Naor,et al.  Does parallel repetition lower the error in computationally sound protocols? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[31]  Kai-Min Chung,et al.  Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence , 2015 .

[32]  Kirill Morozov,et al.  Efficient Unconditional Oblivious Transfer from Almost Any Noisy Channel , 2004, SCN.

[33]  Rafail Ostrovsky,et al.  Cryptography with One-Way Communication , 2014, CRYPTO.

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

[35]  Shai Halevi,et al.  Degradation and Amplification of Computational Hardness , 2008, TCC.

[36]  Junji Shikata,et al.  Security Formalizations and Their Relationships for Encryption and Key Agreement in Information-Theoretic Cryptography , 2014, IEEE Transactions on Information Theory.

[37]  Shlomo Shamai,et al.  Information Theoretic Security , 2009, Found. Trends Commun. Inf. Theory.

[38]  Moni Naor,et al.  Immunizing Encryption Schemes from Decryption Errors , 2004, EUROCRYPT.

[39]  Feng-Hao Liu,et al.  Parallel Repetition Theorems for Interactive Arguments , 2010, TCC.

[40]  Ueli Maurer,et al.  Information-Theoretic Cryptography , 1999, CRYPTO.