{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:40:57Z","timestamp":1770741657702,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":43,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550982","type":"print"},{"value":"9789819550999","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-5099-9_10","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:38:15Z","timestamp":1765107495000},"page":"297-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["RoK and\u00a0Roll \u2013 Verifier-Efficient Random Projection for\u00a0$$\\tilde{O}(\\lambda )$$-Size Lattice Arguments"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kloo\u00df","sequence":"first","affiliation":[]},{"given":"Russell W. F.","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Ngoc Khanh","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Micha\u0142","family":"Osadnik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson-lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671\u2013687 (2003) https:\/\/doi.org\/10.1016\/S0022-0000(03)00025-4, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000003000254, special Issue on PODS 2001","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Fenzi, G., Lapiha, O., Nguyen, N.K.: SLAP: Succinct lattice-based polynomial commitments from standard assumptions. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0VII. LNCS, vol. 14657, pp. 90\u2013119. Springer, Cham (May 2024). https:\/\/doi.org\/10.1007\/978-3-031-58754-2_4","DOI":"10.1007\/978-3-031-58754-2_4"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-030-84245-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht, M.R., Lai, R.W.F.: Subtractive sets over cyclotomic rings. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 519\u2013548. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_18"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: STIR: Reed-solomon proximity testing with fewer queries. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 380\u2013413. Springer, Cham (Aug 2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_12","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: WHIR: Reed-solomon proximity testing with super-fast verification. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0IV. LNCS, vol. 15604, pp. 214\u2013243. Springer, Cham (May 2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_8","DOI":"10.1007\/978-3-031-91134-7_8"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R., Kohl, L.: A compressed protocol theory for\u00a0lattices. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 549\u2013579. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_19","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-319-96881-0_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"C Baum","year":"2018","unstructured":"Baum, C., Bootle, J., Cerulli, A., del Pino, R., Groth, J., Lyubashevsky, V.: Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 669\u2013699. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_23"},{"key":"10_CR8","unstructured":"Baum, C., Lyubashevsky, V.: Simple amortized proofs of shortness for linear relations over polynomial rings. Cryptology ePrint Archive, Report 2017\/759 (2017). https:\/\/eprint.iacr.org\/2017\/759"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) ICALP 2018. LIPIcs, vol.\u00a0107, pp. 14:1\u201314:17. Schloss Dagstuhl (Jul 2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.14","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: Compact proofs for R1CS from module-SIS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 518\u2013548. Springer, Cham (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"10_CR11","unstructured":"Boneh, D., Chen, B.: LatticeFold: a lattice-based folding scheme and its applications to succinct proof systems. Cryptology ePrint Archive, Report 2024\/257 (2024). https:\/\/eprint.iacr.org\/2024\/257"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-032-01907-3_11","volume-title":"Advances in Cryptology - CRYPTO 2025","author":"D Boneh","year":"2025","unstructured":"Boneh, D., Chen, B.: Latticefold+: faster, simpler, shorter lattice-based folding for succinct proof systems. In: Tauman Kalai, Y., Kamara, S.F. (eds.) Advances in Cryptology - CRYPTO 2025, pp. 327\u2013361. Springer Nature Switzerland, Cham (2025)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Bootle, J., Chiesa, A., Sotiraki, K.: Lattice-based succinct arguments for NP with polylogarithmic-time verification. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0II. LNCS, vol. 14082, pp. 227\u2013251. Springer, Cham (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_8","DOI":"10.1007\/978-3-031-38545-2_8"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-56880-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Bootle","year":"2020","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: A non-PCP approach to succinct quantum-safe zero-knowledge. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 441\u2013469. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_16"},{"key":"10_CR16","doi-asserted-by":"publisher","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 (May 2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Cini, V., Lai, R.W.F., Malavolta, G.: Lattice-based succinct arguments from vanishing polynomials - (extended abstract). In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0II. LNCS, vol. 14082, pp. 72\u2013105. Springer, Cham (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_3","DOI":"10.1007\/978-3-031-38545-2_3"},{"key":"10_CR19","doi-asserted-by":"publisher","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\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 207\u2013242. Springer, Cham (Aug 2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_7","DOI":"10.1007\/978-3-031-68403-6_7"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-030-64834-3_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"MF Esgin","year":"2020","unstructured":"Esgin, M.F., Nguyen, N.K., Seiler, G.: Practical exact proofs from lattices: new techniques to exploit fully-splitting rings. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 259\u2013288. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_9"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Fenzi, G., Knabenhans, C., Nguyen, N.K., Pham, D.T.: Lova: Lattice-based folding scheme from unstructured lattices. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0IV. LNCS, vol. 15487, pp. 303\u2013326. Springer, Singapore (Dec 2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_10","DOI":"10.1007\/978-981-96-0894-2_10"},{"issue":"3","key":"10_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00145-024-09511-8","volume":"37","author":"G Fenzi","year":"2024","unstructured":"Fenzi, G., Moghaddas, H., Nguyen, N.K.: Lattice-based polynomial commitments: towards asymptotic and concrete efficiency. J. Cryptol. 37(3), 31 (2024). https:\/\/doi.org\/10.1007\/s00145-024-09511-8","journal-title":"J. Cryptol."},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Freksen, C.B., Larsen, K.G.: On using toeplitz and circulant matrices for johnson-lindenstrauss transforms. Algorithmica 82(2), 338\u2013354 (2020). https:\/\/doi.org\/10.1007\/s00453-019-00644-y, https:\/\/doi.org\/10.1007\/s00453-019-00644-y","DOI":"10.1007\/s00453-019-00644-y"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Gentry, C., Halevi, S., Lyubashevsky, V.: Practical non-interactive publicly verifiable secret sharing with thousands of parties. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0I. LNCS, vol. 13275, pp. 458\u2013487. Springer, Cham (May\u00a0\/\u00a0Jun 2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_16","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","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. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Hinrichs, A., Vyb\u00edral, J.: Johnson-lindenstrauss lemma for circulant matrices. Random Struct. Algorithms 39(3), 391\u2013398 (Oct2011). https:\/\/doi.org\/10.1002\/rsa.20360","DOI":"10.1002\/rsa.20360"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Johnson, W., Lindenstrauss, J.: Extensions of lipschitz maps into a hilbert space. Contemporary Math. 26, 189\u2013206 (01 1984). https:\/\/doi.org\/10.1090\/conm\/026\/737400","DOI":"10.1090\/conm\/026\/737400"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: 24th ACM STOC, pp. 723\u2013732. ACM Press (May 1992). https:\/\/doi.org\/10.1145\/129712.129782","DOI":"10.1145\/129712.129782"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Kloo\u00df, M., Lai, R.W.F., Nguyen, N.K., Osadnik, M.: RoK, paper, SISsors toolkit for lattice-based succinct arguments - (extended abstract). In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0V. LNCS, vol. 15488, pp. 203\u2013235. Springer, Singapore (Dec 2024). https:\/\/doi.org\/10.1007\/978-981-96-0935-2_7","DOI":"10.1007\/978-981-96-0935-2_7"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Kloo\u00df, M., Lai, R.W.F., Nguyen, N.K., Osadnik, M.: RoK and roll \u2013 verifier-efficient random projection for $$\\tilde{O}(\\lambda )$$-size lattice arguments. Cryptology ePrint Archive, Paper 2025\/1220 (2025). https:\/\/eprint.iacr.org\/2025\/1220","DOI":"10.1007\/978-981-95-5099-9_10"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Parno, B.: Algebraic reductions of knowledge. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 669\u2013701. Springer, Cham (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_21","DOI":"10.1007\/978-3-031-38551-3_21"},{"key":"10_CR32","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: Recursive zero-knowledge arguments from folding schemes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 359\u2013388. Springer, Cham (Aug 2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Lipmaa, H.: Polymath: Groth16 is not the limit. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 170\u2013206. Springer, Cham (Aug 2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_6","DOI":"10.1007\/978-3-031-68403-6_6"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (Oct1992). https:\/\/doi.org\/10.1145\/146585.146605,","DOI":"10.1145\/146585.146605"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: Shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (Aug 2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-75245-3_9","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"V Lyubashevsky","year":"2021","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Shorter lattice-based zero-knowledge proofs via one-time commitments. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 215\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_9"},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3"},{"issue":"2","key":"10_CR38","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1002\/rsa.20218","volume":"33","author":"J Matou\u0161ek","year":"2008","unstructured":"Matou\u0161ek, J.: On variants of the johnson\u2013lindenstrauss lemma. Random Struct. Algorithms 33(2), 142\u2013156 (2008)","journal-title":"Random Struct. Algorithms"},{"key":"10_CR39","doi-asserted-by":"publisher","unstructured":"Micali, S.: CS proofs (extended abstracts). In: 35th FOCS, pp. 436\u2013453. IEEE Computer Society Press (Nov 1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365746","DOI":"10.1109\/SFCS.1994.365746"},{"key":"10_CR40","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Lattice-based Cryptography, pp. 147\u2013191. Springer Berlin Heidelberg, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"10_CR41","doi-asserted-by":"publisher","unstructured":"Nguyen, N.K., Seiler, G.: Greyhound: fast polynomial commitments from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 243\u2013275. Springer, Cham (Aug 2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_8","DOI":"10.1007\/978-3-031-68403-6_8"},{"key":"10_CR42","doi-asserted-by":"publisher","unstructured":"Szepieniec, A., Zhang, Y.: Polynomial IOPs for linear algebra relations. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC\u00a02022, Part\u00a0I. LNCS, vol. 13177, pp. 523\u2013552. Springer, Cham (Mar 2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_19","DOI":"10.1007\/978-3-030-97121-2_19"},{"key":"10_CR43","doi-asserted-by":"publisher","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: BaseFold: Efficient field-agnostic polynomial commitment schemes from foldable codes. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 138\u2013169. Springer, Cham (Aug 2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_5","DOI":"10.1007\/978-3-031-68403-6_5"}],"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-5099-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T17:49:00Z","timestamp":1770659340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5099-9_10"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550982","9789819550999"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5099-9_10","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"}}]}}