{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T09:29:01Z","timestamp":1786440541016,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354174","type":"print"},{"value":"9783032354181","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-35418-1_15","type":"book-chapter","created":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:34:22Z","timestamp":1786437262000},"page":"462-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dishonest-Majority Secure Computation via\u00a0PIR-Authenticated Multiplication Triples"],"prefix":"10.1007","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matan","family":"Hamilis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariel","family":"Nof","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,12]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Abram, D., Scholl, P.: Low-communication multiparty triple generation for SPDZ from Ring-LPN, p. PKC. (2022)","DOI":"10.1007\/978-3-030-97121-2_9"},{"key":"15_CR2","unstructured":"Agarwal, A., Raghuraman, S., Rindal, P.: Fully distributed multi-point functions for PCGs and beyond. Cryptology ePrint Archive. (). Paper 2025\/2294 (2025)"},{"key":"15_CR3","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization, p. CRYPTO. (1991)"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00145-004-0134-y","volume":"17","author":"A Beimel","year":"2004","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the Servers\u2019 Computation in PrivateInformation Retrieval: PIR with Preprocessing. J. Cryptol. 17(2), 125\u2013151 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0134-y","journal-title":"J. Cryptol."},{"key":"15_CR5","volume-title":"CRYPTO 2000, LNCS","year":"2000","unstructured":"Bellare, M. (ed.): CRYPTO 2000, LNCS, vol. 1880. Springer, Berlin, Heidelberg (Aug (2000)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation, EUROCRYPT (2011)","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"15_CR7","unstructured":"Bernstein, D.J.: The transposition principle. https:\/\/cr.yp.to\/transposition.html (2024), accessed: 2024-10-03"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Block, A.R., Maji, H.K., Nguyen, H.H.: Secure computation with constant communication overhead using multiplication embeddings, p. INDOCRYPT. (2018)","DOI":"10.1007\/978-3-030-05378-9_20"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. Journal of the ACM (JACM) 50(4), 506\u2013519 (2003)","journal-title":"Journal of the ACM (JACM)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Bombar, M., Bui, D., Couteau, G., Couvreur, A., Ducros, C., Servan-Schreiber, S.: FOLEAGE: $$_4$$ OLE-based multi-party computation for boolean circuits. ASIACRYPT. pp, 69\u2013101 (2024)","DOI":"10.1007\/978-981-96-0938-3_3"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Bombar, M., Couteau, G., Couvreur, A., Ducros, C.: Correlated pseudorandomness from the hardness of quasi-abelian decoding, CRYPTO (2023)","DOI":"10.1007\/978-3-031-38551-3_18"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs, CRYPTO (2019)","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Bouillaguet, C., Delaplace, C., Hamdad, M., Vergnaud, D.: Practical cryptanalysis of pseudorandom correlation generators based on quasi-abelian syndrome decoding. Cryptology ePrint Archive, (2025)","DOI":"10.1007\/978-981-95-5113-2_14"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: ACM CCS, (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"15_CR15","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, CRYPTO (2019)","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators from Ring-LPN, CRYPTO (2020)","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Hamilis, M., Ishai, Y., Tu, Y.: Improved constructions for distributed multi-point functions. In: IEEE S&P. pp. 2414\u20132432 (2025)","DOI":"10.1109\/SP61157.2025.00044"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing, pp. 337\u2013367. EUROCRYPT (2015)","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: Improvements and extensions. In: ACM CCS, (2016)","DOI":"10.1145\/2976749.2978429"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Secure computation with preprocessing via function secret sharing, p. TCC. (2019)","DOI":"10.1007\/978-3-030-36030-6_14"},{"key":"15_CR21","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, ACM CCS (2019)","DOI":"10.1145\/3319535.3363227"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Efficient fully secure computation via distributed zero-knowledge proofs, ASIACRYPT (2020)","DOI":"10.1007\/978-3-030-64840-4_9"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Sublinear gmw-style compiler for MPC with preprocessing, CRYPTO (2021)","DOI":"10.1007\/978-3-030-84245-1_16"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Secure multiparty computation with sublinear preprocessing, EUROCRYPT (2022)","DOI":"10.1007\/978-3-031-06944-4_15"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Briaud, P., \u00d8ygarden, M.: A new algebraic approach to the regular syndrome decoding problem and implications for pcg constructions. In: EUROCRYPT. pp, pp. 391\u2013422. (2023)","DOI":"10.1007\/978-3-031-30589-4_14"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Burra, S.S., Larraia, E., Nielsen, J.B., Nordholt, P.S., Orlandi, C., Orsini, E., Scholl, P., Smart, N.P.: High-performance multi-party computation for binary circuits based on oblivious transfer. J. Cryptol., (2021)","DOI":"10.1007\/s00145-021-09403-1"},{"key":"15_CR27","unstructured":"Catalano, D., Raimondo, M.D., Fiore, D., Giacomelli, I.: Monz2ka: Fast maliciously secure two party computation on z2k. IACR Cryptology ePrint Archive, (2019)"},{"issue":"6","key":"15_CR28","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965\u2013981 (1998)","journal-title":"J. ACM"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Kogan, D.: Private information retrieval with sublinear online time, EUROCRYPT (2020)","DOI":"10.1007\/978-3-030-45721-1_3"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: Silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, CRYPTO (2021)","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"15_CR31","unstructured":"Cramer, R., Damg\u00e5rd, I., Escudero, D., Scholl, P., Xing, C.: Spdz2k: Efficient MPC mod 2k for dishonest majority, CRYPTO (2018)"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Dalskov, A.P.K., Escudero, D., Nof, A.: Fully secure MPC and zk-fliop over rings: New constructions, improvements and extensions, CRYPTO (2024)","DOI":"10.1007\/978-3-031-68397-8_5"},{"key":"15_CR33","doi-asserted-by":"crossref","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, p. ESORICS. (2013)","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Nielsen, M., Ranellucci, S.: The tinytable protocol for 2-party secure computation, or: Gate-scrambling revisited. In: CRYPTO (2017)","DOI":"10.1007\/978-3-319-63688-7_6"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption, CRYPTO (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Zakarias, S.: Constant-overhead secure computation of boolean circuits using preprocessing, p. TCC. (2013)","DOI":"10.1007\/978-3-642-36594-2_35"},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"Frederiksen, T.K., Keller, M., Orsini, E., Scholl, P.: A unified approach to MPC with preprocessing using OT, ASIACRYPT (2015)","DOI":"10.1007\/978-3-662-48797-6_29"},{"key":"15_CR38","doi-asserted-by":"crossref","unstructured":"Genkin, D., Ishai, Y., Prabhakaran, M., Sahai, A., Tromer, E.: Circuits resilient to additive attacks with applications to secure computation, p. STOC. (2014)","DOI":"10.1145\/2591796.2591861"},{"key":"15_CR39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography -","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography -, vol. 2. Cambridge University Press, Basic Applications (2004)"},{"key":"15_CR40","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, p. STOC. (1987)","DOI":"10.1145\/28395.28420"},{"key":"15_CR41","unstructured":"Hamilis, M., Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Preprocessing for Life: Dishonest-Majority MPC with a Trusted or Untrusted Dealer . In: IEEE S&P. pp. 41\u201341 (May 2025)"},{"key":"15_CR42","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the power of correlated randomness in secure computation, p. TCC. (2013)","DOI":"10.1007\/978-3-642-36594-2_34"},{"key":"15_CR43","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications, p. STOC. (2004)","DOI":"10.1145\/1007352.1007396"},{"key":"15_CR44","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: ACM CCS, (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"15_CR45","doi-asserted-by":"crossref","unstructured":"Keller, M., Pastro, V., Rotaru, D.: Overdrive: Making SPDZ great again, EUROCRYPT (2018)","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"15_CR46","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Peceny, S., Raghuraman, S., Rindal, P.: Stationary syndrome decoding for improved PCGs. Cryptology ePrint Archive. Paper 2025\/295 (2025)","DOI":"10.1007\/978-3-032-01855-7_10"},{"key":"15_CR47","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: FOCS. pp, pp. 364\u2013373. (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"15_CR48","doi-asserted-by":"crossref","unstructured":"Li, Z., Xing, C., Yao, Y., Yuan, C.: Efficient pseudorandom correlation generators for any finite field. In: EUROCRYPT, pp. 145\u2013175. (2025)","DOI":"10.1007\/978-3-031-91092-0_6"},{"key":"15_CR49","doi-asserted-by":"crossref","unstructured":"Li, Z., Xing, C., Yao, Y., Yuan, C.: On the power of sumcheck in secure multiparty computation, p. PKC. (2026)","DOI":"10.1007\/978-3-032-26734-4_9"},{"key":"15_CR50","doi-asserted-by":"crossref","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation, CRYPTO (2012)","DOI":"10.1007\/978-3-642-32009-5_40"},{"issue":"5","key":"15_CR51","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Transactions on Information Theory 8(5), 5\u20139 (1962)","journal-title":"IRE Transactions on Information Theory"},{"key":"15_CR52","doi-asserted-by":"crossref","unstructured":"Rachuri, R., Scholl, P.: Le mans: Dynamic and fluid MPC for dishonest majority, CRYPTO (2022)","DOI":"10.1007\/978-3-031-15802-5_25"},{"key":"15_CR53","unstructured":"Stern, J.: A method for finding codewords of small weight, Springer (1988)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35418-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:34:49Z","timestamp":1786437289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35418-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354174","9783032354181"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35418-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}