{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T23:56:06Z","timestamp":1768434966667,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":51,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551156","type":"print"},{"value":"9789819551163","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-981-95-5116-3_15","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:29Z","timestamp":1765106549000},"page":"456-489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Samaritan: Linear-Time Prover SNARK from\u00a0New Multilinear Polynomial Commitments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2909-9177","authenticated-orcid":false,"given":"Chaya","family":"Ganesh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2309-7939","authenticated-orcid":false,"given":"Sikhar","family":"Patranabis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7824-042X","authenticated-orcid":false,"given":"Nitin","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, pp. 315\u2013334. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 326\u2013349 (2012)","DOI":"10.1145\/2090236.2090263"},{"key":"15_CR3","series-title":"LNCS","first-page":"123","volume-title":"EUROCRYPT 2025, Part IV","author":"M Brehm","year":"2025","unstructured":"Brehm, M., Chen, B., Fisch, B., Resch, N., Rothblum, R.D., Zeilberger, H.: Blaze: fast SNARKs from interleaved RAA codes. In: Fehr, S., Fouque, P.-A. (eds.) EUROCRYPT 2025, Part IV. LNCS, vol. 15604, pp. 123\u2013152. Springer, Cham (2025)"},{"key":"15_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"CRYPTO 2013, Part II","author":"E Ben-Sasson","year":"2013","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 90\u2013108. Springer, Berlin, Heidelberg (2013)"},{"key":"15_CR5","series-title":"LNCS","first-page":"427","volume-title":"EUROCRYPT 2022, Part II","author":"J Bootle","year":"2022","unstructured":"Bootle, J., Chiesa, A., Hu, Y., Orr\u00f9, M.: Gemini: elastic SNARKs for diverse environments. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 427\u2013457. Springer, Cham (2022)"},{"key":"15_CR6","series-title":"LNCS","first-page":"315","volume-title":"TCC 2013","author":"N Bitansky","year":"2013","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Ostrovsky, R., Paneth, O.: Succinct non-interactive arguments via linear interactive proofs. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 315\u2013333. Springer, Heidelberg (2013)"},{"key":"15_CR7","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von Neumann architecture. In: Fu, K., Jung, J. (eds.) USENIX Security 2014, pp. 781\u2013796. USENIX Association (2014)"},{"key":"15_CR8","series-title":"LNCS","first-page":"677","volume-title":"EUROCRYPT 2020, Part I","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020)"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/050646445","volume":"38","author":"E Ben-Sasson","year":"2008","unstructured":"Ben-Sasson, E., Sudan, M.: Short PCPs with polylog query complexity. SIAM J. Comput. 38(2), 551\u2013607 (2008)","journal-title":"SIAM J. Comput."},{"key":"15_CR10","series-title":"LNCS","first-page":"499","volume-title":"EUROCRYPT 2023, Part II","author":"B Chen","year":"2023","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part II. LNCS, vol. 14005, pp. 499\u2013530. Springer, Cham (2023)"},{"key":"15_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-031-44469-2_17","volume-title":"LATINCRYPT 2023","author":"M Campanelli","year":"2023","unstructured":"Campanelli, M., Gailly, N., Gennaro, R., Jovanovic, P., Mihali, M., Thaler, J.: Testudo: linear time prover SNARKs with constant size proofs and square root size universal setup. In: Aly, A., Tibouchi, M. (eds.) LATINCRYPT 2023. LNCS, vol. 14168, pp. 331\u2013351. Springer, Cham (2023)"},{"key":"15_CR12","series-title":"LNCS","first-page":"738","volume-title":"EUROCRYPT 2020, Part I","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Yuncong, H., Maller, M., Mishra, P., Vesely, P., Ward, N.P.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020)"},{"key":"15_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-031-68403-6_7","volume-title":"CRYPTO 2024, Part X","author":"V Cini","year":"2024","unstructured":"Cini, V., Malavolta, G., Nguyen, N.K., Wee, H.: Polynomial commitments from lattices: Post-quantum security, fast verification and transparent setup. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part X. LNCS, vol. 14929, pp. 207\u2013242. Springer, Cham (2024)"},{"key":"15_CR14","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: cq: Cached quotients for fast lookups. Cryptology ePrint Archive, Report 2022\/1763 (2022)"},{"key":"15_CR15","unstructured":"Eagen, L., Gabizon, A.: MERCURY: a multilinear polynomial commitment scheme with constant proof size and no prover FFTs. Cryptology ePrint Archive, Paper 2025\/385 (2025)"},{"key":"15_CR16","series-title":"LNCS","first-page":"33","volume-title":"CRYPTO 2018, Part II","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part II. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018)"},{"key":"15_CR17","series-title":"LNCS","first-page":"186","volume-title":"CRYPTO 1986","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)"},{"key":"15_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"EUROCRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013)"},{"key":"15_CR19","series-title":"Part II, volume 14082 of LNCS","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-031-38545-2_7","volume-title":"CRYPTO 2023","author":"A Golovnev","year":"2023","unstructured":"Golovnev, A., Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic SNARKs for R1CS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. Part II, volume 14082 of LNCS, pp. 193\u2013226. Springer, Cham (2023)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Ganesh, C., Nair, V., Sharma, A.: Dual polynomial commitment schemes and applications to commit-and-prove SNARKs. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D. (eds.) ACM CCS 2024, pp. 884\u2013898. ACM Press (2024)","DOI":"10.1145\/3658644.3690219"},{"key":"15_CR21","unstructured":"Ganesh, C., Patranabis, S., Singh, N.: Samaritan: Linear-time prover SNARK from new multilinear polynomial commitments. Cryptology ePrint Archive, Report 2025\/419 (2025)"},{"key":"15_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"ASIACRYPT 2010","author":"J Groth","year":"2010","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 321\u2013340. Springer, Heidelberg (2010)"},{"key":"15_CR23","series-title":"LNCS","first-page":"305","volume-title":"EUROCRYPT 2016, Part II","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016)"},{"key":"15_CR24","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019)"},{"key":"15_CR25","unstructured":"Hab\u00f6ck, U.: Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive, Report 2022\/1530 (2022)"},{"key":"15_CR26","unstructured":"Hab\u00f6ck, U.: A summary on the FRI low degree test. Cryptology ePrint Archive, Report 2022\/1216 (2022)"},{"key":"15_CR27","unstructured":"Hu, Y., et al.: DFS: delegation-friendly zkSNARK and private delegation of provers. In: USENIX SEcurity 2025 (2025, to appear)"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"issue":"4","key":"15_CR29","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00145-024-09519-0","volume":"37","author":"T Kohrita","year":"2024","unstructured":"Kohrita, T., Towa, P.: Zeromorph: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments. J. Cryptol. 37(4), 38 (2024)","journal-title":"J. Cryptol."},{"key":"15_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010)"},{"key":"15_CR31","unstructured":"Protocol Labs. Filecoin: A decentralized storage network (2017). https:\/\/filecoin.io\/filecoin.pdf"},{"key":"15_CR32","series-title":"LNCS","first-page":"1","volume-title":"TCC 2021, Part II","author":"J Lee","year":"2021","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part II. LNCS, vol. 13043, pp. 1\u201334. Springer, Cham (2021)"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. In: 31st FOCS, pp. 2\u201310. IEEE Computer Society Press (1990)","DOI":"10.1109\/FSCS.1990.89518"},{"key":"15_CR34","series-title":"LNCS","first-page":"169","volume-title":"TCC 2012","author":"H Lipmaa","year":"2012","unstructured":"Lipmaa, H.: Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 169\u2013189. Springer, Heidelberg (2012)"},{"key":"15_CR35","series-title":"LNCS","first-page":"41","volume-title":"ASIACRYPT 2013, Part I","author":"H Lipmaa","year":"2013","unstructured":"Lipmaa, H.: Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part I. LNCS, vol. 8269, pp. 41\u201360. Springer, Heidelberg (2013)"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 2111\u20132128. ACM Press (2019)","DOI":"10.1145\/3319535.3339817"},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"Micali, S.: CS proofs. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 436\u2013453. IEEE (1994)","DOI":"10.1109\/SFCS.1994.365746"},{"key":"15_CR38","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-031-68403-6_8","volume-title":"CRYPTO 2024, Part X","author":"NK Nguyen","year":"2024","unstructured":"Nguyen, N.K., Seiler, G.: Greyhound: fast polynomial commitments from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part X. LNCS, vol. 14929, pp. 243\u2013275. Springer, Cham (2024)"},{"key":"15_CR39","unstructured":"Papini, S., Hab\u00f6ck, U.: Improving logarithmic derivative lookups using GKR. Cryptology ePrint Archive, Report 2023\/1284 (2023)"},{"key":"15_CR40","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: Nearly practical verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, pp. 238\u2013252. IEEE Computer Society Press (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"15_CR41","series-title":"LNCS","first-page":"222","volume-title":"TCC 2013","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 222\u2013242. Springer, Heidelberg (2013)"},{"key":"15_CR42","unstructured":"An incomplete guide to rollups (2021). https:\/\/vitalik.ca\/general\/2021\/01\/ 05\/rollup.html"},{"key":"15_CR43","series-title":"LNCS","first-page":"704","volume-title":"CRYPTO 2020, Part III","author":"S Setty","year":"2020","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 704\u2013737. Springer, Cham (2020)"},{"key":"15_CR44","unstructured":"Setty, S., Lee, J.: Quarks: quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Report 2020\/1275 (2020)"},{"key":"15_CR45","unstructured":"Setty, S., Thaler, J.: Twist and shout: faster memory checking arguments via one-hot addressing and increments. Cryptology ePrint Archive, Paper 2025\/105 (2025)"},{"key":"15_CR46","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In: 2018 IEEE Symposium on Security and Privacy, pp. 926\u2013943. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"15_CR47","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-031-15985-5_11","volume-title":"CRYPTO 2022, Part IV","author":"T Xie","year":"2022","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: zero knowledge proof with linear prover time. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part IV. LNCS, vol. 13510, pp. 299\u2013328. Springer, Cham (2022)"},{"key":"15_CR48","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-26954-8_24","volume-title":"CRYPTO 2019, Part III","author":"T Xie","year":"2019","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 733\u2013764. Springer, Cham (2019)"},{"key":"15_CR49","doi-asserted-by":"crossref","unstructured":"Zapico, A., Buterin, V., Khovratovich, D., Maller, M., Nitulescu, A., Simkin, M.: Caulk: lookup arguments in sublinear time. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 3121\u20133134. ACM Press (2022)","DOI":"10.1145\/3548606.3560646"},{"key":"15_CR50","doi-asserted-by":"crossref","unstructured":"Zhao, J., Setty, S., Cui, W., Zaverucha, G.: MicroNova: folding-based arguments with efficient (on-chain) verification. In: IEEE S &P 2025 (2024, to appear)","DOI":"10.1109\/SP61157.2025.00168"},{"key":"15_CR51","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xie, T., Zhang, Y., Song, D.: Transparent polynomial delegation and its applications to zero knowledge proof. In: 2020 IEEE Symposium on Security and Privacy, pp. 859\u2013876. IEEE Computer Society Press (2020)","DOI":"10.1109\/SP40000.2020.00052"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5116-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:34Z","timestamp":1765106554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5116-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551156","9789819551163"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5116-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","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":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}