{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:38:08Z","timestamp":1770741488458,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819609345","type":"print"},{"value":"9789819609352","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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-981-96-0935-2_7","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:01:22Z","timestamp":1733680882000},"page":"203-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["RoK, Paper, SISsors Toolkit for\u00a0Lattice-Based Succinct 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":[[2024,12,9]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, G., Thyagarajan, S.A.K.: Lattice-based SNARKs: Publicly verifiable, preprocessing, and recursively composable - (extended abstract). In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 102\u2013132. Springer, Heidelberg (Aug 2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_4","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"7_CR2","unstructured":"Albrecht, M.R., Fenzi, G., Lapiha, O., Nguyen, N.K.: Slap: Succinct lattice-based polynomial commitments from standard assumptions. Cryptology ePrint Archive, Paper 2023\/1469 (2023), https:\/\/eprint.iacr.org\/2023\/1469, https:\/\/eprint.iacr.org\/2023\/1469"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Lai, R.W.F.: Subtractive sets over cyclotomic rings - limits of Schnorr-like arguments over lattices. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0II. LNCS, vol. 12826, pp. 519\u2013548. Springer, Heidelberg, Virtual Event (Aug 2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_18","DOI":"10.1007\/978-3-030-84245-1_18"},{"key":"7_CR4","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"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TIT.2004.825045","volume":"50","author":"E Bayer-Fluckiger","year":"2004","unstructured":"Bayer-Fluckiger, E., Oggier, F., Viterbo, E.: New algebraic constructions of rotated z\/sup n\/-lattice constellations for the rayleigh fading channel. IEEE Transactions on Information Theory 50(4), 702\u2013714 (2004). https:\/\/doi.org\/10.1109\/TIT.2004.825045","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. Cryptology ePrint Archive, Report 2015\/1128 (2015), https:\/\/eprint.iacr.org\/2015\/1128","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"7_CR7","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, Heidelberg (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"7_CR8","unstructured":"Boneh, D., Chen, B.: Latticefold: A lattice-based folding scheme and its applications to succinct proof systems. Cryptology ePrint Archive, Paper 2024\/257 (2024), https:\/\/eprint.iacr.org\/2024\/257, https:\/\/eprint.iacr.org\/2024\/257"},{"key":"7_CR9","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, Heidelberg (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_8","DOI":"10.1007\/978-3-031-38545-2_8"},{"key":"7_CR10","doi-asserted-by":"publisher","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\u00a02020, Part\u00a0II. LNCS, vol. 12171, pp. 441\u2013469. Springer, Heidelberg (Aug 2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_16","DOI":"10.1007\/978-3-030-56880-1_16"},{"key":"7_CR11","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, Heidelberg (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_3","DOI":"10.1007\/978-3-031-38545-2_3"},{"key":"7_CR12","unstructured":"Cini, V., Malavolta, G., Nguyen, N.K., Wee, H.: Polynomial commitments from lattices: Post-quantum security, fast verification and transparent setup. Cryptology ePrint Archive, Paper 2024\/281 (2024), https:\/\/eprint.iacr.org\/2024\/281, https:\/\/eprint.iacr.org\/2024\/281"},{"key":"7_CR13","unstructured":"Debris-Alazard, T., Fallahpour, P., Stehl\u00e9, D.: Quantum oblivious lwe sampling and insecurity of standard model lattice-based snarks. Cryptology ePrint Archive, Paper 2024\/030 (2024), https:\/\/eprint.iacr.org\/2024\/030, https:\/\/eprint.iacr.org\/2024\/030"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: Crystals-dilithium: A lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems 2018(1), 238-268 (Feb 2018). https:\/\/doi.org\/10.13154\/tches.v2018.i1.238-268, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/839","DOI":"10.13154\/tches.v2018.i1.238-268"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Esgin, M.F., Kuchta, V., Sakzad, A., Steinfeld, R., Zhang, Z., Sun, S., Chu, S.: Practical post-quantum few-time verifiable random function with applications to algorand. In: Borisov, N., D\u00edaz, C. (eds.) FC 2021, Part\u00a0II. LNCS, vol. 12675, pp. 560\u2013578. Springer, Heidelberg (Mar 2021). https:\/\/doi.org\/10.1007\/978-3-662-64331-0_29","DOI":"10.1007\/978-3-662-64331-0_29"},{"key":"7_CR16","unstructured":"Fenzi, G., Moghaddas, H., Nguyen, N.K.: Lattice-based polynomial commitments: Towards asymptotic and concrete efficiency. Cryptology ePrint Archive, Paper 2023\/846 (2023), https:\/\/eprint.iacr.org\/2023\/846, https:\/\/eprint.iacr.org\/2023\/846"},{"key":"7_CR17","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, Heidelberg (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":"7_CR18","doi-asserted-by":"publisher","unstructured":"Hoffmann, M., Kloo\u00df, M., Rupp, A.: Efficient zero-knowledge arguments in the discrete log setting, revisited. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019. pp. 2093\u20132110. ACM Press (Nov 2019). https:\/\/doi.org\/10.1145\/3319535.3354251","DOI":"10.1145\/3319535.3354251"},{"key":"7_CR19","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, Heidelberg (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_21","DOI":"10.1007\/978-3-031-38551-3_21"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Lai, R.W.F., Malavolta, G.: Lattice-based timed cryptography. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 782\u2013804. Springer, Heidelberg (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_25","DOI":"10.1007\/978-3-031-38554-4_25"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Lenstra, H.W.: Euclidean number fields of large degree. Inventiones mathematicae 38(3), 237\u2013254 (1976). https:\/\/doi.org\/10.1007\/BF01403131, https:\/\/doi.org\/10.1007\/BF01403131","DOI":"10.1007\/BF01403131 10.1007\/BF01403131"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 738\u2013755. Springer, Heidelberg (Apr 2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Neven, G.: One-shot verifiable encryption from lattices. In: Coron, J.S., Nielsen, J.B. (eds.) EUROCRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10210, pp. 293\u2013323. Springer, Heidelberg (Apr\u00a0\/\u00a0May 2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_11","DOI":"10.1007\/978-3-319-56620-7_11"},{"key":"7_CR24","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, Heidelberg (Aug 2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Practical lattice-based zero-knowledge proofs for integer relations. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020. pp. 1051\u20131070. ACM Press (Nov 2020). https:\/\/doi.org\/10.1145\/3372297.3417894","DOI":"10.1145\/3372297.3417894"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Shorter lattice-based zero-knowledge proofs via one-time commitments. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710, pp. 215\u2013241. Springer, Heidelberg (May 2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_9","DOI":"10.1007\/978-3-030-75245-3_9"},{"key":"7_CR27","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, https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Papamanthou, C., Shi, E., Tamassia, R., Yi, K.: Streaming authenticated data structures. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT\u00a02013. LNCS, vol.\u00a07881, pp. 353\u2013370. Springer, Heidelberg (May 2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_22","DOI":"10.1007\/978-3-642-38348-9_22"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Lattice-based functional commitments: Fast verification and cryptanalysis. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14442, pp. 201\u2013235. Springer, Heidelberg (Dec 2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_7","DOI":"10.1007\/978-981-99-8733-7_7"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0935-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:02:20Z","timestamp":1733680940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0935-2_7"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609345","9789819609352"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0935-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}