{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:44:25Z","timestamp":1780069465587,"version":"3.54.0"},"publisher-location":"Singapore","reference-count":41,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608904","type":"print"},{"value":"9789819608911","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0891-1_5","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:37:15Z","timestamp":1733956635000},"page":"141-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tiresias: Large Scale, UC-Secure Threshold Paillier"],"prefix":"10.1007","author":[{"given":"Offir","family":"Friedman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avichai","family":"Marmor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dolev","family":"Mutzari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yehonatan C.","family":"Scaly","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Spiizer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avishay","family":"Yanai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Joy Algesheimer, Jan Camenisch, and Victor Shoup. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In Advances in Cryptology-CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18-22, 2002 Proceedings 22, pages 417\u2013432. Springer, 2002.","DOI":"10.1007\/3-540-45708-9_27"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Thomas Attema, Serge Fehr, and Michael Kloo\u00df. Fiat-shamir transformation of multi-round interactive proofs. In Theory of Cryptography: 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part I, pages 113\u2013142. Springer, 2022.","DOI":"10.1007\/978-3-031-22318-1_5"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Thomas Attema, Serge Fehr, and Michael Kloo\u00df. Fiat-shamir transformation of multi-round interactive proofs. In Theory of Cryptography: 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part I, pages 113\u2013142. Springer, 2022.","DOI":"10.1007\/978-3-031-22318-1_5"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Dan Boneh, Joseph Bonneau, Benedikt B\u00fcnz, and Ben Fisch. Verifiable delay functions. In Advances in Cryptology\u2013CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part I, pages 757\u2013788. Springer, 2018.","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Jakob Burkhardt, Ivan Damg\u00e5rd, Tore\u00a0Kasper Frederiksen, Satrajit Ghosh, and Claudio Orlandi. Improved Distributed RSA Key Generation Using the Miller-Rabin Test. Cryptology ePrint Archive, 2023.","DOI":"10.1145\/3576915.3623163"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Lennart Braun, Ivan Damg\u00e5rd, and Claudio Orlandi. Secure multiparty computation from threshold encryption based on class groups. In Annual International Cryptology Conference, pages 613\u2013645. Springer, 2023.","DOI":"10.1007\/978-3-031-38557-5_20"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Carsten Baum, Ivan Damg\u00e5rd, Tomas Toft, and Rasmus Zakarias. Better preprocessing for secure multiparty computation. In Applied Cryptography and Network Security: 14th International Conference, ACNS 2016, Guildford, UK, June 19-22, 2016. Proceedings 14, pages 327\u2013345. Springer, 2016.","DOI":"10.1007\/978-3-319-39555-5_18"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Matthew Franklin. Efficient generation of shared RSA keys. In Advances in Cryptology-CRYPTO 97: 17th Annual International Cryptology Conference Santa Barbara, California, USA August 17-21, 1997 Proceedings 17, pages 425\u2013439. Springer, 1997.","DOI":"10.1007\/BFb0052253"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Matthew Franklin. Efficient generation of shared RSA keys. In Advances in Cryptology-CRYPTO 97: 17th Annual International Cryptology Conference Santa Barbara, California, USA August 17-21, 1997 Proceedings 17, pages 425\u2013439. Springer, 1997.","DOI":"10.1007\/BFb0052253"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Mihir Bellare, Juan\u00a0A Garay, and Tal Rabin. Fast batch verification for modular exponentiation and digital signatures. In Advances in Cryptology-EUROCRYPT98: International Conference on the Theory and Application of Cryptographic Techniques Espoo, Finland, May 31-June 4, 1998 Proceedings 17, pages 236\u2013250. Springer, 1998.","DOI":"10.1007\/BFb0054130"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Omar Rafik\u00a0Merad Boudia and Sidi\u00a0Mohammed Senouci. An Efficient and Secure Multidimensional Data Aggregation for Fog-Computing-Based Smart Grid. IEEE Internet Things J., 2021.","DOI":"10.1109\/JIOT.2020.3040982"},{"key":"5_CR12","unstructured":"Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy\u00a0N Rothblum, and Ron\u00a0D Rothblum. Fiat-Shamir from simpler assumptions. Cryptology ePrint Archive, 2018."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthu Venkitasubramaniam, and Ruihan Wang. Diogenes: Lightweight scalable RSA modulus generation with a dishonest majority. In 2021 IEEE Symposium on Security and Privacy (SP), pages 590\u2013607. IEEE, 2021.","DOI":"10.1109\/SP40001.2021.00025"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Jan Camenisch, Aggelos Kiayias, and Moti Yung. On the Portability of Generalized Schnorr Proofs. In EUROCRYPT, volume 5479, pages 425\u2013442. Springer, 2009.","DOI":"10.1007\/978-3-642-01001-9_25"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Cyprien Delpech\u00a0de Saint\u00a0Guilhem, Eleftheria Makri, Dragos Rotaru, and Titouan Tanguy. The return of eratosthenes: Secure generation of rsa moduli using distributed sieving. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pages 594\u2013609, 2021.","DOI":"10.1145\/3460120.3484754"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd, Mads Jurik, and Jesper\u00a0Buus Nielsen. A generalization of Paillier\u2019s public-key system with applications to electronic voting. International Journal of Information Security, 9:371\u2013385, 2010.","DOI":"10.1007\/s10207-010-0119-9"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Maciej Koprowski. Practical threshold RSA signatures without a trusted dealer. In Advances in Cryptology-EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings 20, pages 152\u2013165. Springer, 2001.","DOI":"10.1007\/3-540-44987-6_10"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Jesper\u00a0Buus Nielsen. Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In CRYPTO, volume 2729 of Lecture Notes in Computer Science, pages 247\u2013264. Springer, 2003.","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd, Valerio Pastro, Nigel\u00a0P. Smart, and Sarah Zakarias. Multiparty Computation from Somewhat Homomorphic Encryption. In CRYPTO, volume 7417, pages 643\u2013662. Springer, 2012.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"5_CR20","unstructured":"Offir Friedman, Avichai Marmor, Dolev Mutzari, Yehonatan\u00a0C Scaly, Yuval Spiizer, and Avishay Yanai. Tiresias: Large scale, maliciously secure threshold paillier. Cryptology ePrint Archive, 2023."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Pierre-Alain Fouque, Guillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Financial Cryptography: 4th International Conference, FC 2000 Anguilla, British West Indies, February 20-24, 2000 Proceedings 4, pages 90\u2013104. Springer, 2001.","DOI":"10.1007\/3-540-45472-1_7"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology-CRYPTO86: Proceedings 6, pages 186\u2013194. Springer, 1987.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Pierre-Alain Fouque and Jacques Stern. Fully distributed threshold RSA under standard assumptions. In Advances in Cryptology-ASIACRYPT 2001: 7th International Conference on the Theory and Application of Cryptology and Information Security Gold Coast, Australia, December 9-13, 2001 Proceedings 7, pages 310\u2013330. Springer, 2001.","DOI":"10.1007\/3-540-45682-1_19"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro, Steven Goldfeder, and Arvind Narayanan. Threshold-optimal DSA\/ECDSA signatures and an application to bitcoin wallet security. In Applied Cryptography and Network Security: 14th International Conference, ACNS 2016, Guildford, UK, June 19-22, 2016. Proceedings 14, pages 156\u2013174. Springer, 2016.","DOI":"10.1007\/978-3-319-39555-5_9"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Oded Goldreich and Yair Oren. Definitions and properties of zero-knowledge proof systems. Journal of Cryptology, 7(1):1\u201332, 1994.","DOI":"10.1007\/BF00195207"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Godfrey\u00a0H Hardy and John\u00a0E Littlewood. Some problems of \u2018partitio numerorum\u2019; iii: On the expression of a number as a sum of primes. Acta Mathematica, 44(1):1\u201370, 1923.","DOI":"10.1007\/BF02403921"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Carmit Hazay, Gert\u00a0L\u00e6ss\u00f8e Mikkelsen, Tal Rabin, Tomas Toft, and Angelo\u00a0Agatino Nicolosi. Efficient RSA key generation and threshold paillier in the two-party setting. Journal of Cryptology, 32:265\u2013323, 2019.","DOI":"10.1007\/s00145-017-9275-7"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Jonathan Katz and Yehuda Lindell. Introduction to Modern Cryptography. CRC Press, 2nd edition, 2014.","DOI":"10.1201\/b17668"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Ralf K\u00fcsters, Julian Liedtke, Johannes M\u00fcller, Daniel Rausch, and Andreas Vogt. Ordinos: A Verifiable Tally-Hiding E-Voting System. In EuroS &P, 2020.","DOI":"10.1109\/EuroSP48549.2020.00022"},{"key":"5_CR30","unstructured":"Dimitris Mouris and Nektarios\u00a0Georgios Tsoutsos. Masquerade: Verifiable Multi-Party Aggregation with Secure Multiplicative Commitments. 2021."},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Hugh\u00a0L. Montgomery and Robert\u00a0C. Vaughan. Multiplicative Number Theory I: Classical Theory. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2006.","DOI":"10.1017\/CBO9780511618314"},{"key":"5_CR32","unstructured":"Takashi Nishide and Kouichi Sakurai. Distributed Paillier Cryptosystem without Trusted Dealer. In Information Security Applications - 11th International Workshop, WISA 2010, Jeju Island, Korea, August 24-26, 2010, Revised Selected Papers, volume 6513 of Lecture Notes in Computer Science, pages 44\u201360. Springer, 2010."},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology-EUROCRYPT 99: International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, May 2-6, 1999 Proceedings 18, pages 223\u2013238. Springer, 1999.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Nicholas Pippenger. On the evaluation of powers and monomials. SIAM Journal on Computing, 9(2):230\u2013250, 1980.","DOI":"10.1137\/0209022"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"John\u00a0M Pollard. Theorems on factorization and primality testing. In Mathematical Proceedings of the Cambridge Philosophical Society, volume\u00a076, pages 521\u2013528. Cambridge University Press, 1974.","DOI":"10.1017\/S0305004100049252"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Tal Rabin. A Simplified Approach to Threshold and Proactive RSA. In CRYPTO, volume 1462 of Lecture Notes in Computer Science, pages 89\u2013104. Springer, 1998.","DOI":"10.1007\/BFb0055722"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Ronald\u00a0L. Rivest, Adi Shamir, and Leonard\u00a0M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 1978.","DOI":"10.21236\/ADA606588"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Istv\u00e1n\u00a0Andr\u00e1s Seres and P\u00e9ter Burcsi. A note on low order assumptions in RSA groups. Rad Hrvatske akademije znanosti i umjetnosti. Matemati\u010dke znanosti, (546= 25):15\u201331, 2021.","DOI":"10.21857\/y54jofkjqm"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612\u2013613, 1979.","DOI":"10.1145\/359168.359176"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Victor Shoup. Practical threshold signatures. In Advances in Cryptology-EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14\u201318, 2000 Proceedings 19, pages 207\u2013220. Springer, 2000.","DOI":"10.1007\/3-540-45539-6_15"},{"key":"5_CR41","unstructured":"Thijs Veugen, Thomas Attema, and Gabriele Spini. An implementation of the Paillier crypto system with threshold decryption without a trusted dealer. ePrint, 2019."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0891-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:42:15Z","timestamp":1733956935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0891-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819608904","9789819608911"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0891-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","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":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}