{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,30]],"date-time":"2026-10-30T18:33:19Z","timestamp":1793385199292,"version":"4.5.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385568","type":"print"},{"value":"9783031385575","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-38557-5_20","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:03:06Z","timestamp":1691521386000},"page":"613-645","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["Secure Multiparty Computation from Threshold Encryption Based on\u00a0Class Groups"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9164-305X","authenticated-orcid":false,"given":"Lennart","family":"Braun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4992-0249","authenticated-orcid":false,"given":"Claudio","family":"Orlandi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Abe, M., Fehr, S.: Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 317\u2013334. Springer, Heidelberg (August 2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_20","DOI":"10.1007\/978-3-540-28628-8_20"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Abram, D., Damg\u00e5rd, I., Orlandi, C., Scholl, P.: An algebraic framework for silent preprocessing with trustless setup and active security. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part IV. LNCS, vol. 13510, pp. 421\u2013452. Springer, Heidelberg (August 2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_15","DOI":"10.1007\/978-3-031-15985-5_15"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Arun, A., Ganesh, C., Lokam, S.V., Mopuri, T., Sridhar, S.: Dew: a transparent constant-sized polynomial commitment scheme. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part II. LNCS, vol. 13941, pp. 542\u2013571. Springer, Heidelberg (May 2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_19","DOI":"10.1007\/978-3-031-31371-4_19"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Baum, C., Cozzo, D., Smart, N.P.: Using TopGear in overdrive: a more efficient ZKPoK for SPDZ. In: Paterson, K.G., Stebila, D. (eds.) SAC 2019. LNCS, vol. 11959, pp. 274\u2013302. Springer, Heidelberg (August 2019). https:\/\/doi.org\/10.1007\/978-3-030-38471-5_12","DOI":"10.1007\/978-3-030-38471-5_12"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO\u201991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (August 1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34","DOI":"10.1007\/3-540-46766-1_34"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169\u2013188. Springer, Heidelberg (May 2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., et al.: Can a public blockchain keep a secret? In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 260\u2013290. Springer, Heidelberg (November 2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_10","DOI":"10.1007\/978-3-030-64375-1_10"},{"key":"20_CR8","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: A survey of two verifiable delay functions. Cryptology ePrint Archive, Report 2018\/712 (2018), https:\/\/eprint.iacr.org\/2018\/712"},{"key":"20_CR9","unstructured":"Braun, L., Damg\u00e5rd, I., Orlandi, C.: Secure multiparty computation from threshold encryption based on class groups. Cryptology ePrint Archive, Report 2022\/1437 (2022). https:\/\/eprint.iacr.org\/2022\/1437"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Two-party ECDSA from hash proof systems and efficient instantiations. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 191\u2013221. Springer, Heidelberg (August 2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_7","DOI":"10.1007\/978-3-030-26954-8_7"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Bandwidth-efficient threshold EC-DSA. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020, Part II. LNCS, vol. 12111, pp. 266\u2013296. Springer, Heidelberg (May 2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_10","DOI":"10.1007\/978-3-030-45388-6_10"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F.: Linearly homomorphic encryption from $$\\sf DDH$$. In: Nyberg, K. (ed.) CT-RSA\u00a02015. LNCS, vol.\u00a09048, pp. 487\u2013505. Springer, Heidelberg (April 2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_26","DOI":"10.1007\/978-3-319-16715-2_26"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F., Tucker, I.: Practical fully secure unrestricted inner product functional encryption modulo p. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part II. LNCS, vol. 11273, pp. 733\u2013764. Springer, Heidelberg (December 2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_25","DOI":"10.1007\/978-3-030-03329-3_25"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F., Tucker, I.: Threshold linearly homomorphic encryption on $$\\textbf{Z} \/2^{k}\\textbf{Z} $$. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part II. LNCS, vol. 13792, pp. 99\u2013129. Springer, Heidelberg (December 2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_4","DOI":"10.1007\/978-3-031-22966-4_4"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Cohen, H., Lenstra, H.W.: Heuristics on class groups of number fields. In: Number Theory Noordwijkerhout 1983 (1984)","DOI":"10.1007\/BFb0099440"},{"key":"20_CR16","unstructured":"Cramer, R.: Modular design of secure yet practical cryptographic protocols. Ph.D. thesis, Universiteit van Amsterdam (1997)"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280\u2013299. Springer, Heidelberg (May 2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_18","DOI":"10.1007\/3-540-44987-6_18"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174\u2013187. Springer, Heidelberg (August 1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_19","DOI":"10.1007\/3-540-48658-5_19"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Cramer, R., Fehr, S.: Optimal black-box secret sharing over arbitrary Abelian groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 272\u2013287. Springer, Heidelberg (August 2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_18","DOI":"10.1007\/3-540-45708-9_18"},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 247\u2013264. Springer, Heidelberg (August 2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_15","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (August 2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Linear integer secret sharing and distributed exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 75\u201390. Springer, Heidelberg (April 2006). https:\/\/doi.org\/10.1007\/11745853_6","DOI":"10.1007\/11745853_6"},{"key":"20_CR23","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures (extended abstract). In: Feigenbaum, J. (ed.) CRYPTO\u201991. LNCS, vol. 576, pp. 457\u2013469. Springer, Heidelberg (August 1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_37","DOI":"10.1007\/3-540-46766-1_37"},{"key":"20_CR24","unstructured":"Erwig, A., Faust, S., Riahi, S.: Large-scale non-interactive threshold cryptosystems through anonymity. Cryptology ePrint Archive, Report 2021\/1290 (2021), https:\/\/eprint.iacr.org\/2021\/1290"},{"key":"20_CR25","doi-asserted-by":"publisher","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th FOCS. pp. 427\u2013437. IEEE Computer Society Press (October 1987). https:\/\/doi.org\/10.1109\/SFCS.1987.4","DOI":"10.1109\/SFCS.1987.4"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 152\u2013168. Springer, Heidelberg (August 2005). https:\/\/doi.org\/10.1007\/11535218_10","DOI":"10.1007\/11535218_10"},{"key":"20_CR27","doi-asserted-by":"publisher","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal resilience proactive public-key cryptosystems. In: 38th FOCS. pp. 384\u2013393. IEEE Computer Society Press (October 1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646127","DOI":"10.1109\/SFCS.1997.646127"},{"issue":"1","key":"20_CR28","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2006","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20(1), 51\u201383 (2006). https:\/\/doi.org\/10.1007\/s00145-006-0347-3","journal-title":"J. Cryptol."},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Gentry, C., et al.: YOSO: You only speak once - secure MPC with stateless ephemeral roles. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 64\u201393. Springer, Heidelberg, Virtual Event (August 2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_3","DOI":"10.1007\/978-3-030-84245-1_3"},{"key":"20_CR30","unstructured":"Gordon, S.D., Le, P.H., McVicker, D.: Linear communication in malicious majority MPC. Cryptology ePrint Archive, Report 2022\/781 (2022), https:\/\/eprint.iacr.org\/2022\/781"},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Keller, M., Pastro, V., Rotaru, D.: Overdrive: making SPDZ great again. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part III. LNCS, vol. 10822, pp. 158\u2013189. Springer, Heidelberg (April\/May 2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_6","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"20_CR32","unstructured":"Kolby, S., Ravi, D., Yakoubov, S.: Towards efficient YOSO MPC without setup. Cryptology ePrint Archive, Report 2022\/187 (2022), https:\/\/eprint.iacr.org\/2022\/187"},{"key":"20_CR33","doi-asserted-by":"publisher","unstructured":"Okamoto, T., Pointcheval, D.: The gap-problems: A new class of problems for the security of cryptographic schemes. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 104\u2013118. Springer, Heidelberg (February 2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_8","DOI":"10.1007\/3-540-44586-2_8"},{"key":"20_CR34","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT\u201999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (May 1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"20_CR35","doi-asserted-by":"publisher","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Blum, A. (ed.) ITCS 2019. vol. 124, pp. 60:1\u201360:15. LIPIcs (Jan 2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.60","DOI":"10.4230\/LIPIcs.ITCS.2019.60"},{"key":"20_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"T Rabin","year":"1998","unstructured":"Rabin, T.: A simplified approach to threshold and proactive RSA. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 89\u2013104. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055722"},{"key":"20_CR37","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979)","DOI":"10.1145\/359168.359176"},{"key":"20_CR38","unstructured":"Tucker, I.: Chiffrement fonctionnel et signatures distribu\u00e9es fond\u00e9s sur des fonctions de hachage \u00e0 projection, l\u2019apport des groupes de classes. Ph.D. thesis, \u00c9cole normale sup\u00e9rieure de Lyon (2020)"},{"key":"20_CR39","doi-asserted-by":"publisher","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 379\u2013407. Springer, Heidelberg (May 2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13","DOI":"10.1007\/978-3-030-17659-4_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38557-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:02:20Z","timestamp":1753567340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38557-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385568","9783031385575"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38557-5_20","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":"9 August 2023","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.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":"479","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":"124","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":"15","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)"}}]}}