{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:32Z","timestamp":1763468132910},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642400834"},{"type":"electronic","value":"9783642400841"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40084-1_15","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T05:56:37Z","timestamp":1376459797000},"page":"258-276","source":"Crossref","is-referenced-by-count":11,"title":["Optimal Coding for Streaming Authentication and Interactive Communication"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Franklin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Gelles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonard J.","family":"Schulman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Bonsall, C.: The case of the hungry stranger. HarperCollins (1963)","key":"15_CR1"},{"doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Kalai, Y.T.: Efficient interactive coding against adversarial noise. In: IEEE Annual Symposium on Foundations of Computer Science, pp. 160\u2013166 (2012)","key":"15_CR2","DOI":"10.1109\/FOCS.2012.22"},{"doi-asserted-by":"crossref","unstructured":"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\u2013456 (2013)","key":"15_CR3","DOI":"10.1137\/1.9781611973105.32"},{"doi-asserted-by":"crossref","unstructured":"Braverman, M.: Towards deterministic tree code constructions. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 161\u2013167. ACM (2012)","key":"15_CR4","DOI":"10.1145\/2090236.2090250"},{"key":"15_CR5","first-page":"159","volume-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011","author":"M. Braverman","year":"2011","unstructured":"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\u2013166. ACM, New York (2011)"},{"issue":"6","key":"15_CR6","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/0-387-34805-0_24","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"S. Even","year":"1990","unstructured":"Even, S., Goldreich, O., Micali, S.: On-line\/Off-line digital signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 263\u2013275. Springer, Heidelberg (1990)"},{"unstructured":"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), \n                      \n                        http:\/\/eccc.hpi-web.de\/report\/2012\/104","key":"15_CR8"},{"doi-asserted-by":"crossref","unstructured":"Gelles, R., Moitra, A., Sahai, A.: Efficient and explicit coding for interactive communication. In: IEEE Annual Symposium on Foundations of Computer Science, pp. 768\u2013777 (2011)","key":"15_CR9","DOI":"10.1109\/FOCS.2011.51"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BFb0052235","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Gennaro","year":"1997","unstructured":"Gennaro, R., Rohatgi, P.: How to sign digital streams. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 180\u2013197. Springer, Heidelberg (1997)"},{"key":"15_CR11","series-title":"Basic applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of cryptography. Basic applications, vol.\u00a0II. Cambridge University Press, New York (2004)"},{"unstructured":"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)","key":"15_CR12"},{"doi-asserted-by":"crossref","unstructured":"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\u2013732 (2010)","key":"15_CR13","DOI":"10.1109\/FOCS.2010.74"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85174-5_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"B. Hemenway","year":"2008","unstructured":"Hemenway, B., Ostrovsky, R.: Public-key locally-decodable codes. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 126\u2013143. Springer, Heidelberg (2008)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-642-22935-0_51","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"B. Hemenway","year":"2011","unstructured":"Hemenway, B., Ostrovsky, R., Strauss, M.J., Wootters, M.: Public key locally decodable codes with short keys. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) RANDOM 2011 and APPROX 2011. LNCS, vol.\u00a06845, pp. 605\u2013615. Springer, Heidelberg (2011)"},{"key":"15_CR16","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/FOCS.2004.51","volume-title":"Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004","author":"M. Langberg","year":"2004","unstructured":"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\u2013334. IEEE Computer Society, Washington, DC (2004)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/3-540-57785-8_183","volume-title":"STACS 94","author":"R. Lipton","year":"1994","unstructured":"Lipton, R.: A new approach to information theory. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 699\u2013708. Springer, Heidelberg (1994)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30576-7_1","volume-title":"Theory of Cryptography","author":"S. Micali","year":"2005","unstructured":"Micali, S., Peikert, C., Sudan, M., Wilson, D.A.: Optimal error correction against computationally bounded noise. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 1\u201316. Springer, Heidelberg (2005)"},{"unstructured":"Miner, S., Staddon, J.: Graph-based authentication of digital streams. In: IEEE Symposium on Security and Privacy, pp. 232\u2013246 (2001)","key":"15_CR19"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ipl.2006.03.007","volume":"99","author":"M. Peczarski","year":"2006","unstructured":"Peczarski, M.: An improvement of the tree code construction. Information Processing Letters\u00a099(3), 92\u201395 (2006)","journal-title":"Information Processing Letters"},{"unstructured":"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\u201373 (2000)","key":"15_CR21"},{"doi-asserted-by":"crossref","unstructured":"Schulman, L.J.: Communication on noisy channels: a coding theorem for computation. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 724\u2013733 (1992)","key":"15_CR22","DOI":"10.1109\/SFCS.1992.267778"},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1145\/167088.167279","volume-title":"STOC 1993: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing","author":"L.J. Schulman","year":"1993","unstructured":"Schulman, L.J.: Deterministic coding for interactive communication. In: STOC 1993: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 747\u2013756. ACM, New York (1993)"},{"issue":"6","key":"15_CR24","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1109\/18.556671","volume":"42","author":"L.J. Schulman","year":"1996","unstructured":"Schulman, L.J.: Coding for interactive communication. IEEE Transactions on Information Theory\u00a042(6), 1745\u20131756 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"15_CR25","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0019-9958(58)90239-0","volume":"1","author":"C.E. Shannon","year":"1958","unstructured":"Shannon, C.E.: A note on a partial ordering for communication channels. Information and Control\u00a01(4), 390\u2013397 (1958)","journal-title":"Information and Control"},{"key":"15_CR26","first-page":"395","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007","author":"A. Smith","year":"2007","unstructured":"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\u2013404. Society for Industrial and Applied Mathematics, Philadelphia (2007)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40084-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T11:32:21Z","timestamp":1558006341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40084-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400834","9783642400841"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40084-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}