{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:06Z","timestamp":1746115866728,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_28","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"403-417","source":"Crossref","is-referenced-by-count":0,"title":["Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary"],"prefix":"10.1007","author":[{"given":"Paul","family":"Bunn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1006\/jagm.1996.0819","volume":"22","author":"Y. Afek","year":"1997","unstructured":"Afek, Y., Awerbuch, B., Gafni, E., Mansour, Y., Rosen, A., Shavit, N.: Slide\u2013 The Key to Poly. End-to-End Communication. J. of Algorithms\u00a022, 158\u2013186 (1997)","journal-title":"J. of Algorithms"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E., Ros\u00e9n, A.: The Slide Mechanism with Applications in Dynamic Networks. In: PODC, pp. 35\u201346 (1992)","DOI":"10.1145\/135419.135430"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1006\/jcss.1999.1681","volume":"60","author":"W. Aiello","year":"2000","unstructured":"Aiello, W., Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Adaptive Packet Routing For Bursty Adversarial Traffic. J. Comput. Syst. Sci.\u00a060(3), 482\u2013509 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR4","unstructured":"Aiello, W., Ostrovsky, R., Kushilevitz, E., Ros\u00e9n, A.: Dynamic Routing on Networks with Fixed-Size Buffers. In: SODA, pp. 771\u2013780 (2003)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Aspnes, J., Dwork, C., Waarts, O.: A Theory of Competitive Analysis for Distributed Algorithms. In: FOCS, pp. 32\u201340 (1994)","DOI":"10.1145\/197917.198178"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-00457-5_11","volume-title":"Theory of Cryptography","author":"Y. Amir","year":"2009","unstructured":"Amir, Y., Bunn, P., Ostrovsky, R.: Authenticated Adversarial Routing. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 163\u2013182. Springer, Heidelberg (2009)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Andrews, M., Awerbuch, B., Fern\u00e1ndez, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal Stability Results for Greedy Contention-Resolution Protocols. In: FOCS, pp. 380\u2013389 (1996)","DOI":"10.1109\/SFCS.1996.548497"},{"key":"28_CR8","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-Competitive On-Line Routing. In: FOCS, pp. 401\u2013411 (1993)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Holmer, D., Nina-Rotaru, C., Rubens, H.: An On-Demand Secure Routing Protocol Resilient to Byzantine Failures. In: Workshop on Wireless Security, pp. 21\u201330 (2002)","DOI":"10.1145\/570681.570684"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Leighton, T.: Improved Approximation Algorithms for the Multi-Commodity Flow Problem and Local Competitive Routing in Dynamic Networks. In: STOC, pp. 487\u2013496 (1994)","DOI":"10.1145\/195058.195238"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Mansour, Y., Shavit, N.: End-to-End Communication With Polynomial Overhead. In: FOCS, pp. 358\u2013363 (1989)","DOI":"10.1109\/SFCS.1989.63503"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-78967-3_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"B. Barak","year":"2008","unstructured":"Barak, B., Goldberg, S., Xiao, D.: Protocols and Lower Bounds for Failure Localization in the Internet. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 341\u2013360. Springer, Heidelberg (2008)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF Formulas on Ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"28_CR14","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Camb. Univ. Press (1998)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial Queuing Theory. In: STOC, pp. 376\u2013385 (1996)","DOI":"10.1145\/237814.237984"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Broder, A., Frieze, A., Upfal, E.: A General Approach to Dynamic Packet Routing with Bounded Buffers. In: FOCS, pp. 390\u2013399 (1996)","DOI":"10.1109\/SFCS.1996.548498"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-14162-1_20","volume-title":"Automata, Languages and Programming","author":"P. Bunn","year":"2010","unstructured":"Bunn, P., Ostrovsky, R.: Asynchronous Throughput-Optimal Routing in Malicious Networks. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 236\u2013248. Springer, Heidelberg (2010)"},{"key":"28_CR18","unstructured":"Bunn, P., Ostrovsky, R.: Secure End-to-End Communication with Optimal Throughput in Unreliable Networks. Cornell Univ. Library arXiv, Article No. 1304.2454 (2013), http:\/\/arxiv.org\/abs\/1304.2454"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Info. Theory\u00a031, 469\u2013472 (1985)","journal-title":"IEEE Transactions on Info. Theory"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/1384529.1375480","volume":"36","author":"S. Goldberg","year":"2008","unstructured":"Goldberg, S., Xiao, D., Tromer, E., Barak, B., Rexford, J.: Path-Quality Monitoring in the Presence of Adversaries. SIGMETRICS\u00a036, 193\u2013204 (2008)","journal-title":"SIGMETRICS"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. of Computer and System Sciences\u00a028, 270\u2013299 (1984)","journal-title":"J. of Computer and System Sciences"},{"issue":"6","key":"28_CR22","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1137\/S0097539795296760","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Log-Space Polynomial End-to-End Communication. SIAM Journal of Computing\u00a027(6), 1531\u20131549 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, \u00c9., Tragoudas, S.: Fast Approximation Algorithms for Multicommodity Flow Problem. In: STOC (1991)","DOI":"10.1145\/103418.103425"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A New Public-Key Cryptosystem as Secure as Factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"issue":"6","key":"28_CR25","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/49.400667","volume":"13","author":"S. Plotkin","year":"1995","unstructured":"Plotkin, S.: Competitive Routing of Virtual Circuits in ATM Networks. IEEE J. on Selected Areas in Communications\u00a013(6), 1128\u20131136 (1995)","journal-title":"IEEE J. on Selected Areas in Communications"},{"issue":"2","key":"28_CR26","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Amortized Efficiency of List Update and Paging Rules. Commun. ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T15:27:29Z","timestamp":1746026849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}