Optimal Coding for Streaming Authentication and Interactive Communication

Error correction and message authentication are well studied in the literature, and various efficient solutions have been suggested and analyzed. This is however not the case for data streams in which the message is very long, possibly infinite, and not known in advance to the sender. Trivial solutions for error-correcting and authenticating data streams either suffer from a long delay at the receiver’s end or cannot perform well when the communication channel is noisy.

[1]  Rafail Ostrovsky,et al.  Efficient Error-Correcting Codes for Sliding Windows , 2014, SOFSEM.

[2]  Venkatesan Guruswami,et al.  Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[3]  Richard J. Lipton,et al.  A New Approach To Information Theory , 1994, STACS.

[4]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[5]  Silvio Micali,et al.  Optimal Error Correction Against Computationally Bounded Noise , 2005, TCC.

[6]  Gilles Brassard,et al.  Noisy Interactive Quantum Communication , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[7]  Marcin Peczarski.  An improvement of the tree code construction , 2006, Inf. Process. Lett..

[8]  Rafail Ostrovsky,et al.  Public Key Locally Decodable Codes with Short Keys , 2011, APPROX-RANDOM.

[9]  Mark Braverman,et al.  Toward Coding for Maximum Errors in Interactive Communication , 2011, IEEE Transactions on Information Theory.

[10]  Silvio Micali,et al.  On-Line/Off-Line Digital Schemes , 1989, CRYPTO.

[11]  Yael Tauman Kalai,et al.  Efficient Interactive Coding against Adversarial Noise , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[12]  Rafail Ostrovsky,et al.  Public-Key Locally-Decodable Codes , 2008, CRYPTO.

[13]  Philippe Golle,et al.  Authenticating Streamed Data in the Presence of Random Packet Loss , 2001, NDSS.

[14]  Bernhard Haeupler,et al.  Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[15]  F. MacWilliams,et al.  Codes which detect deception , 1974 .

[16]  Klim Efremenko,et al.  Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback , 2015, IEEE Transactions on Information Theory.

[17]  Mark Braverman,et al.  List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise , 2014, FOCS.

[18]  Leonard J. Schulman,et al.  Communication on noisy channels: a coding theorem for computation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[19]  Ran Canetti,et al.  Efficient authentication and signing of multicast streams over lossy channels , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[20]  Michael Langberg,et al.  Private codes or succinct random codes that are (almost) perfect , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[21]  Claude E. Shannon,et al.  A Note on a Partial Ordering for Communication Channels , 1958, Information and Control.

[22]  Crosby Newell Bonsall,et al.  The Case of the Hungry Stranger , 1963 .

[23]  Moni Naor,et al.  Fast Algorithms for Interactive Coding , 2013, SODA.

[24]  Rafail Ostrovsky,et al.  Optimal Coding for Streaming Authentication and Interactive Communication , 2015, IEEE Transactions on Information Theory.

[25]  Mark Braverman,et al.  Towards deterministic tree code constructions , 2012, ITCS '12.

[26]  Cristopher Moore,et al.  Tree codes and a conjecture on exponential sums , 2013, ITCS.

[27]  Amit Sahai,et al.  Efficient and Explicit Coding for Interactive Communication , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[28]  Jessica Staddon,et al.  Graph-based authentication of digital streams , 2001, Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001.

[29]  Rosario Gennaro,et al.  How to Sign Digital Streams , 1997, CRYPTO.

[30]  Madhu Sudan,et al.  Optimal error rates for interactive coding I: adaptivity and other settings , 2013, STOC.

[31]  Amit Sahai,et al.  Efficient Coding for Interactive Communication , 2014, IEEE Transactions on Information Theory.

[32]  Leonard J. Schulman.  Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.

[33]  Leonard J. Schulman,et al.  Deterministic coding for interactive communication , 1993, STOC.

[34]  Adam D. Smith.  Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes , 2007, SODA '07.