{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:31:47Z","timestamp":1794378707312,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141614","type":"print"},{"value":"9783642141621","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_21","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T05:26:21Z","timestamp":1278307581000},"page":"249-260","source":"Crossref","is-referenced-by-count":16,"title":["Improved Fault Tolerance and Secure Computation on Sparse Networks"],"prefix":"10.1007","author":[{"given":"Nishanth","family":"Chandran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan","family":"Garay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"6","key":"21_CR1","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s00224-006-1349-0","volume":"39","author":"A. Bagchi","year":"2006","unstructured":"Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., Scheideler, C.: The effect of faults on network expansion. Theory Comput. Syst.\u00a039(6), 903\u2013928 (2006)","journal-title":"Theory Comput. Syst."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC 1988, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0020-0190(96)00015-4","volume":"57","author":"M. Ben-Or","year":"1996","unstructured":"Ben-Or, M., Ron, D.: Agreement in the presence of faults, on networks of bounded degree. Information Processing Letters\u00a057, 329\u2013334 (1996)","journal-title":"Information Processing Letters"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BFb0035753","volume-title":"Automata, Languages and Programming","author":"P. Berman","year":"1989","unstructured":"Berman, P., Garay, J.: Asymptotically optimal distributed consensus (extended abstract). In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 80\u201394. Springer, Heidelberg (1989)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/3-540-54099-7_22","volume-title":"Distributed Algorithms","author":"P. Berman","year":"1991","unstructured":"Berman, P., Garay, J.: Fast consensus in networks of bounded degree (extended abstract). In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol.\u00a0486, pp. 321\u2013333. Springer, Heidelberg (1991)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An O(logn) expected rounds randomized Byzantine generals protocol. In: STOC 1985, pp. 316\u2013326 (1985)","DOI":"10.1145\/22145.22180"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Chandran, N., Garay, J., Ostrovsky, R.: Improved fault tolerance and secure computation on sparse networks. CoRR (2010), http:\/\/arxiv.org\/","DOI":"10.1007\/978-3-642-14162-1_21"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (abstract). In: STOC 1988, pp. 11\u201319 (1988)","DOI":"10.1007\/3-540-48184-2_43"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. In: PODC 1982, pp. 132\u2013140 (1982)","DOI":"10.1145\/800220.806690"},{"key":"21_CR10","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, pp. 370\u2013379 (1986)","DOI":"10.1145\/12130.12169"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-70936-7_17","volume-title":"Theory of Cryptography","author":"M. Fitzi","year":"2007","unstructured":"Fitzi, M., Franklin, M., Garay, J., Vardhan, S.: Towards optimal and efficient perfectly secure message transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 311\u2013322. Springer, Heidelberg (2007)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.: Efficient player-optimal protocols for strong and differential consensus. In: PODC 2003, pp. 211\u2013220 (2003)","DOI":"10.1145\/872035.872066"},{"key":"21_CR13","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. Garay","year":"2008","unstructured":"Garay, J., Ostrovsky, R.: Almost-everywhere secure computation. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 307\u2013323. Springer, Heidelberg (2008)"},{"key":"21_CR14","unstructured":"Guruswami, V., Lee, J., Razborov, A.: Almost euclidean subspaces of $\\ell_1^{N}$ via expander codes. In: SODA 2008, pp. 353\u2013362 (2008)"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"Journal of Cryptology"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-642-04355-0_47","volume-title":"Distributed Computing","author":"V. King","year":"2009","unstructured":"King, V., Saia, J.: From almost everywhere to everywhere: Byzantine agreement with \u00d5(n $^{\\mbox{3\/2}}$ ) bits. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 464\u2013478. Springer, Heidelberg (2009)"},{"key":"21_CR17","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, pp. 87\u201398 (2006)","DOI":"10.1109\/FOCS.2006.77"},{"issue":"3","key":"21_CR18","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4","key":"21_CR19","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":"21_CR20","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rajagopalan, S., Vazirani, U.: Simple and efficient leader election in the full information model. In: STOC 1994, pp. 234\u2013242 (1994)","DOI":"10.1145\/195058.195141"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM\u00a027, 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Upfal, E.: Tolerating linear number of faults in networks of bounded degree. In: PODC 1992, pp. 83\u201389 (1992)","DOI":"10.1145\/135419.135437"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Randomness-optimal sampling, extractors, and constructive leader election. In: STOC 1996, pp. 286\u2013295 (1996)","DOI":"10.1145\/237814.237878"}],"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-14162-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:48:07Z","timestamp":1606168087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_21","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}