{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T12:49:52Z","timestamp":1777898992133,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030457235","type":"print"},{"value":"9783030457242","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45724-2_6","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T04:17:18Z","timestamp":1588306638000},"page":"159-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Constructions for Almost-Everywhere Secure Computation"],"prefix":"10.1007","author":[{"given":"Siddhartha","family":"Jayanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Raghuraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikhil","family":"Vyas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,1]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/11535218_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"B Barak","year":"2005","unstructured":"Barak, B., Canetti, R., Lindell, Y., Pass, R., Rabin, T.: Secure computation without authentication. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 361\u2013377. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_22"},{"key":"6_CR2","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2\u20134 May 1988, pp. 1\u201310 (1988)"},{"issue":"6","key":"6_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. Inf. Process. Lett. 57(6), 329\u2013334 (1996)","journal-title":"Inf. Process. Lett."},{"key":"6_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.A.: Asymptotically optimal distributed consensus. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 80\u201394. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035753"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.A.: Fast consensus in networks of bounded degree. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol. 486, pp. 321\u2013333. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54099-7_22"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1165555.1165570","volume":"37","author":"R Canetti","year":"2006","unstructured":"Canetti, R.: Security and composition of cryptographic protocols: a tutorial (part I). SIGACT News 37(3), 67\u201392 (2006)","journal-title":"SIGACT News"},{"key":"6_CR7","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. 6199, pp. 249\u2013260. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_21"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-642-31585-5_41","volume-title":"Automata, Languages, and Programming","author":"N Chandran","year":"2012","unstructured":"Chandran, N., Garay, J., Ostrovsky, R.: Edge fault tolerance on sparse networks. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 452\u2013463. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_41"},{"key":"6_CR9","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2\u20134 May 1988, pp. 11\u201319 (1988)"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0019-9958(82)90776-8","volume":"52","author":"D Dolev","year":"1982","unstructured":"Dolev, D., Fischer, M.J., Fowler, R.J., Lynch, N.A., Strong, H.R.: An efficient algorithm for byzantine agreement without authentication. Inf. Control 52(3), 257\u2013274 (1982)","journal-title":"Inf. Control"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for Byzantine agreement. In: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, Canada, 18\u201320 August 1982, pp. 132\u2013140 (1982)","DOI":"10.1145\/800220.806690"},{"key":"6_CR12","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree (preliminary version). In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, California, USA, 28\u201330 May 1986, pp. 370\u2013379 (1986)"},{"key":"6_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":"JA Garay","year":"2008","unstructured":"Garay, J.A., Ostrovsky, R.: Almost-everywhere secure computation. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 307\u2013323. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_18"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: 1987 Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, New York, USA, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"6_CR15","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 $$\\tilde{O}(n^{3\/2})$$ bits. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 464\u2013478. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04355-0_47"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, 22\u201326 January 2006, pp. 990\u2013999 (2006)","DOI":"10.1145\/1109557.1109667"},{"key":"6_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: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), Berkeley, California, USA, 21\u201324 October 2006, pp. 87\u201398 (2006)","DOI":"10.1109\/FOCS.2006.77"},{"issue":"3","key":"6_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.E., Pease, M.C.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR19","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Explicit expanders and the Ramanujan conjectures. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, California, USA, 28\u201330 May 1986, pp. 240\u2013246 (1986)"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Upfal, E.: Tolerating linear number of faults in networks of bounded degree. In: Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, 10\u201312 August 1992, pp. 83\u201389 (1992)","DOI":"10.1145\/135419.135437"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3\u20135 November 1982, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45724-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:09:21Z","timestamp":1682899761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45724-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457235","9783030457242"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45724-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IACR websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}