{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:19Z","timestamp":1778065099060,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642315848","type":"print"},{"value":"9783642315855","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_41","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T07:56:29Z","timestamp":1340438189000},"page":"452-463","source":"Crossref","is-referenced-by-count":12,"title":["Edge Fault Tolerance on Sparse Networks"],"prefix":"10.1007","author":[{"given":"Nishanth","family":"Chandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Garay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988 (1988)","DOI":"10.1145\/62212.62213"},{"key":"41_CR2","unstructured":"Chandran, N., Garay, J., Ostrovsky, R.: Almost-everywhere secure computation with edge corruptions. Cryptology ePrint Archive, Report 2012\/221, \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-14162-1_21","volume-title":"Automata, Languages and Programming","author":"N. Chandran","year":"2010","unstructured":"Chandran, N., Garay, J., Ostrovsky, R.: Improved Fault Tolerance and Secure Computation on Sparse Networks. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol.\u00a06199, pp. 249\u2013260. Springer, Heidelberg (2010)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (abstract). In: STOC 1988 (1988)","DOI":"10.1145\/62212.62214"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree (preliminary version). In: STOC 1986 (1986)","DOI":"10.1145\/12130.12169"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.: Efficient player-optimal protocols for strong and differential consensus. In: PODC 2003 (2003)","DOI":"10.1145\/872035.872066"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-20901-7_8","volume-title":"Coding and Cryptology","author":"J. Garay","year":"2011","unstructured":"Garay, J., Givens, C., Ostrovsky, R.: Secure Message Transmission by Public Discussion: A Brief Survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol.\u00a06639, pp. 126\u2013141. Springer, Heidelberg (2011)"},{"key":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-78967-3_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J.A. Garay","year":"2008","unstructured":"Garay, J.A., Ostrovsky, R.: Almost-Everywhere Secure Computation. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 307\u2013323. Springer, Heidelberg (2008)"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: FOCS 2006 (2006)","DOI":"10.1109\/FOCS.2006.77"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04(3) (1982)","DOI":"10.1145\/357172.357176"},{"issue":"4","key":"41_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(94)90011-6","volume":"49","author":"G. Neiger","year":"1994","unstructured":"Neiger, G.: Distributed consensus revisited. Information Processing Letters\u00a049(4), 195\u2013201 (1994)","journal-title":"Information Processing Letters"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM (1980)","DOI":"10.1145\/322186.322188"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Upfal, E.: Tolerating linear number of faults in networks of bounded degree. In: PODC 1992 (1992)","DOI":"10.1145\/135419.135437"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:13:40Z","timestamp":1620116020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}