{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T20:06:48Z","timestamp":1779566808187,"version":"3.53.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032267399","type":"print"},{"value":"9783032267405","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-26740-5_12","type":"book-chapter","created":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T19:29:17Z","timestamp":1779564557000},"page":"369-400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Beyond the\u00a01\/2 Bound: On the\u00a0Theory and\u00a0Practice of\u00a0Biprimality Tests"],"prefix":"10.1007","author":[{"given":"ChihYun","family":"Chuang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"IHung","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"TingFang","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,24]]},"reference":[{"key":"12_CR1","unstructured":"Abadi, A., Ristea, D., Murdoch, S.J.: Delegated time-lock puzzle. arXiv preprint arXiv:2308.01280 (2023)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 417\u2013432. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_27"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1090\/S0025-5718-97-00836-3","volume":"66","author":"F Arnault","year":"1997","unstructured":"Arnault, F.: The Rabin-Monier theorem for Lucas pseudoprimes. Math. Comput. 66, 869\u2013881 (1997). https:\/\/doi.org\/10.1090\/S0025-5718-97-00836-3","journal-title":"Math. Comput."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Benaloh, J., de\u00a0Mare, M., Accumulators, O.W.: A decentralized alternative to digital signatures. In: Advances in Cryptology-Proceedings of Eurocrypt, vol.\u00a093 (1994)","DOI":"10.1007\/3-540-48285-7_24"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-030-26948-7_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Boneh","year":"2019","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 561\u2013586. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_20"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., Franklin, M.: Efficient generation of shared RSA keys. J. ACM 48 (2001). https:\/\/doi.org\/10.1145\/502090.502094","DOI":"10.1145\/502090.502094"},{"key":"12_CR8","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography7030037","author":"M Boudabra","year":"2023","unstructured":"Boudabra, M., Nitaj, A.: A new RSA variant based on elliptic curves. Cryptography (2023). https:\/\/doi.org\/10.3390\/cryptography7030037","journal-title":"Cryptography"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Buhler, J., Stevenhagen, P.: Algorithmic number theory. Lattices, number fields, curves and cryptography. Reprint of the 2008 hardback ed. Cambridge University Press (2011)","DOI":"10.1017\/9781139049801"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Burkhardt, J., Damg\u00e5rd, I., Frederiksen, T., Ghosh, S., Orlandi, C.: Improved distributed RSA key generation using the Miller-Rabin test. In: CCS 2023: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 2501\u20132515 (2023). https:\/\/doi.org\/10.1145\/3576915.3623163","DOI":"10.1145\/3576915.3623163"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Chen, M., et al.: Multiparty generation of an RSA modulus. J. Cryptol. 35 (2022). https:\/\/doi.org\/10.1007\/s00145-021-09395-y","DOI":"10.1007\/s00145-021-09395-y"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Chen, M., et al.: Diogenes: lightweight scalable RSA modulus generation with a dishonest majority. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 590\u2013607. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00025"},{"key":"12_CR13","unstructured":"Chvojka, P.: Private coin verifiable delay function. Cryptology ePrint Archive (2023)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-11799-2_12","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Mikkelsen, G.L.: Efficient, robust and constant-round distributed RSA key generation. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 183\u2013200. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_12"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Landrock, P., Pomerance, C.: Average case error estimates for the strong probable prime test. Math. Comput. 61, 177 (1993). https:\/\/doi.org\/10.2307\/2152945","DOI":"10.2307\/2152945"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Einsele, S., Paterson, K.: Average case error estimates of the strong Lucas test. Designs, Codes and Cryptography, pp. 1\u201338 (2024). https:\/\/doi.org\/10.1007\/s10623-023-01347-w","DOI":"10.1007\/s10623-023-01347-w"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-030-45727-3_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"N Ephraim","year":"2020","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: Continuous verifiable delay functions. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 125\u2013154. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_5"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-96881-0_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"TK Frederiksen","year":"2018","unstructured":"Frederiksen, T.K., Lindell, Y., Osheter, V., Pinkas, B.: Fast distributed RSA key generation for\u00a0semi-honest and malicious adversaries. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 331\u2013361. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_12"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Friedman, O., Marmor, A., Mutzari, D., Scaly, Y.C., Spiizer, Y., Yanai, A.: Tiresias: large scale, maliciously secure threshold Paillier. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-981-96-0891-1_5"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00145-017-9275-7","volume":"32","author":"C Hazay","year":"2019","unstructured":"Hazay, C., Mikkelsen, G.L., Rabin, T., Toft, T., Nicolosi, A.A.: Efficient RSA key generation and threshold Paillier in the two-party setting. J. Cryptol. 32, 265\u2013323 (2019)","journal-title":"J. Cryptol."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Hoffmann, C., Hub\u00e1\u010dek, P., Kamath, C., Kr\u0148\u00e1k, T.: (verifiable) delay functions from Lucas sequences. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-48624-1_13"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Ireland, K., Rosen, M.I.: A Classical Introduction to Modern Number Theory, vol.\u00a084. Springer (1990)","DOI":"10.1007\/978-1-4757-2103-4"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-38348-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"M Joye","year":"2013","unstructured":"Joye, M., Libert, B.: Efficient cryptosystems from 2$$^{k}$$-th power residue symbols. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 76\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_5"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"65635","DOI":"10.1109\/ACCESS.2019.2917628","volume":"7","author":"WI Khedr","year":"2019","unstructured":"Khedr, W.I., Khater, H.M., Mohamed, E.R.: Cryptographic accumulator-based scheme for critical data integrity verification in cloud storage. IEEE Access 7, 65635\u201365651 (2019)","journal-title":"IEEE Access"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-030-26948-7_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"G Malavolta","year":"2019","unstructured":"Malavolta, G., Thyagarajan, S.A.K.: Homomorphic time-lock puzzles and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 620\u2013649. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_22"},{"key":"12_CR26","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Rabin, M.: Probabilistic algorithm for testing primality. J. Number Theory 12, 128\u2013138 (1980). https:\/\/doi.org\/10.1016\/0022-314X(80)90084-0","DOI":"10.1016\/0022-314X(80)90084-0"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 26, 96\u201399 (1983). https:\/\/doi.org\/10.1145\/359340.359342","DOI":"10.1145\/359340.359342"},{"key":"12_CR29","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. 1996 Technical Report (1996)"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Delpech\u00a0de Saint\u00a0Guilhem, C., Makri, E., Rotaru, D., Tanguy, T.: The return of Eratosthenes: secure generation of RSA moduli using distributed sieving. In: ACM CCS 2021, pp. 594\u2013609 (2021)","DOI":"10.1145\/3460120.3484754"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17659-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 379\u2013407. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26740-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T19:29:18Z","timestamp":1779564558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26740-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032267399","9783032267405"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26740-5_12","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":"24 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"West Palm Beach, FL","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":"25 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}