{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:00:52Z","timestamp":1783008052070,"version":"3.54.5"},"publisher-location":"Cham","reference-count":47,"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_9","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T23:02:37Z","timestamp":1723762957000},"page":"276-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Field-Agnostic SNARKs from\u00a0Expand-Accumulate Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2632-763X","authenticated-orcid":false,"given":"Alexander R.","family":"Block","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyong","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6084-9303","authenticated-orcid":false,"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Justin","family":"Thaler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9083-5794","authenticated-orcid":false,"given":"Hendrik","family":"Waldner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yupeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: Lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 2087\u20132104. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Haramaty, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. In: Papadimitriou, C.H. (ed.) ITCS 2017, vol.\u00a04266, pp. 7:1\u20137:31. LIPIcs, 67 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.7","DOI":"10.4230\/LIPIcs.ITCS.2017.7"},{"key":"9_CR3","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":"9_CR4","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 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.14","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 701\u2013732. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Carmon, D., Kopparty, S., Levit, D.: Scalable and transparent proofs over all large fields, via elliptic curves - (ECFFT part II). In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0I. LNCS, vol. 13747, pp. 467\u2013496. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_17","DOI":"10.1007\/978-3-031-22318-1_17"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Carmon, D., Kopparty, S., Levit, D.: Elliptic curve fast fourier transform (ECFFT) Part I: low-degree extension in time O(n log n) over all finite fields. In: SODA, pp. 700\u2013737. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch30"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"9_CR9","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von Neumann architecture. In: Proceedings of the USENIX Security Symposium (2014)"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: Vidick, T. (ed.) ITCS 2020, vol.\u00a0151, pp. 5:1\u20135:32. LIPIcs (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.5","DOI":"10.4230\/LIPIcs.ITCS.2020.5"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-030-64378-2_7","volume-title":"Theory of Cryptography","author":"AR Block","year":"2020","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Public-Coin zero-knowledge arguments with (almost) minimal time and space overheads. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 168\u2013197. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_7"},{"key":"9_CR12","doi-asserted-by":"publisher","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.) Crypto\u00a02021, Part\u00a0IV. LNCS, vol. 12828, pp. 123\u2013152. Springer, Heidelberg, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"9_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":"9_CR14","doi-asserted-by":"publisher","unstructured":"Bootle, J., Cerulli, A., Ghadafi, E., Groth, J., Hajiabadi, M., Jakobsen, S.K.: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In: Takagi, T., Peyrin, T. (eds.) Asiacrypt\u00a02017, Part\u00a0III. LNCS, vol. 10626, pp. 336\u2013365. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_12","DOI":"10.1007\/978-3-319-70700-6_12"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-030-64378-2_2","volume-title":"Theory of Cryptography","author":"J Bootle","year":"2020","unstructured":"Bootle, J., Chiesa, A., Groth, J.: Linear-time arguments with sublinear verification from tensor codes. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 19\u201346. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_2"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Bootle, J., Chiesa, A., Liu, S.: Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier. In: Dunkelman, O., Dziembowski, S. (eds.) Eurocrypt\u00a02022, Part\u00a0II. LNCS, vol. 13276, pp. 275\u2013304. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_10","DOI":"10.1007\/978-3-031-07085-3_10"},{"key":"9_CR17","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 (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_8","DOI":"10.1007\/978-3-031-38545-2_8"},{"key":"9_CR18","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":"9_CR19","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N., Scholl, P.: Correlated pseudorandomness from expand-accumulate codes. In: Dodis, Y., Shrimpton, T. (eds.) Crypto\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 603\u2013633. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_21","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"9_CR20","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 (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","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. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"9_CR22","unstructured":"Buterin, V.: An incomplete guide to rollups. https:\/\/vitalik.eth.limo\/general\/2021\/01\/05\/rollup.html"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Diamond, B.E., Posen, J.: Proximity testing with logarithmic randomness. IACR Communications in Cryptology 1(1) (2024). https:\/\/doi.org\/10.62056\/aksdkp10","DOI":"10.62056\/aksdkp10"},{"key":"9_CR24","unstructured":"Divsalar, D., Jin, H., McEliece, R.J.: Coding theorems for \u201cturbo-like\u201d codes. In: Proceedings of the Annual Allerton Conference on Communication Control and Computing, vol.\u00a036, pp. 201\u2013210 (1998)"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Druk, E., Ishai, Y.: Linear-time encodable codes meeting the Gilbert-Varshamov bound and their cryptographic applications. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, pp. 169-182. ACM (2014). https:\/\/doi.org\/10.1145\/2554797.2554815","DOI":"10.1145\/2554797.2554815"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","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). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"9_CR27","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), https:\/\/eprint.iacr.org\/2019\/953"},{"key":"9_CR28","doi-asserted-by":"publisher","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\u00a02023, Part\u00a0II. LNCS, vol. 14082, pp. 193\u2013226. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"9_CR29","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":"9_CR30","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Machmouchi, W.: Explicit interleavers for a repeat accumulate accumulate (RAA) code construction. In: ISIT, pp. 1968\u20131972. IEEE (2008)","DOI":"10.1109\/ISIT.2008.4595333"},{"key":"9_CR31","unstructured":"Hab\u00f6ck, U.: Brakedown\u2019s expander code. Cryptology ePrint Archive (2023)"},{"issue":"4","key":"9_CR32","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"key":"9_CR33","unstructured":"scipr lab: libiop (2023). https:\/\/github.com\/scipr-lab\/libiop"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"9_CR35","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/SP.2013.47","DOI":"10.1109\/SP.2013.47"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-convolute codes for pseudorandom correlation generators from LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) Crypto\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 602\u2013632. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_19","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) Crypto\u00a02020, Part\u00a0III. LNCS, vol. 12172, pp. 704\u2013737. Springer, Heidelberg (Aug 2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25","DOI":"10.1007\/978-3-030-56877-1_25"},{"issue":"6","key":"9_CR38","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"DA Spielman","year":"1996","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory 42(6), 1723\u20131731 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR39","unstructured":"Sun, Y.: circom-ecdsa (2024). https:\/\/github.com\/0xPARC\/circom-ecdsa"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Proofs, arguments, and zero-knowledge. Found. Trends Priv. Secur. 4(2-4), 117\u2013660 (2022). https:\/\/people.cs.georgetown.edu\/jthaler\/ProofsArgsAndZK.html","DOI":"10.1561\/3300000030"},{"key":"9_CR41","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/SP.2018.00060","DOI":"10.1109\/SP.2018.00060"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Xie, T., et al.: zkBridge: trustless cross-chain bridges made practical. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 3003\u20133017. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560652","DOI":"10.1145\/3548606.3560652"},{"key":"9_CR43","doi-asserted-by":"publisher","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\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 733\u2013764. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: Zero knowledge proof with linear prover time. In: Dodis, Y., Shrimpton, T. (eds.) Crypto\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 299\u2013328. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_11","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-68403-6_5"},{"key":"9_CR46","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/SP40000.2020.00052","DOI":"10.1109\/SP40000.2020.00052"},{"key":"9_CR47","unstructured":"Zhang, Y., Genkin, D., Katz, J., Papadopoulos, D., Papamanthou, C.: A zero-knowledge version of vSQL. Cryptology ePrint Archive, Report 2017\/1146 (2017). https:\/\/eprint.iacr.org\/2017\/1146"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:26:12Z","timestamp":1732649172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68403-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031684029","9783031684036"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68403-6_9","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"}}]}}