{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:51:26Z","timestamp":1765961486213,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030904524"},{"type":"electronic","value":"9783030904531"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-90453-1_5","type":"book-chapter","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T14:14:32Z","timestamp":1636035272000},"page":"129-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation"],"prefix":"10.1007","author":[{"given":"Fabrice","family":"Benhamouda","sequence":"first","affiliation":[]},{"given":"Elette","family":"Boyle","sequence":"additional","affiliation":[]},{"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Ariel","family":"Nof","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"5_CR1","unstructured":"Covering Designs. www.dmgordon.org\/cover\/\/"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Merritt, M., Reingold, O., Taubenfeld, G., Wright, R.N.: Tight bounds for shared memory systems accessed by byzantine processes. Distrib. Comput. (2005)","DOI":"10.1007\/s00446-005-0125-8"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Badrinarayanan, S., Jain, A., Manohar, N., Sahai, A.: Secure MPC: laziness leads to GOD. In: ASIACRYPT (2020)","DOI":"10.1007\/978-3-030-64840-4_5"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Baron, J., El Defrawy, K., Lampkins, J., Ostrovsky, R.: How to withstand mobile virus attacks, revisited. In: ACM PODC (2014)","DOI":"10.1145\/2611462.2611474"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: ACM STOC (1988)","DOI":"10.1145\/62212.62213"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bendlin , R., Damg\u00e5rd, I.: Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems. In: TCC (2010)","DOI":"10.1007\/978-3-642-11799-2_13"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bonawitz, K.A., et al.: Practical secure aggregation for privacy-preserving machine learning. In: ACM CCS (2017)","DOI":"10.1145\/3133956.3133982"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 67\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Correlated pseudorandom functions from variable-density LPN. In: FOCS (2020)","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Practical fully secure three-party computation via sublinear distributed zero-knowledge proofs. In: ACM CCS (2019)","DOI":"10.1145\/3319535.3363227"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Efficient fully secure computation via distributed zero-knowledge proofs. In: ASIACRYPT (2020)","DOI":"10.1007\/978-3-030-64840-4_9"},{"key":"5_CR13","unstructured":"Brakerski, Z., Chandran, N., Goyal, V., Jain, A., Sahai, A., Segev, G.: Hierarchical functional encryption. In: ITCS (2017)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","DOI":"10.1007\/s001459910006"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldwasser, S.: An efficient Threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In: EUROCRYPT (1999)","DOI":"10.1007\/3-540-48910-X_7"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: ACM STOC (1988)","DOI":"10.1007\/3-540-48184-2_43"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Choudhuri, A. R., Goel, A., Green, M., Jain, A., Kaptchuk, G.: Fluid MPC: secure multiparty computation with dynamic participants. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84245-1_4"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: TCC (2005)","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: CRYPTO (2006)","DOI":"10.1007\/11818175_30"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: EUROCRYPT (2010)","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"5_CR21","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J.B., Smith, A.D.: Scalable multiparty computation with nearly optimal work and resilience. In: CRYPTO (2008)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Buus Nielsen, J.: Scalable and unconditionally secure multiparty computation. In: CRYPTO (2007)","DOI":"10.1007\/11818175_30"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Non-interactive proofs for integer multiplication. In: EUROCRYPT (2007)","DOI":"10.1007\/978-3-540-72540-4_24"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: ACM STOC (1992)","DOI":"10.1145\/129712.129780"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"F\u00fcredi, Z.: Tur\u00e1n type problems. surveys in combinatorics 166, 253\u2013300 (1991)","DOI":"10.1017\/CBO9780511666216.010"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Lindell, Y.: Two-thirds honest-majority MPC for malicious adversaries at almost the cost of semi-honest. In: ACM CCS (2019)","DOI":"10.1145\/3319535.3339811"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Beck, G., Goel, A., Jain, A., Kaptchuk, G.: Order-c secure multiparty computation for highly repetitive circuits. In: EUROCRYPT (2021)","DOI":"10.1007\/978-3-030-77886-6_23"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Gilboa, N., Ishai, Y.: Compressing cryptographic resources. In: CRYPTO (1999)","DOI":"10.1007\/3-540-48405-1_37"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The foundations of cryptography, vol. 2, Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"5_CR30","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: ACM STOC (1987)","DOI":"10.1145\/28395.28420"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Gordon, D., Ranellucci, S., Wang, X.: Secure computation with low communication from cross-checking. In: ASIACRYPT (2018)","DOI":"10.1007\/978-3-030-03332-3_3"},{"key":"5_CR32","unstructured":"Gordon, D.M., Stinson, D.R.: Coverings. In: Handbook of Combinatorial Designs, pp. 391\u2013398 (2006)"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Starin, D., Yerukhimovich, A.: The more the merrier: reducing the cost of large scale MPC. In: EUROCRYPT (2021)","DOI":"10.1007\/978-3-030-77886-6_24"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Goyal, V., Li, H., Ostrovsky, R., Polychroniadou, A., Song, Y.: ATLAS: efficient and scalable MPC in the honest majority setting. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84245-1_9"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Goyal, V., Liu, Y., Song, Y.: Communication-efficient unconditional MPC with guaranteed output delivery. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Goyal, V., Polychroniadou, A., Song, Y.: Unconditional communication-efficient MPC via hall\u2019s marriage theorem. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84245-1_10"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Goyal, V., Song, Y., Zhu, C.: Guaranteed output delivery comes free in honest majority MPC. In: CRYPTO (2020)","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Guo, Y., Pass, R., Shi, E.: Synchronous, with a chance of partition tolerance. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26948-7_18"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Wang, H., Pieprzyk, J.: Shared generation of pseudo-random functions with cumulative maps. In: CT-RSA (2003)","DOI":"10.1007\/3-540-36563-X_19"},{"key":"5_CR40","unstructured":"Hadzilacos, V.: Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing). PhD thesis (1985)"},{"key":"5_CR41","unstructured":"Hirt, M., Mularczyk, M.: Efficient MPC with a mixed adversary. In: Information-Theoretic Cryptography ITC (2020)"},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPDS.2008.16","volume":"19","author":"I Keidar","year":"2008","unstructured":"Keidar, I., Shraer, A.: How to choose a timing model. IEEE Trans. Parallel Distrib. Syst. 19, 1367\u20131380 (2008)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"Koo, C.Y.: Secure computation with partial message loss. In: TCC (2006)","DOI":"10.1007\/11681878_26"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Micali, S., Sidney, R.: A simple method for generating and sharing pseudo-random functions, with applications to clipper-like key escrow systems. In: CRYPTO (1995)","DOI":"10.1007\/3-540-44750-4_15"},{"key":"5_CR45","unstructured":"Raipin Parv\u00e9dy, P., Raynal, M.: Uniform agreement despite process omission failures. In: International Parallel and Distributed Processing Symposium (IPDPS) (2003)"},{"key":"5_CR46","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"KJ Perry","year":"1986","unstructured":"Perry, K.J., Toueg, S.: Distributed agreement in the presence of processor and communication faults. IEEE Trans. Softw. Eng. 12, 477\u2013482 (1986)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"5_CR47","unstructured":"Raynal, M.: Consensus in synchronous systems: a concise guided tour. In: Symposium on Dependable Computing (PRDC) (2002)"},{"key":"5_CR48","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. ACM, Commun. (1979)","DOI":"10.1145\/359168.359176"},{"key":"5_CR49","doi-asserted-by":"crossref","unstructured":"Sidorenko, A.: What we know and what we do not know about tur\u00e1n numbers. Graphs and Combinatorics 11(2), 179\u2013199 (1995)","DOI":"10.1007\/BF01929486"},{"key":"5_CR50","unstructured":"Tur\u00e1n, P.: On an external problem in graph theory. Mat. Fiz. Lapok 48, 436\u2013452 (1941)"},{"key":"5_CR51","doi-asserted-by":"publisher","unstructured":"Wills, J.M.: Research problems. periodica mathematica hungarica 14(2), 189\u2013191 (1983). https:\/\/doi.org\/10.1007\/BF01855430","DOI":"10.1007\/BF01855430"},{"key":"5_CR52","unstructured":"Chi-Chih Yao, A.: How to generate and exchange secrets (extended abstract). In: FOCS (1986)"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Zikas, V., Hauser, S., Maurer, U.: Realistic failures in secure multi-party computation. In: TCC (2009)","DOI":"10.1007\/978-3-642-00457-5_17"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90453-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T01:21:15Z","timestamp":1730683275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90453-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904524","9783030904531"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90453-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Raleigh, NC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","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":"66","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":"41% - 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":"4","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":"16","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)"}}]}}