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.
In this work we suggest a constant-rate error-correction scheme and an efficient authentication scheme for data streams over a noisy channel (one-way communication, no feedback) in the shared-randomness model. Our first scheme does not assume shared randomness and (non-efficiently) recovers a (1 − 2c)-fraction prefix of the stream sent so far, assuming the noise level is at most c < 1/2. The length of the recovered prefix is tight.
To be able to overcome the c = 1/2 barrier we relax the model and assume the parties pre-share a secret key. Under this assumption we show that for any given noise rate c < 1, there exists a scheme that correctly decodes a (1 − c)-fraction of the stream sent so far with high probability, and moreover, the scheme is efficient. Furthermore, if the noise rate exceeds c, the scheme aborts with high probability. We also show that no constant-rate authentication scheme recovers more than a (1 − c)-fraction of the stream sent so far with non-negligible probability, thus the relation between the noise rate and recoverable fraction of the stream is tight, and our scheme is optimal.
Our techniques also apply to the task of interactive communication (two-way communication) over a noisy channel. In a recent paper, Braverman and Rao [STOC 2011] show that any function of two inputs has a constant-rate interactive protocol for two users that withstands a noise rate up to 1/4. By assuming that the parties share a secret random string, we extend this result and construct an interactive protocol that succeeds with overwhelming probability against noise rates up to 1/2. We also show that no constant-rate protocol exists for noise rates above 1/2 for functions that require two-way communication. This is contrasted with our first result in which computing the “function” requires only one-way communication and the noise rate can go up to 1.
Keywordsdata stream private codes adversarial noise authentication tree codes interactive communication
- 1.Bonsall, C.: The case of the hungry stranger. HarperCollins (1963)Google Scholar
- 2.Brakerski, Z., Kalai, Y.T.: Efficient interactive coding against adversarial noise. In: IEEE Annual Symposium on Foundations of Computer Science, pp. 160–166 (2012)Google Scholar
- 3.Brakerski, Z., Naor, M.: Fast algorithms for interactive coding. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, pp. 443–456 (2013)Google Scholar
- 4.Braverman, M.: Towards deterministic tree code constructions. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 161–167. ACM (2012)Google Scholar
- 5.Braverman, M., Rao, A.: Towards coding for maximum errors in interactive communication. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 159–166. ACM, New York (2011)Google Scholar
- 7.Even, S., Goldreich, O., Micali, S.: On-line/Off-line digital signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 263–275. Springer, Heidelberg (1990)Google Scholar
- 8.Franklin, M., Gelles, R., Ostrovsky, R., Schulman, L.J.: Optimal coding for streaming authentication and interactive communication. In: Electronic Colloquium on Computational Complexity (ECCC) (2012), http://eccc.hpi-web.de/report/2012/104
- 9.Gelles, R., Moitra, A., Sahai, A.: Efficient and explicit coding for interactive communication. In: IEEE Annual Symposium on Foundations of Computer Science, pp. 768–777 (2011)Google Scholar
- 12.Golle, P., Modadugu, N.: Authenticating streamed data in the presence of random packet loss. In: ISOC Network and Distributed System Security Symposium, NDSS 2001 (2001)Google Scholar
- 13.Guruswami, V., Smith, A.: Codes for computationally simple channels: Explicit constructions with optimal rate. In: IEEE Annual Symposium on Foundations of Computer Science, pp. 723–732 (2010)Google Scholar
- 16.Langberg, M.: Private codes or succinct random codes that are (almost) perfect. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004, pp. 325–334. IEEE Computer Society, Washington, DC (2004)Google Scholar
- 19.Miner, S., Staddon, J.: Graph-based authentication of digital streams. In: IEEE Symposium on Security and Privacy, pp. 232–246 (2001)Google Scholar
- 21.Perrig, A., Canetti, R., Tygar, J., Song, D.: Efficient authentication and signing of multicast streams over lossy channels. In: IEEE Symposium on Security and Privacy, pp. 56–73 (2000)Google Scholar
- 22.Schulman, L.J.: Communication on noisy channels: a coding theorem for computation. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 724–733 (1992)Google Scholar
- 26.Smith, A.: Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 395–404. Society for Industrial and Applied Mathematics, Philadelphia (2007)Google Scholar