{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:18:30Z","timestamp":1758273510655,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030346171"},{"type":"electronic","value":"9783030346188"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34618-8_24","type":"book-chapter","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:10:58Z","timestamp":1574381458000},"page":"700-727","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Noninteractive Certification of RSA Moduli and Beyond"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1002-3332","authenticated-orcid":false,"given":"Sharon","family":"Goldberg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2052-8203","authenticated-orcid":false,"given":"Leonid","family":"Reyzin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5554-027X","authenticated-orcid":false,"given":"Omar","family":"Sagga","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3296-5336","authenticated-orcid":false,"given":"Foteini","family":"Baldimtsi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-319-76581-5_14","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"B Auerbach","year":"2018","unstructured":"Auerbach, B., Poettering, B.: Hashing solutions instead of generating problems: on the interactive certification of RSA moduli. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10770, pp. 403\u2013430. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_14"},{"issue":"223","key":"24_CR2","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1090\/S0025-5718-98-00952-1","volume":"67","author":"Daniel J. Bernstein","year":"1998","unstructured":"Bernstein, D.J.: Detecting perfect powers in essentially linear time. Math. Comput. 67, 1253\u20131283 (1998)","journal-title":"Mathematics of Computation"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-66402-6_13","volume-title":"Computer Security \u2013 ESORICS 2017","author":"F Benhamouda","year":"2017","unstructured":"Benhamouda, F., Ferradi, H., G\u00e9raud, R., Naccache, D.: Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms. In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017. LNCS, vol. 10492, pp. 206\u2013223. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66402-6_13"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-46885-4_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"J Boyar","year":"1990","unstructured":"Boyar, J., Friedl, K., Lund, C.: Practical zero-knowledge proofs: giving hints and using deficiencies. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 155\u2013172. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_18"},{"issue":"257","key":"24_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1090\/S0025-5718-06-01837-0","volume":"76","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lenstra, H.W., Pila, J.: Detecting perfect powers by factoring into coprimes. Math. Comput. 76(257), 385\u2013388 (2007)","journal-title":"Math. Comput."},{"key":"24_CR6","unstructured":"bouncycastle c# api. https:\/\/www.bouncycastle.org\/csharp\/index.html"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s001459900009","volume":"9","author":"Mihir Bellare","year":"1996","unstructured":"Bellare, M., Yung, M.: Certifying permutations: noninteractive zero-knowledge based on any trapdoor permutation. J. Cryptol. 9(3), 149\u2013166 (1996). https:\/\/cseweb.ucsd.edu\/~mihir\/papers\/cct.html","journal-title":"Journal of Cryptology"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"J Camenisch","year":"1999","unstructured":"Camenisch, J., Michels, M.: Proving in zero-knowledge that a number is the product of two safe primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 107\u2013122. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_8"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"C Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402\u2013414. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_28"},{"key":"24_CR11","unstructured":"Tumblebit setup implementation. https:\/\/github.com\/osagga\/TumbleBitSetup"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00145-006-0431-8","volume":"20","author":"Dario Catalano","year":"2006","unstructured":"Catalano, D., Pointcheval, D. and Pornin, T. Trapdoor hard-to-invert group isomorphisms and their application to password-based authentication. J. Cryptol. 20(1), 115\u2013149, 2007. http:\/\/www.di.ens.fr\/~pointche\/Documents\/Papers\/2006_joc.pdf","journal-title":"Journal of Cryptology"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_9"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-34931-7_5","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"S Faust","year":"2012","unstructured":"Faust, S., Kohlweiss, M., Marson, G.A., Venturi, D.: On the non-malleability of the Fiat-Shamir transform. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 60\u201379. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_5"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Micciancio, D., Rabin, T.: An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In: Gong, L., Reiter, M.K. (eds.) CCS 19, Proceedings of the 5th ACM Conference on Computer and Communications Security, San Francisco, CA, USA, 3\u20135 November 1998, pp. 67\u201372. ACM (1998). http:\/\/eprint.iacr.org\/1998\/008","DOI":"10.1145\/288090.288108"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Heilman, E., Alshenibr, L., Baldimtsi, F., Scafuro, A. and Goldberg, S.: Tumblebit: an untrusted bitcoin-compatible anonymous payment hub. In: 24th Annual Network and Distributed System Security Symposium, NDSS. The Internet Society (2017). https:\/\/eprint.iacr.org\/2016\/575.pdf","DOI":"10.14722\/ndss.2017.23086"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-27954-6_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"C Hazay","year":"2012","unstructured":"Hazay, C., Mikkelsen, G.L., Rabin, T., Toft, T.: Efficient RSA key generation and threshold paillier in the two-party setting. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 313\u2013331. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27954-6_20"},{"issue":"301","key":"24_CR20","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-642-34961-4_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"SA Kakvi","year":"2012","unstructured":"Kakvi, S.A., Kiltz, E., May, A.: Certifying RSA. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 404\u2013414. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_25"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-319-63715-0_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"Y Lindell","year":"2017","unstructured":"Lindell, Y.: Fast secure two-party ECDSA signing. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 613\u2013644. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_21"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-24676-3_5","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A Lysyanskaya","year":"2004","unstructured":"Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential aggregate signatures from trapdoor permutations. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 74\u201390. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_5"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Moriarty, K., Kaliski, B., Jonsson, J., Rusch, A.: RFC 8017: PKCS #1: RSA Cryptography Specifications Version 2.2. Internet Engineering Task Force (IETF) (2016). https:\/\/tools.ietf.org\/html\/rfc8017","DOI":"10.17487\/RFC8017"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/3-540-44448-3_46","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"P MacKenzie","year":"2000","unstructured":"MacKenzie, P., Patel, S., Swaminathan, R.: Password-authenticated key exchange based on RSA. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 599\u2013613. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_46"},{"key":"24_CR26","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, 17\u201318 October 1999, New York, NY, USA, pp. 120\u2013130. IEEE Computer Society (1999)"},{"key":"24_CR27","unstructured":"Tumblebit implementation in.net core. https:\/\/github.com\/NTumbleBit\/NTumbleBit\/"},{"key":"24_CR28","doi-asserted-by":"crossref","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra, 2nd edn. Cambridge University Press (2009). http:\/\/www.shoup.net\/ntb\/ntb-v2.pdf","DOI":"10.1017\/CBO9780511814549"},{"key":"24_CR29","unstructured":"Stratis Blockchain: Bitcoin privacy is a breeze: tumblebit successfully integrated into breeze, August 2017. https:\/\/stratisplatform.com\/2017\/08\/10\/bitcoin-privacy-tumblebit-integrated-into-breeze\/"},{"key":"24_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-24582-7_28","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"DS Wong","year":"2003","unstructured":"Wong, D.S., Chan, A.H., Zhu, F.: More efficient password authenticated key exchange based on RSA. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 375\u2013387. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24582-7_28"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34618-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:24:51Z","timestamp":1710354291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-34618-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030346171","9783030346188"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34618-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 November 2019","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":"Kobe","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2019\/index.html","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":"IACR Web submission software","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"307","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":"71","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":"23% - 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.5","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":"18","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)"}}]}}