{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:42:16Z","timestamp":1768902136205,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018540","type":"print"},{"value":"9783032018557","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-3-032-01855-7_2","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:41:17Z","timestamp":1755373277000},"page":"33-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Results on\u00a0the\u00a0$$\\phi $$-Hiding Assumption and\u00a0Factoring Related RSA Moduli"],"prefix":"10.1007","author":[{"given":"Jun","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/s00145-018-9283-2","volume":"32","author":"M Abdalla","year":"2019","unstructured":"Abdalla, M., Benhamouda, F., Pointcheval, D.: On the tightness of forward-secure signature reductions. J. Cryptol. 32(1), 84\u2013150 (2019)","journal-title":"J. Cryptol."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Manders, K.L., Miller, G.L.: On taking roots in finite fields. In: FOCS, IEEE Computer Society (1977) 175\u2013178","DOI":"10.1109\/SFCS.1977.18"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., McCurley, K.S.: Open problems in number theoretic complexity. In: Discrete Algorithms and Complexity, pp. 237\u2013262. Elsevier (1987)","DOI":"10.1016\/B978-0-12-386870-1.50020-4"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-58691-1_70","volume-title":"Algorithmic Number Theory","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M., McCurley, K.S.: Open problems in number theoretic complexity, II. In: Adleman, L.M., Huang, M.-D. (eds.) ANTS 1994. LNCS, vol. 877, pp. 291\u2013322. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58691-1_70"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-90456-2_4","volume-title":"Theory of Cryptography","author":"N Alamati","year":"2021","unstructured":"Alamati, N., Branco, P., D\u00f6ttling, N., Garg, S., Hajiabadi, M., Pu, S.: Laconic private set intersection and applications. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 94\u2013125. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_4"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-48071-4_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 1992","author":"M Bellare","year":"1993","unstructured":"Bellare, M., Yung, M.: Certifying cryptographic tools: the case of trapdoor permutations. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 442\u2013460. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_31"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00208000","volume":"9","author":"M 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)","journal-title":"J. Cryptol."},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11426639_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J Bl\u00f6mer","year":"2005","unstructured":"Bl\u00f6mer, J., May, A.: A tool kit for finding small roots of bivariate polynomials over the integers. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 251\u2013267. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_15"},{"key":"2_CR9","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 1999","author":"C Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) Computationally private information retrieval with polylogarithmic communication. LNCS, vol. 1592, pp. 402\u2013414. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_28"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-34704-7_6","volume-title":"Information Security and Cryptology","author":"Z Cao","year":"2012","unstructured":"Cao, Z., Sha, Q., Fan, X.: Adleman-Manders-Miller root extraction method revisited. In: Wu, C.-K., Yung, M., Lin, D. (eds.) Inscrypt 2011. LNCS, vol. 7537, pp. 77\u201385. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34704-7_6"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-642-10366-7_28","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"G Castagnos","year":"2009","unstructured":"Castagnos, G., Joux, A., Laguillaumie, F., Nguyen, P.Q.: Factoring pq2 with quadratic forms: nice cryptanalyses. In: Matsui, M. (ed.) Advances in Cryptology \u2013 ASIACRYPT 2009. LNCS, vol. 5912, pp. 469\u2013486. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_28"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-030-87629-6_7","volume-title":"Partially Homomorphic Encryption","author":"\u00c7K Ko\u00e7","year":"2021","unstructured":"Ko\u00e7, \u00c7.K., \u00d6zdemir, F., \u00d6demi\u015f \u00d6zger, Z.: Naccache-Stern Algorithm. In: Partially Homomorphic Encryption, pp. 71\u201382. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-87629-6_7"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1996","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a bivariate integer equation; factoring with high bits known. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 178\u2013189. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_16"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptol."},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803\u2013815. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_65"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-30576-7_4","volume-title":"Theory of Cryptography","author":"J Groth","year":"2005","unstructured":"Groth, J.: Cryptography in subgroups of $$\\mathbb{Z}_{n}^{*}$$. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 50\u201365. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_4"},{"key":"2_CR17","first-page":"76","volume":"48","author":"GH Hardy","year":"1917","unstructured":"Hardy, G.H., Ramanujan, S.: The normal number of prime factors of a number $$n$$. Q. J. Math. 48, 76\u201392 (1917)","journal-title":"Q. J. Math."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-48059-5_28","volume-title":"Cryptographic Hardware and Embedded Systems","author":"M Hartmann","year":"1999","unstructured":"Hartmann, M., Paulus, S., Takagi, T.: NICE - new ideal Coset encryption -. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) NICE - new ideal coset encryption. LNCS, vol. 1717, pp. 328\u2013339. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48059-5_28"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-662-46494-6_24","volume-title":"Theory of Cryptography","author":"B Hemenway","year":"2015","unstructured":"Hemenway, B., Ostrovsky, R., Rosen, A.: Non-committing encryption from $$\\phi $$-hiding. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 591\u2013608. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_24"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-21969-6_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"M Herrmann","year":"2011","unstructured":"Herrmann, M.: Improved cryptanalysis of the multi-prime $$\\phi $$ - hiding assumption. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol. 6737, pp. 92\u201399. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21969-6_6"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Crytography and Coding","author":"N Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: Darnell, M. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 131\u2013142. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0024458"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-68164-9_13","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"MJ Jacobson","year":"2008","unstructured":"Jacobson, M.J., Scheidler, R., Weimer, D.: An adaptation of the NICE cryptosystem to real quadratic orders. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 191\u2013208. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68164-9_13"},{"key":"2_CR23","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":"2_CR24","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, Second Edition. CRC Press (2014)","DOI":"10.1201\/b17668"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-14623-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"E Kiltz","year":"2010","unstructured":"Kiltz, E., O\u2019Neill, A., Smith, A.: Instantiability of RSA-OAEP under chosen-plaintext attack. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 295\u2013313. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_16"},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s00145-016-9238-4","volume":"30","author":"E Kiltz","year":"2017","unstructured":"Kiltz, E., O\u2019Neill, A., Smith, A.D.: Instantiability of RSA-OAEP under chosen-plaintext attack. J. Cryptol. 30(3), 889\u2013919 (2017)","journal-title":"J. Cryptol."},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-030-01950-1_35","volume-title":"Information and Communications Security","author":"Y Lu","year":"2018","unstructured":"Lu, Y., Kunihiro, N., Zhang, R., Peng, L., Ma, H.: Certifying variant of RSA with generalized moduli. In: Naccache, D., et al. (eds.) ICICS 2018. LNCS, vol. 11149, pp. 598\u2013608. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01950-1_35"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-662-48797-6_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"Y Lu","year":"2015","unstructured":"Lu, Y., Zhang, R., Peng, L., Lin, D.: Solving linear equations modulo unknown divisors: revisited. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 189\u2013213. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_9"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"May, A.: Using LLL-reduction for solving RSA and factorization problems. In: Nguyen, P., Vall\u00e9e, B. (eds.) The LLL Algorithm. Information Security and Cryptography, pp. 315\u2013348. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02295-1_10","DOI":"10.1007\/978-3-642-02295-1_10"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: CCS, pp. 59\u201366. ACM (1998)","DOI":"10.1145\/288090.288106"},{"issue":"1","key":"2_CR31","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/18.50373","volume":"36","author":"T Okamoto","year":"1990","unstructured":"Okamoto, T.: A fast signature scheme based on congruential polynomial operations. IEEE Trans. Inf. Theory 36(1), 47\u201353 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1998","author":"T Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308\u2013318. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054135"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Ryan, K., Heninger, N.: Fast practical lattice reduction through iterated compression. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. LNCS, vol. 14083, pp. 3\u201336. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_1","DOI":"10.1007\/978-3-031-38548-3_1"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Schridde, C., Freisleben, B.: On the validity of the $$\\phi $$-hiding assumption in cryptographic protocols. In: ASIACRYPT, vol. 5350, pp. 344\u2013354. LNCS, Springer, Cham (2008)","DOI":"10.1007\/978-3-540-89255-7_21"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo $$p^kq$$. In: Krawczyk, H. (eds.) Advances in Cryptology \u2014 CRYPTO 1998. CRYPTO 1998. LNCS, vol. 1462, pp. 318\u2013326. Springer, Berlin, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055738CRYPTO","DOI":"10.1007\/BFb0055738CRYPTO"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-31448-3_1","volume-title":"Information Security and Privacy","author":"K Tosu","year":"2012","unstructured":"Tosu, K., Kunihiro, N.: Optimal bounds for multi-prime $$\\phi $$-hiding assumption. In: Susilo, W., Mu, Y., Seberry, J. (eds.) ACISP 2012. LNCS, vol. 7372, pp. 1\u201314. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31448-3_1"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"von\u00a0zur Gathen, J., Gerhard, J.: Modern Computer Algebra (3. edn.). Cambridge University Press, Cambridge (2013)","DOI":"10.1017\/CBO9781139856065"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Xu, J., Hu, L., Sarkar, S., Zhang, X., Huang, Z., Peng, L.: Cryptanalysis of multi-prime $$\\phi $$-hiding assumption. In: ISC, vol. 9866, LNCS, pp. 440\u2013453. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-45871-7_26"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53008-5_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Yamakawa","year":"2016","unstructured":"Yamakawa, T., Yamada, S., Hanaoka, G., Kunihiro, N.: Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 3\u201332. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_1"},{"issue":"4","key":"2_CR40","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1049\/iet-ifs.2018.5178","volume":"13","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Wang, L., Xu, J.: Certifying multi-power RSA. IET Inf. Secur. 13(4), 330\u2013335 (2019)","journal-title":"IET Inf. Secur."},{"key":"2_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-030-55304-3_21","volume-title":"Information Security and Privacy","author":"X Zhao","year":"2020","unstructured":"Zhao, X., Cao, Z., Dong, X., Shao, J., Wang, L., Liu, Z.: New assumptions and efficient cryptosystems from the e-th power residue symbol. In: Liu, J.K., Cui, H. (eds.) ACISP 2020. LNCS, vol. 12248, pp. 408\u2013424. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55304-3_21"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01855-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T19:21:52Z","timestamp":1768850512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01855-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018540","9783032018557"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01855-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}