{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T17:07:39Z","timestamp":1781284059223,"version":"3.54.1"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031910975","type":"print"},{"value":"9783031910982","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-031-91098-2_8","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T08:43:55Z","timestamp":1745743435000},"page":"195-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Exponent-VRFs and\u00a0Their Applications"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Iftach","family":"Haitner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gil","family":"Segev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-319-96878-0_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Agrawal","year":"2018","unstructured":"Agrawal, S., Ganesh, C., Mohassel, P.: Non-interactive zero-knowledge proofs for composite statements. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 643\u2013673. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_22"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-84242-0_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"H K\u0131l\u0131n\u00e7 Alper","year":"2021","unstructured":"K\u0131l\u0131n\u00e7 Alper, H., Burdges, J.: Two-round trip Schnorr multi-signatures via delinearized witnesses. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 157\u2013188. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_7"},{"key":"8_CR3","unstructured":"Benaloh, J.: Verifiable secret-ballot elections. Ph.D thesis (1988)"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., Lepoint, T., Loss, J., Orr\u00f9, M., Raykova, M.: On the (in)security of ROS. J. Cryptol. 35(4), 25 (Oct 2022). https:\/\/doi.org\/10.1007\/s00145-022-09436-0","DOI":"10.1007\/s00145-022-09436-0"},{"key":"8_CR5","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.Y.: High-speed high-security signatures. Cryptology ePrint Archive, Report 2011\/368 (2011). https:\/\/eprint.iacr.org\/2011\/368"},{"key":"8_CR6","unstructured":"Boneh, D., Haitner, I., Lindell, Y., Segev, G.: Exponent-VRFs and their applications. Cryptology ePrint Archive, Report 2024\/397 (2024). https:\/\/eprint.iacr.org\/2024\/397"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61\u201376. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_5"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol.13(1), 143\u2013202 (Jan 2000). https:\/\/doi.org\/10.1007\/s001459910006","DOI":"10.1007\/s001459910006"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"8_CR11","unstructured":"Canetti, R., Gennaro, R., Goldfeder, S., Makriyannis, N., Peled, U.: UC non-interactive, proactive, threshold ECDSA with identifiable aborts. Cryptology ePrint Archive, Report 2021\/060 (2021). https:\/\/eprint.iacr.org\/2021\/060"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-75496-1_24","volume-title":"Information Security","author":"G Castagnos","year":"2007","unstructured":"Castagnos, G., Chevallier-Mames, B.: Towards a DL-based additively homomorphic encryption scheme. In: Garay, J.A., Lenstra, A.K., Mambo, M., Peralta, R. (eds.) ISC 2007. LNCS, vol. 4779, pp. 362\u2013375. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75496-1_24"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F.: Linearly homomorphic encryption from $$\\sf DDH$$. In: CT-RSA\u00a02015. LNCS, vol.\u00a09048, pp. 487\u2013505. Springer. https:\/\/doi.org\/10.1007\/978-3-319-16715-2_26","DOI":"10.1007\/978-3-319-16715-2_26"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-74143-5_17","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M Chase","year":"2007","unstructured":"Chase, M., Lysyanskaya, A.: Simulatable VRFs with applications to multi-theorem NIZK. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 303\u2013322. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_17"},{"key":"8_CR15","unstructured":"Chase, M., Orr\u00f9, M., Perrin, T., Zaverucha, G.: Proofs of discrete logarithm equality across groups. Cryptology ePrint Archive, Report 2022\/1593 (2022). https:\/\/eprint.iacr.org\/2022\/1593"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"D Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_7"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Chen, Y.H., Lindell, Y.: Feldman\u2019s verifiable secret sharing for a dishonest majority. Cryptology ePrint Archive, Paper 2024\/031 (2024). https:\/\/eprint.iacr.org\/2024\/031","DOI":"10.62056\/ak2isgvtw"},{"key":"8_CR18","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":"8_CR19","unstructured":"Doerner, J., Kondi, Y., Lee, E., abhi shelat: Threshold ECDSA in three rounds. Cryptology ePrint Archive, Paper 2023\/765 (2023). https:\/\/eprint.iacr.org\/2023\/765"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., shelat, a.: Secure two-party threshold ECDSA from ECDSA assumptions. Cryptology ePrint Archive, Report 2018\/499 (2018). https:\/\/eprint.iacr.org\/2018\/499","DOI":"10.1109\/SP.2018.00036"},{"key":"8_CR21","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 (1987). https:\/\/doi.org\/10.1109\/SFCS.1987.4","DOI":"10.1109\/SFCS.1987.4"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-44586-2_22","volume-title":"Public Key Cryptography","author":"P-A Fouque","year":"2001","unstructured":"Fouque, P.-A., Stern, J.: One round threshold discrete-log key generation without private channels. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 300\u2013316. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_22"},{"key":"8_CR23","unstructured":"Galbraith, S.D.: Elliptic curve paillier schemes. Cryptology ePrint Archive, Report 2001\/050 (2001). https:\/\/eprint.iacr.org\/2001\/050"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Garg, S., Srinivasan, A.: Two-round multiparty secure computation from minimal assumptions. J. ACM 69(5) (2022). https:\/\/doi.org\/10.1145\/3566048","DOI":"10.1145\/3566048"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-84242-0_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"F Garillot","year":"2021","unstructured":"Garillot, F., Kondi, Y., Mohassel, P., Nikolaenko, V.: Threshold Schnorr with stateless deterministic signing from standard assumptions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_6"},{"key":"8_CR26","unstructured":"Geihs, M.: Great-LaKeys: an improved threshold-PRF and a novel exponent-VRF from LWR. Cryptology ePrint Archive, Paper 2024\/996 (2024). https:\/\/eprint.iacr.org\/2024\/996"},{"key":"8_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge, UK (2004)"},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (Oct 1986). https:\/\/doi.org\/10.1145\/6490.6503","DOI":"10.1145\/6490.6503"},{"key":"8_CR29","unstructured":"Groth, J.: Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive, Report 2021\/339 (2021). https:\/\/eprint.iacr.org\/2021\/339"},{"key":"8_CR30","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.) Advances in Cryptology \u2013 EUROCRYPT 2013, pp. 76\u201392. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_5"},{"key":"8_CR31","unstructured":"Katz, J.: Round optimal fully secure distributed key generation. Cryptology ePrint Archive, Paper 2023\/1094 (2023). https:\/\/eprint.iacr.org\/2023\/1094"},{"key":"8_CR32","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-81652-0_2","volume-title":"Selected Areas in Cryptography: 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers","author":"C Komlo","year":"2021","unstructured":"Komlo, C., Goldberg, I.: FROST: flexible round-optimized Schnorr threshold signatures. In: Dunkelman, O., Jacobson, M.J., O\u2019Flynn, C. (eds.) Selected Areas in Cryptography: 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers, pp. 34\u201365. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_2"},{"key":"8_CR33","unstructured":"Komlo, C., Goldberg, I.: Arctic: Lightweight and stateless threshold schnorr signatures. Cryptology ePrint Archive, Paper 2024\/466 (2024). https:\/\/eprint.iacr.org\/2024\/466"},{"key":"8_CR34","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/978-3-031-38557-5_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20\u201324, 2023, Proceedings, Part I","author":"Y Kondi","year":"2023","unstructured":"Kondi, Y., Orlandi, C., Roy, L.: Two-round stateless deterministic two-party Schnorr signatures from\u00a0pseudorandom correlation functions. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20\u201324, 2023, Proceedings, Part I, pp. 646\u2013677. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_21"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Kondi, Y., Orlandi, C., Roy, L.: Two-round stateless deterministic two-party schnorr signatures from pseudorandom correlation functions. Cryptology ePrint Archive, Report 2023\/216 (2023). https:\/\/eprint.iacr.org\/2023\/216","DOI":"10.1007\/978-3-031-38557-5_21"},{"key":"8_CR36","doi-asserted-by":"publisher","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: 38th ACM STOC, pp. 109\u2013118. ACM Press (2001). https:\/\/doi.org\/10.1145\/1132516.1132532","DOI":"10.1145\/1132516.1132532"},{"key":"8_CR37","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":"8_CR38","unstructured":"Lindell, Y.: Simple three-round multiparty Schnorr signing with full simulatability. Cryptology ePrint Archive, Report 2022\/374 (2022). https:\/\/eprint.iacr.org\/2022\/374"},{"key":"8_CR39","unstructured":"Makriyannis, N.: On the classic protocol for MPC schnorr signatures. Cryptology ePrint Archive, Report 2022\/1332 (2022). https:\/\/eprint.iacr.org\/2022\/1332"},{"key":"8_CR40","doi-asserted-by":"publisher","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th FOCS, pp. 120\u2013130. IEEE Computer Society Press (Oct\u00a017\u201319, 1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814584","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"8_CR41","doi-asserted-by":"publisher","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: ACM CCS\u00a01998, pp. 59\u201366. ACM Press. https:\/\/doi.org\/10.1145\/288090.288106","DOI":"10.1145\/288090.288106"},{"key":"8_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-48910-X_23","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"M Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed pseudo-random functions and KDCs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 327\u2013346. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_23"},{"key":"8_CR43","doi-asserted-by":"publisher","unstructured":"Nick, J., Ruffing, T., Seurin, Y., Wuille, P.: MuSig-DN: Schnorr multi-signatures with verifiably deterministic nonces. In: ACM CCS\u00a02020, pp. 1717\u20131731. ACM Press. https:\/\/doi.org\/10.1145\/3372297.3417236","DOI":"10.1145\/3372297.3417236"},{"key":"8_CR44","doi-asserted-by":"crossref","unstructured":"Nick, J., Ruffing, T., Seurin, Y., Wuille, P.: MuSig-DN: Schnorr multi-signatures with verifiably deterministic nonces. Cryptology ePrint Archive, Report 2020\/1057 (2020). https:\/\/eprint.iacr.org\/2020\/1057","DOI":"10.1145\/3372297.3417236"},{"key":"8_CR45","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\u201998","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":"8_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"8_CR47","unstructured":"Wuille, P.: Hierarchical deterministic wallets (2012). https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0032.mediawiki"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91098-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T08:44:07Z","timestamp":1745743447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91098-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031910975","9783031910982"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91098-2_8","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":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}