{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:44:37Z","timestamp":1769316277608,"version":"3.49.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031684029","type":"print"},{"value":"9783031684036","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68403-6_8","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T23:02:37Z","timestamp":1723762957000},"page":"243-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Greyhound: Fast Polynomial Commitments from\u00a0Lattices"],"prefix":"10.1007","author":[{"given":"Ngoc Khanh","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Gregor","family":"Seiler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","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: CRYPTO (2), volume 13508 of Lecture Notes in Computer Science, pp. 102\u2013132. Springer (2022)","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"8_CR2","first-page":"1092","volume":"2015","author":"E Alkim","year":"2015","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. IACR Cryptol. ePrint Arch. 2015, 1092 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-031-15802-5_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part I","author":"T Attema","year":"2022","unstructured":"Attema, T., Fehr, S.: Parallel repetition of\u00a0$$(k_1,\\dots ,k_{\\mu })$$-special-sound multi-round interactive proofs. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part I, pp. 415\u2013443. Springer Nature Switzerland, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_15"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-031-22318-1_5","volume-title":"Theory of Cryptography: 20th International Conference, TCC 2022, Chicago, IL, USA, November 7\u201310, 2022, Proceedings, Part I","author":"T Attema","year":"2022","unstructured":"Attema, T., Fehr, S., Kloo\u00df, M.: Fiat-shamir transformation of\u00a0multi-round interactive proofs. In: Kiltz, E., Vaikuntanathan, V. (eds.) Theory of Cryptography: 20th International Conference, TCC 2022, Chicago, IL, USA, November 7\u201310, 2022, Proceedings, Part I, pp. 113\u2013142. Springer Nature Switzerland, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_5"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Fenzi, G., Lapiha, O., Nguyen, N.K.: SLAP: succinct lattice-based polynomial commitments from standard assumptions. To appear at EUROCRYPT 2024 (2024). https:\/\/eprint.iacr.org\/2023\/1469","DOI":"10.1007\/978-3-031-58754-2_4"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: ACM Conference on Computer and Communications Security, pp. 2087\u20132104. ACM (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Attema, T., Lyubashevsky, V., Seiler, G.: Practical product proofs for lattice commitments. In: CRYPTO (2), volume 12171 of Lecture Notes in Computer Science, pp. 470\u2013499. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_17","DOI":"10.1007\/978-3-030-56880-1_17"},{"key":"8_CR8","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. In: ICALP, volume 107 of LIPIcs, pp. 14:1\u201314:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Balb\u00e1s, D., Catalano, D., Fiore, D., Lai, R.W.F.: Chainable functional commitments for unbounded-depth circuits. In: TCC (3), volume 14371 of Lecture Notes in Computer Science, pp. 363\u2013393. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_13","DOI":"10.1007\/978-3-031-48621-0_13"},{"key":"8_CR10","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., editors, Advances in Cryptology - CRYPTO 2023, volume 14082 of Lecture Notes in Computer Science, pp. 227\u2013251. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_8","DOI":"10.1007\/978-3-031-38545-2_8"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-36095-4_17","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"M Backes","year":"2013","unstructured":"Backes, M., Datta, A., Kate, A.: Asynchronous computational VSS with reduced communication complexity. In: Dawson, E. (ed.) Topics in Cryptology \u2013 CT-RSA 2013, pp. 259\u2013276. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36095-4_17"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, 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.) Advances in Cryptology \u2013 EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part I, pp. 677\u2013706. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-84259-8_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part IV","author":"AR Block","year":"2021","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Time- and space-efficient arguments from groups of unknown order. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part IV, pp. 123\u2013152. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-031-31371-4_5","volume-title":"Public-Key Cryptography \u2013 PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7\u201310, 2023, Proceedings, Part II","author":"R Bhadauria","year":"2023","unstructured":"Bhadauria, R., Hazay, C., Venkitasubramaniam, M., Wu, W., Zhang, Y.: Private polynomial commitments and\u00a0applications to\u00a0MPC. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography \u2013 PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7\u201310, 2023, Proceedings, Part II, pp. 127\u2013158. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_5"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Boemer, F., Kim, S., Seifu, G., de\u00a0Souza, F.D.M., Gopal, V.: Intel HEXL: accelerating homomorphic encryption with intel AVX512-IFMA52. In: WAHC@CCS, pp. 57\u201362. WAHC@ACM (2021)","DOI":"10.1145\/3474366.3486926"},{"key":"8_CR16","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: CRYPTO (2), volume 12171 of Lecture Notes in Computer Science, pp. 441\u2013469. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_16","DOI":"10.1007\/978-3-030-56880-1_16"},{"issue":"257","key":"8_CR17","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1090\/S0025-5718-06-01849-7","volume":"76","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J., Sorenson, J.P.: Modular exponentiation via the explicit Chinese remainder theorem. Math. Comput. 76(257), 443\u2013454 (2007)","journal-title":"Math. Comput."},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: compact proofs for R1CS from module-SIS. In CRYPTO (5), volume 14085 of Lecture Notes in Computer Science, pp. 518\u2013548. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Chung, C.-M.M., Hwang, V., Kannwischer, M.J., Seiler, G., Shih, C.-J., Yang, B.-Y.: NTT multiplication for NTT-unfriendly rings new speed records for saber and NTRU on cortex-M4 and AVX2. IACR Trans. Cryptogr. Hardw. Embed. Syst. (2), 159\u2013188 (2021)","DOI":"10.46586\/tches.v2021.i2.159-188"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: Preprocessing zkSNARKs with universal and updatable SRS. In: Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT\u00a0\u201920, pp. 738\u2013768 (2020)","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Cini, V., Lai, R.W.F., Malavolta, G.: Lattice-based succinct arguments from vanishing polynomials. In: Handschuh, H., Lysyanskaya, A., editors, Advances in Cryptology \u2013 CRYPTO 2023, pp. 72\u2013105. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_3","DOI":"10.1007\/978-3-031-38545-2_3"},{"key":"8_CR22","doi-asserted-by":"crossref","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","DOI":"10.1145\/3618260.3649766"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"de\u00a0Castro, L., Peikert, C.: Functional commitments for all functions, with transparent setup and from SIS. In: EUROCRYPT (3), volume 14006 of Lecture Notes in Computer Science, pp. 287\u2013320. Springer (2023)","DOI":"10.1007\/978-3-031-30620-4_10"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Esgin, M.F., Nguyen, N.K., Seiler, G.: Practical exact proofs from lattices: new techniques to exploit fully-splitting rings. In: ASIACRYPT (2), pp. 259\u2013288 (2020)","DOI":"10.1007\/978-3-030-64834-3_9"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Fisch, B., Liu, Z., Vesely, P.: Orbweaver: succinct linear functional commitments from lattices. In: Handschuh, H., Lysyanskaya, A., editors, Advances in Cryptology \u2013 CRYPTO 2023, pp. 106\u2013131. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_4","DOI":"10.1007\/978-3-031-38545-2_4"},{"key":"8_CR26","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"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: CRYPTO, pp. 186\u2013194 (1986)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-031-06944-4_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 \u2013 June 3, 2022, Proceedings, Part I","author":"C Gentry","year":"2022","unstructured":"Gentry, C., Halevi, S., Lyubashevsky, V.: Practical non-interactive publicly verifiable secret sharing with\u00a0thousands of\u00a0parties. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 \u2013 June 3, 2022, Proceedings, Part I, pp. 458\u2013487. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_16"},{"key":"8_CR29","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic SNARKs for R1CS. Cryptology ePrint Archive, Paper 2021\/1043 (2021). https:\/\/eprint.iacr.org\/2021\/1043"},{"key":"8_CR30","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":"8_CR31","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - 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.) Advances in Cryptology - ASIACRYPT 2010, pp. 177\u2013194. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"8_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-90453-1_1","volume-title":"Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8\u201311, 2021, Proceedings, 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.) Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8\u201311, 2021, Proceedings, Part II, pp. 1\u201334. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_1"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-15979-4_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part II","author":"V Lyubashevsky","year":"2022","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and\u00a0applications: shorter, simpler, and\u00a0more general. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part II, pp. 71\u2013101. Springer Nature Switzerland, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3"},{"key":"8_CR34","unstructured":"Libert, B., Ramanna, S.C., Yung, M.: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions. In: ICALP, volume\u00a055 of LIPIcs, pp. 30:1\u201330:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"3","key":"8_CR35","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Crypt."},{"key":"8_CR36","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-319-78381-9_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part I","author":"V Lyubashevsky","year":"2018","unstructured":"Lyubashevsky, V., Seiler, G.: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part I, pp. 204\u2013224. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_8"},{"issue":"3","key":"8_CR37","doi-asserted-by":"publisher","first-page":"180","DOI":"10.46586\/tches.v2019.i3.180-201","volume":"2019","author":"V Lyubashevsky","year":"2019","unstructured":"Lyubashevsky, V., Seiler, G.: NTTRU: truly fast NTRU using NTT. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(3), 180\u2013201 (2019)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge SNARKs from linear-size universal and updateable structured reference strings. Cryptology ePrint Archive, Report 2019\/099 (2019)","DOI":"10.1145\/3319535.3339817"},{"key":"8_CR39","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5"},{"key":"8_CR40","unstructured":"Seiler, G.: Faster AVX2 optimized NTT multiplication for ring-LWE lattice cryptography. IACR Cryptol. ePrint Arch., 39 (2018)"},{"key":"8_CR41","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with lasso. Cryptology ePrint Archive, Paper 2023\/1216 (2023). https:\/\/eprint.iacr.org\/2023\/1216"},{"key":"8_CR42","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-981-99-8733-7_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4\u20138, 2023, Proceedings, Part V","author":"H Wee","year":"2023","unstructured":"Wee, H., Wu, D.J.: Lattice-based functional commitments: fast verification and\u00a0cryptanalysis. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4\u20138, 2023, Proceedings, Part V, pp. 201\u2013235. Springer Nature Singapore, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_7"},{"key":"8_CR43","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-031-30620-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III","author":"Hoeteck Wee","year":"2023","unstructured":"Wee, Hoeteck, Wu, David J..: Succinct vector, polynomial, and\u00a0functional commitments from\u00a0lattices. In: Hazay, Carmit, Stam, Martijn (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III, pp. 385\u2013416. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68403-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T23:05:37Z","timestamp":1723763137000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68403-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031684029","9783031684036"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68403-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","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":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}