{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:43:25Z","timestamp":1779936205097,"version":"3.53.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306167","type":"print"},{"value":"9783031306174","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30617-4_8","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T10:02:24Z","timestamp":1681466544000},"page":"220-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["SuperPack: Dishonest Majority MPC with\u00a0Constant Online Communication"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Escudero","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vipul","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antigoni","family":"Polychroniadou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yifan","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chenkai","family":"Weng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization, pp. 420\u2013432 (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34","DOI":"10.1007\/3-540-46766-1_34"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Beck, G., Goel, A., Jain, A., Kaptchuk, G.: Order-C secure multiparty computation for highly repetitive circuits, pp. 663\u2013693 (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_23","DOI":"10.1007\/978-3-030-77886-6_23"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Efraim, A., Nielsen, M., Omri, E.: Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing, pp. 530\u2013549 (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_26","DOI":"10.1007\/978-3-030-21568-2_26"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), pp. 1\u201310 (1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation, pp. 169\u2013188 (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"8_CR6","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, pp. 67\u201397 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Efficient fully secure computation via distributed zero-knowledge proofs, pp. 244\u2013276 (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_9","DOI":"10.1007\/978-3-030-64840-4_9"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols, pp. 136\u2013145 (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Chida, K., et al.: Fast large-scale honest-majority MPC for malicious adversaries, pp. 34\u201364 (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_2","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Couteau, G.: A note on the communication complexity of multiparty computation in the correlated randomness model, pp. 473\u2013503 (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_17","DOI":"10.1007\/978-3-030-17656-3_17"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography, pp. 445\u2013465 (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority - or: Breaking the SPDZ limits, pp. 1\u201318 (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation, pp. 572\u2013590 (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption, pp. 643\u2013662 (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Escudero, D., Goyal, V., Polychroniadou, A., Song, Y.: TurboPack: honest majority MPC with constant online communication, pp. 951\u2013964 (2022). https:\/\/doi.org\/10.1145\/3548606.3560633","DOI":"10.1145\/3548606.3560633"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract), pp. 699\u2013710 (1992). https:\/\/doi.org\/10.1145\/129712.129780","DOI":"10.1145\/129712.129780"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Genkin, D., Ishai, Y., Polychroniadou, A.: Efficient multi-party computation: from passive to active security via secure SIMD circuits, pp. 721\u2013741 (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_35","DOI":"10.1007\/978-3-662-48000-7_35"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Genkin, D., Ishai, Y., Prabhakaran, M.M., Sahai, A., Tromer, E.: Circuits resilient to additive attacks with applications to secure computation. In: Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing, pp. 495\u2013504. STOC 2014, ACM, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2591796.2591861","DOI":"10.1145\/2591796.2591861"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00145-005-0319-z","volume":"18","author":"S Goldwasser","year":"2005","unstructured":"Goldwasser, S., Lindell, Y.: Secure multi-party computation without agreement. J. Cryptol. 18(3), 247\u2013287 (2005). https:\/\/doi.org\/10.1007\/s00145-005-0319-z","journal-title":"J. Cryptol."},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Goyal, V., Li, H., Ostrovsky, R., Polychroniadou, A., Song, Y.: ATLAS: efficient and scalable MPC in the honest majority setting, pp. 244\u2013274 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_9","DOI":"10.1007\/978-3-030-84245-1_9"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Goyal, V., Polychroniadou, A., Song, Y.: Unconditional communication-efficient MPC via hall\u2019s marriage theorem, pp. 275\u2013304 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_10","DOI":"10.1007\/978-3-030-84245-1_10"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Goyal, V., Polychroniadou, A., Song, Y.: Sharing transformation and dishonest majority MPC with packed secret sharing, pp. 3\u201332 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_1","DOI":"10.1007\/978-3-031-15985-5_1"},{"key":"8_CR23","unstructured":"Goyal, V., Song, Y.: Malicious security comes free in honest-majority MPC. Cryptology ePrint Archive, Report 2020\/134 (2020). https:\/\/eprint.iacr.org\/2020\/134"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Nof, A.: A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority, pp. 259\u2013276 (2017). https:\/\/doi.org\/10.1145\/3133956.3133999","DOI":"10.1145\/3133956.3133999"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Rachuri, R., Scholl, P.: Le mans: Dynamic and fluid MPC for dishonest majority, pp. 719\u2013749 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_25","DOI":"10.1007\/978-3-031-15802-5_25"},{"key":"8_CR26","doi-asserted-by":"publisher","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","DOI":"10.1145\/359168.359176"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30617-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:00Z","timestamp":1744754580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30617-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306167","9783031306174"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30617-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","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":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","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":"109","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":"26% - 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":"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)"}}]}}