{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T17:46:08Z","timestamp":1768585568951,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,12,19]],"date-time":"2013-12-19T00:00:00Z","timestamp":1387411200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s00145-013-9176-3","type":"journal-article","created":{"date-parts":[[2013,12,18]],"date-time":"2013-12-18T15:49:49Z","timestamp":1387381789000},"page":"745-768","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Almost-Everywhere Secure Computation with Edge Corruptions"],"prefix":"10.1007","volume":"28","author":[{"given":"Nishanth","family":"Chandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Garay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,19]]},"reference":[{"key":"9176_CR1","first-page":"361","volume-title":"Proceedings CRYPTO\u201905, The 25th Annual International Cryptology Conference","author":"B. Barak","year":"2005","unstructured":"B. Barak, R. Canetti, Y. Lindell, R. Pass, T. Rabin, Secure computation without authentication, in Proceedings CRYPTO\u201905, The 25th Annual International Cryptology Conference, August 14\u201318, 2005, Santa Barbara, California, USA (2005), pp. 361\u2013377"},{"issue":"1","key":"9176_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(98)00241-2","volume":"220","author":"A. Beimel","year":"1999","unstructured":"A. Beimel, M. Franklin, Reliable communication over partially authenticated networks. Theor. Comput. Sci. 220(1), 185\u2013210 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"9176_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","volume-title":"STOC, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing","author":"M. Ben-Or","year":"1988","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in STOC, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA (1988), pp. 1\u201310"},{"key":"9176_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1006\/jagm.1996.0810","volume":"22","author":"P. Berman","year":"1997","unstructured":"P. Berman, K. Diks, A. Pelc, Reliable broadcasting in logarithmic time with Byzantine link failures. J.\u00a0Algorithms 22, 199\u2013211 (1997). 1997","journal-title":"J.\u00a0Algorithms"},{"key":"9176_CR5","first-page":"321","volume-title":"WDAG, Distributed Algorithms, the 4th International Workshop","author":"P. Berman","year":"1990","unstructured":"P. Berman, J.A. Garay, Fast consensus in networks of bounded degree (extended abstract), in WDAG, Distributed Algorithms, the 4th International Workshop, September 24\u201326, 1990, Bari, Italy (1990), pp. 321\u2013333"},{"key":"9176_CR6","first-page":"249","volume-title":"Proceedings ICALP (2), The 37th International Colloquium, ICALP 2010, Part II","author":"N. Chandran","year":"2010","unstructured":"N. Chandran, J.A. Garay, R. Ostrovsky, Improved fault tolerance and secure computation on sparse networks, in Proceedings ICALP (2), The 37th International Colloquium, ICALP 2010, Part II, July 6\u201310, 2010, Bordeaux, France (2010), pp. 249\u2013260"},{"key":"9176_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/62212.62214","volume-title":"STOC, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols (abstract), in STOC, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA (1988), pp. 11\u201319"},{"key":"9176_CR8","volume-title":"Combinatorics, Probability and Computing","author":"B. Chlebus","year":"1996","unstructured":"B. Chlebus, K. Diks, A. Pelc, Reliable broadcasting in hypercubes with random link and node failures, in Combinatorics, Probability and Computing, vol.\u00a05 (1996)"},{"key":"9176_CR9","first-page":"978","volume-title":"Proc. of the 28th Annual Allerton Conference on Communication, Control and Computing","author":"K. Diks","year":"1990","unstructured":"K. Diks, A. Pelc, Reliable gossip schemes with random link failures, in Proc. of the 28th Annual Allerton Conference on Communication, Control and Computing, Allerton, Illinois (1990), pp. 978\u2013987."},{"issue":"1","key":"9176_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"D. Dolev, The Byzantine generals strike again. J. Algorithms 3(1), 14\u201330 (1982)","journal-title":"J. Algorithms"},{"key":"9176_CR11","first-page":"36","volume-title":"FOCS, The 31st Annual Symposium on Foundations of Computer Science","author":"D. Dolev","year":"1990","unstructured":"D. Dolev, C. Dwork, O. Waarts, M. Yung, Perfectly secure message transmission, in FOCS, The 31st Annual Symposium on Foundations of Computer Science, October 22\u201324, 1990, St. Louis, Missouri, USA (1990), pp. 36\u201345"},{"key":"9176_CR12","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1145\/12130.12169","volume-title":"STOC, Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing","author":"C. Dwork","year":"1986","unstructured":"C. Dwork, D. Peleg, N. Pippenger, E. Upfal, Fault tolerance in networks of bounded degree (preliminary version), in STOC, Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, May 28\u201330, 1986, Berkeley, California, USA (1986), pp. 370\u2013379"},{"key":"9176_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/872035.872066","volume-title":"PODC","author":"M. Fitzi","year":"2003","unstructured":"M. Fitzi, J.A. Garay, Efficient player-optimal protocols for strong and differential consensus, in PODC, (2003), pp. 211\u2013220"},{"key":"9176_CR14","first-page":"126","volume-title":"Coding and Cryptology\u2014The Third International Workshop, IWCC Proceedings 2011","author":"J.A. Garay","year":"2011","unstructured":"J.A. Garay, C. Givens, R. Ostrovsky, Secure message transmission by public discussion: a brief survey, in Coding and Cryptology\u2014The Third International Workshop, IWCC Proceedings 2011, May 30\u2013June 3, 2011, Qingdao, China (2011), pp. 126\u2013141"},{"key":"9176_CR15","first-page":"307","volume-title":"EUROCRYPT, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"J.A. Garay","year":"2008","unstructured":"J.A. Garay, R. Ostrovsky, Almost-everywhere secure computation, in EUROCRYPT, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, April 13\u201317, 2008, Istanbul, Turkey (2008), pp. 307\u2013323"},{"key":"9176_CR16","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"STOC, Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in STOC, Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25\u201327 May 1987, New York City, NY, USA (1987), pp. 218\u2013229"},{"key":"9176_CR17","first-page":"144","volume-title":"Stabilization, Safety, and Security of Distributed Systems\u2014The 12th International Symposium, Proceedings SSS 2010","author":"S.D. Gordon","year":"2010","unstructured":"S.D. Gordon, J. Katz, R. Kumaresan, A. Yerukhimovich, Authenticated broadcast with a partially compromised public-key infrastructure, in Stabilization, Safety, and Security of Distributed Systems\u2014The 12th International Symposium, Proceedings SSS 2010, September 20\u201322, 2010, New York, NY, USA (2010), pp. 144\u2013158"},{"key":"9176_CR18","first-page":"87","volume-title":"FOCS, 47th Annual IEEE Symposium on Foundations of Computer Science","author":"V. King","year":"2006","unstructured":"V. King, J. Saia, V. Sanwalani, E. Vee, Towards secure and scalable computation in peer-to-peer networks, in FOCS, 47th Annual IEEE Symposium on Foundations of Computer Science, 21\u201324 October 2006, Berkeley, California, USA (2006), pp. 87\u201398"},{"issue":"3","key":"9176_CR19","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"L. Lamport, R. Shostak, M. Pease, The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9176_CR20","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. Shostak, L. Lamport, Reaching agreement in the presence of faults. J. ACM 27, 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"9176_CR21","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/net.3230220503","volume":"22","author":"A. Pelc","year":"1992","unstructured":"A. Pelc, Reliable communication in networks with Byzantine link failures. Networks 22, 441\u2013459 (1992)","journal-title":"Networks"},{"key":"9176_CR22","first-page":"352","volume-title":"Proceedings COCOON\u201996, Computing and Combinatorics, Second Annual International Conference","author":"V. Shanbhogue","year":"1996","unstructured":"V. Shanbhogue, M. Yung, Distributed computing in asynchronous networks with Byzantine edges, in Proceedings COCOON\u201996, Computing and Combinatorics, Second Annual International Conference, June 17\u201319, 1996, Hong Kong (1996), pp. 352\u2013360"},{"key":"9176_CR23","first-page":"83","volume-title":"PODC","author":"E. Upfal","year":"1992","unstructured":"E. Upfal, Tolerating linear number of faults in networks of bounded degree, in PODC, (1992), pp. 83\u201389"},{"issue":"4","key":"9176_CR24","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/71.372796","volume":"6","author":"S.-C. Wang","year":"1995","unstructured":"S.-C. Wang, Y.-H. Chin, K.-Q. Yan, Byzantine agreement in a generalized connected network. IEEE Trans. Parallel Distrib. Syst. 6(4), 420\u2013427 (1995)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"9176_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/991130.991134","volume":"38","author":"S.-C. Wang","year":"2004","unstructured":"S.-C. Wang, K.-Q. Yan, Revisiting fault diagnosis agreement in a new territory. Oper. Syst. Rev. 38(2), 41\u201361 (2004)","journal-title":"Oper. Syst. Rev."},{"issue":"3","key":"9176_CR26","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/69.142017","volume":"4","author":"K.-Q. Yan","year":"1992","unstructured":"K.-Q. Yan, Y.-H. Chin, S.-C. Wang, Optimal agreement protocol in malicious faulty processors and faulty links. IEEE Trans. Knowl. Data Eng. 4(3), 266\u2013280 (1992)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9176_CR27","first-page":"160","volume-title":"FOCS, The 23rd Annual Symposium on Foundations of Computer Science","author":"A.C.-C. Yao","year":"1982","unstructured":"A.C.-C. Yao, Protocols for secure computations (extended abstract), in FOCS, The 23rd Annual Symposium on Foundations of Computer Science, 3\u20135 November 1982, Chicago, Illinois, USA (1982), pp. 160\u2013164"},{"key":"9176_CR28","first-page":"274","volume-title":"Theory of Cryptography, the 6th Theory of Cryptography Conference, Proceedings TCC 2009","author":"V. Zikas","year":"2009","unstructured":"V. Zikas, S. Hauser, U.M. Maurer, Realistic failures in secure multi-party computation, in Theory of Cryptography, the 6th Theory of Cryptography Conference, Proceedings TCC 2009, March 15\u201317, 2009, San Francisco, CA, USA (2009), pp. 274\u2013293"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9176-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-013-9176-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9176-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9176-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T05:04:34Z","timestamp":1688879074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-013-9176-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,19]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9176"],"URL":"https:\/\/doi.org\/10.1007\/s00145-013-9176-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,19]]},"assertion":[{"value":"23 April 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2013","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}