{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T20:10:01Z","timestamp":1779480601710,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":83,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T00:00:00Z","timestamp":1780185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"EU","award":["101190366"],"award-info":[{"award-number":["101190366"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1145\/3803627.3805818","type":"proceedings-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T19:58:52Z","timestamp":1779479932000},"page":"31-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SoK: PIOP-based SNARKs for General Computation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5373-9904","authenticated-orcid":false,"given":"Yonghui","family":"Guan","sequence":"first","affiliation":[{"name":"grchain.io, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7009-4071","authenticated-orcid":false,"given":"Rihe","family":"Zhang","sequence":"additional","affiliation":[{"name":"grchain.io, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6591-3711","authenticated-orcid":false,"given":"Bin","family":"Liu","sequence":"additional","affiliation":[{"name":"Network and Information Security Group, Tampere University, Tampere, Finland and grchain.io, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9840-3112","authenticated-orcid":false,"given":"Tianyu","family":"Zhao","sequence":"additional","affiliation":[{"name":"grchain.io, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7325-125X","authenticated-orcid":false,"given":"Jialu","family":"Hao","sequence":"additional","affiliation":[{"name":"Individual researcher, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0189-3520","authenticated-orcid":false,"given":"Antonis","family":"Michalas","sequence":"additional","affiliation":[{"name":"Network and Information Security Group, Tampere University, Tampere, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Aleo https:\/\/zkresear.ch\/t\/towards-a-nova-based-zk-vm\/105"},{"key":"e_1_3_2_1_2_1","unstructured":"Aztec https:\/\/aztec.network"},{"key":"e_1_3_2_1_3_1","unstructured":"Introducing zkevm https:\/\/scroll.io\/blog\/zkEVM"},{"key":"e_1_3_2_1_4_1","unstructured":"NilFoundation https:\/\/github.com\/NilFoundation\/zkLLVM"},{"key":"e_1_3_2_1_5_1","unstructured":"Polygon https:\/\/polygon.technology"},{"key":"e_1_3_2_1_6_1","unstructured":"RISC Zero https:\/\/github.com\/risc0\/risc0\/"},{"key":"e_1_3_2_1_7_1","unstructured":"Starkware https:\/\/starkware.co"},{"key":"e_1_3_2_1_8_1","unstructured":"Zksync https:\/\/zksync.io"},{"key":"e_1_3_2_1_9_1","volume-title":"Yogev","author":"Arnon G.","year":"2024","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: STIR: reed-solomon proximity testing with fewer queries. In: CRYPTO. Santa Barbara, CA, USA (August 2024)"},{"key":"e_1_3_2_1_10_1","volume-title":"Yogev","author":"Arnon G.","year":"2024","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: WHIR: reed-solomon proximity testing with super-fast verification. IACR Cryptol. ePrint Arch. p. 1586 (2024)"},{"issue":"3","key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"Arora S.","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. JACM 45(3), 501\u2013555 (1998)","journal-title":"JACM"},{"key":"e_1_3_2_1_12_1","volume-title":"Safra","author":"Arora S.","year":"1992","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. In: FOCS. Pittsburgh, PA, USA (October 1992)"},{"key":"e_1_3_2_1_13_1","first-page":"419","volume":"202","author":"Arun A.","year":"2022","unstructured":"Arun, A., Ganesh, C., Lokam, S., Mopuri, T., Sridhar, S.: Dew: Transparent constant-sized zkSNARKs. Cryptology ePrint Archive, Paper 2022\/419 (2022), https:\/\/eprint.iacr.org\/2022\/419","journal-title":"Paper"},{"key":"e_1_3_2_1_14_1","first-page":"2025","volume":"202","author":"Beal J.","year":"2024","unstructured":"Beal, J., Fisch, B.: Mira: Efficient folding for pairing-based arguments. Cryptology ePrint Archive, Paper 2024\/2025 (2024), https:\/\/eprint.iacr.org\/2024\/2025","journal-title":"Paper"},{"key":"e_1_3_2_1_15_1","volume-title":"Riabzev","author":"Ben-Sasson E.","year":"2018","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. In: ICALP. Prague, Czech Republic (July 2018)"},{"key":"e_1_3_2_1_16_1","first-page":"046","volume":"201","author":"Ben-Sasson E.","year":"2018","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Paper 2018\/046 (2018), https:\/\/eprint.iacr.org\/2018\/046","journal-title":"Paper"},{"key":"e_1_3_2_1_17_1","volume-title":"IEEE Symposium on Security and Privacy","author":"Ben Sasson E.","year":"2014","unstructured":"Ben Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., Virza, M.: Zerocash: Decentralized anonymous payments from Bitcoin. In: IEEE Symposium on Security and Privacy. Berkeley, California, USA (May 2014)"},{"key":"e_1_3_2_1_18_1","volume-title":"Spooner","author":"Ben-Sasson E.","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: TCC. Beijing, China (November 2016)"},{"key":"e_1_3_2_1_19_1","volume-title":"Gabizon","author":"Boneh D.","year":"2021","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: Proof-carrying data from additive polynomial commitments. In: CRYPTO. Virtual Event (August 2021)"},{"key":"e_1_3_2_1_20_1","volume-title":"Petit","author":"Bootle J.","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: EUROCRYPT. Vienna, Austria (May 2016)"},{"key":"e_1_3_2_1_21_1","volume-title":"Maller","author":"Bootle J.","year":"2018","unstructured":"Bootle, J., Cerulli, A., Groth, J., Jakobsen, S.K., Maller, M.: Arya: Nearly linear-time zero-knowledge proofs for correct program execution. In: ASIACRYPT. Brisbane, QLD, Australia (December 2018)"},{"key":"e_1_3_2_1_22_1","volume-title":"IEEE Symposium on Security and Privacy","author":"Bowe S.","year":"2020","unstructured":"Bowe, S., Chiesa, A., Green, M., Miers, I., Mishra, P., Wu, H.: ZEXE: enabling decentralized private computation. In: IEEE Symposium on Security and Privacy. San Francisco, CA, USA (May 2020)"},{"key":"e_1_3_2_1_23_1","first-page":"1021","volume":"201","author":"Bowe S.","year":"2019","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Recursive proof composition without a trusted setup. Cryptology ePrint Archive, Paper 2019\/1021 (2019), https:\/\/eprint.iacr.org\/2019\/1021","journal-title":"Paper"},{"key":"e_1_3_2_1_24_1","volume-title":"IEEE Symposium on Security and Privacy","author":"B\u00fcnz B.","year":"2018","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: Short proofs for confidential transactions and more. In: IEEE Symposium on Security and Privacy. San Francisco, CA, USA (May 2018)"},{"key":"e_1_3_2_1_25_1","volume-title":"Chen","author":"B\u00fcnz B.","year":"2023","unstructured":"B\u00fcnz, B., Chen, B.: Protostar: Generic efficient accumulation\/folding for specialsound protocols. In: ASIACRYPT. Guangzhou, China (December 2023)"},{"key":"e_1_3_2_1_26_1","volume-title":"Spooner","author":"B\u00fcnz B.","year":"2021","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: Proof-carrying data without succinct arguments. In: CRYPTO. Virtual Event (August 2021)"},{"key":"e_1_3_2_1_27_1","volume-title":"Spooner","author":"B\u00fcnz B.","year":"2020","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Recursive proof composition from accumulation schemes. In: TCC. Durham, NC, USA (December 2020)"},{"key":"e_1_3_2_1_28_1","volume-title":"Szepieniec","author":"B\u00fcnz B.","year":"2020","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: EUROCRYPT. Zagreb, Croatia (May 2020)"},{"key":"e_1_3_2_1_29_1","volume-title":"Vesely","author":"B\u00fcnz B.","year":"2021","unstructured":"B\u00fcnz, B., Maller, M., Mishra, P., Tyagi, N., Vesely, P.: Proofs for inner pairing products and applications. In: ASIACRYPT. Singapore (December 2021)"},{"key":"e_1_3_2_1_30_1","volume-title":"Chen","author":"B\u00fcnz B.","year":"2024","unstructured":"B\u00fcnz, B., Chen, J.: Proofs for deep thought: Accumulation for large memories and deterministic computations. In: ASIACRYPT. Kolkata, India (December 2024)"},{"key":"e_1_3_2_1_31_1","first-page":"1731","volume":"202","author":"B\u00fcnz B.","year":"2024","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Arc: Accumulation for reed-solomon codes. Cryptology ePrint Archive, Paper 2024\/1731 (2024), https:\/\/eprint.iacr.org\/2024\/1731","journal-title":"Paper"},{"key":"e_1_3_2_1_32_1","volume-title":"Wang","author":"B\u00fcnz B.","year":"2025","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Accumulation without homomor-phism. In: ITCS. New York, NY, USA (January 2025)"},{"key":"e_1_3_2_1_33_1","volume-title":"Zhang","author":"Chen B.","year":"2022","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: Hyperplonk: Plonk with linear-time prover and high-degree custom gates. In: EUROCRYPT. Lyon, France (April 2022)"},{"key":"e_1_3_2_1_34_1","volume-title":"Ward","author":"Chiesa A.","year":"2020","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, P., Ward, N.P.: Marlin: Preprocessing zkSNARKs with universal and updatable SRS. In: EUROCRYPT. Zagreb, Croatia (May 2020)"},{"key":"e_1_3_2_1_35_1","first-page":"1784","volume":"202","author":"Diamond B.E.","year":"2023","unstructured":"Diamond, B.E., Posen, J.: Succinct arguments over towers of binary fields. Cryptology ePrint Archive, Paper 2023\/1784 (2023), https:\/\/eprint.iacr.org\/2023\/1784","journal-title":"Paper"},{"key":"e_1_3_2_1_36_1","first-page":"1220","volume":"202","author":"Dimitriou N.","year":"2024","unstructured":"Dimitriou, N., Garreta, A., Manzur, I., Vlasov, I.: Mova: Nova folding without committing to error terms. Cryptology ePrint Archive, Paper 2024\/1220 (2024), https:\/\/eprint.iacr.org\/2024\/1220","journal-title":"Paper"},{"key":"e_1_3_2_1_37_1","first-page":"1763","volume":"202","author":"Eagen L.","year":"2022","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: cq: Cached quotients for fast lookups. Cryptology ePrint Archive, Paper 2022\/1763 (2022), https:\/\/eprint.iacr.org\/2022\/1763","journal-title":"Paper"},{"key":"e_1_3_2_1_38_1","first-page":"1106","volume":"202","author":"Eagen L.","year":"2023","unstructured":"Eagen, L., Gabizon, A.: ProtoGalaxy: Efficient ProtoStar-style folding of multiple instances. Cryptology ePrint Archive, Paper 2023\/1106 (2023), https:\/\/eprint.iacr.org\/2023\/1106","journal-title":"Paper"},{"key":"e_1_3_2_1_39_1","first-page":"1447","volume":"202","author":"Gabizon A.","year":"2022","unstructured":"Gabizon, A., Khovratovich, D.: flookup: Fractional decomposition-based lookups in quasi-linear time independent of table size. Cryptology ePrint Archive, Paper 2022\/1447 (2022), https:\/\/eprint.iacr.org\/2022\/1447","journal-title":"Paper"},{"key":"e_1_3_2_1_40_1","first-page":"315","volume":"202","author":"Gabizon A.","year":"2020","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: A simplified polynomial protocol for lookup tables. Cryptology ePrint Archive, Paper 2020\/315 (2020), https:\/\/eprint.iacr.org\/2020\/315","journal-title":"Paper"},{"key":"e_1_3_2_1_41_1","first-page":"953","volume":"201","author":"Gabizon A.","year":"2019","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Paper 2019\/953 (2019), https:\/\/eprint.iacr.org\/2019\/953","journal-title":"Paper"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3422798"},{"key":"e_1_3_2_1_43_1","volume-title":"Manzur","author":"Garreta A.","year":"2024","unstructured":"Garreta, A., Manzur, I.: FLI: folding lookup instances. In: ASIACRYPT. Kolkata, India (December 2024)"},{"key":"e_1_3_2_1_44_1","volume-title":"Raykova","author":"Gennaro R.","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: EUROCRYPT. Athens, Greece (May 2013)"},{"key":"e_1_3_2_1_45_1","volume-title":"Riabzev","author":"Goldberg L.","year":"2021","unstructured":"Goldberg, L., Papini, S., Riabzev, M.: Cairo - a turing-complete stark-friendly CPU architecture. IACR Cryptol. ePrint Arch. p. 1063 (2021), https:\/\/eprint.iacr.org\/2021\/1063"},{"key":"e_1_3_2_1_46_1","volume-title":"Rackoff","author":"Goldwasser S.","year":"1985","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC. Providence, Rhode Island, USA (May 1985)"},{"key":"e_1_3_2_1_47_1","volume-title":"Wahby","author":"Golovnev A.","year":"2021","unstructured":"Golovnev, A., Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Brakedown: Linear-time and post-quantum snarks for R1CS. IACR Cryptol. ePrint Arch. p. 1043 (2021)"},{"key":"e_1_3_2_1_48_1","volume-title":"EURO-CRYPT.","author":"Groth J.","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: EURO-CRYPT. Vienna, Austria (May 2016)"},{"key":"e_1_3_2_1_49_1","first-page":"1530","volume":"202","author":"Hab\u00f6ck U.","year":"2022","unstructured":"Hab\u00f6ck, U.: Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive, Paper 2022\/1530 (2022), https:\/\/eprint.iacr.org\/2022\/1530","journal-title":"Paper"},{"key":"e_1_3_2_1_50_1","first-page":"1164","volume":"202","author":"den Hollander T.","year":"2024","unstructured":"den Hollander, T., Slamanig, D.: A crack in the firmament: Restoring soundness of the orion proof system and more. Cryptology ePrint Archive, Paper 2024\/1164 (2024), https:\/\/eprint.iacr.org\/2024\/1164","journal-title":"Paper"},{"key":"e_1_3_2_1_51_1","volume-title":"Goldberg","author":"Kate A.","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: ASIACRYPT. Singapore (December 2010)"},{"key":"e_1_3_2_1_52_1","volume-title":"Parno","author":"Kothapalli A.","year":"2023","unstructured":"Kothapalli, A., Parno, B.: Algebraic reductions of knowledge. In: CRYPTO. Santa Barbara, CA, USA (August 2023)"},{"key":"e_1_3_2_1_53_1","first-page":"1758","volume":"202","author":"Kothapalli A.","year":"2022","unstructured":"Kothapalli, A., Setty, S.: SuperNova: Proving universal machine executions without universal circuits. Cryptology ePrint Archive, Paper 2022\/1758 (2022), https:\/\/eprint.iacr.org\/2022\/1758","journal-title":"Paper"},{"key":"e_1_3_2_1_54_1","volume-title":"Setty","author":"Kothapalli A.","year":"2024","unstructured":"Kothapalli, A., Setty, S.: Hypernova: Recursive arguments for customizable constraint systems. In: CRYPTO. Santa Barbara, CA, USA (August 2024)"},{"key":"e_1_3_2_1_55_1","first-page":"1606","volume":"202","author":"Kothapalli A.","year":"2024","unstructured":"Kothapalli, A., Setty, S.: NeutronNova: Folding everything that reduces to zerocheck. Cryptology ePrint Archive, Paper 2024\/1606 (2024), https:\/\/eprint.iacr.org\/2024\/1606","journal-title":"Paper"},{"key":"e_1_3_2_1_56_1","volume-title":"Tzialla","author":"Kothapalli A.","year":"2022","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: Recursive zero-knowledge arguments from folding schemes. In: CRYPTO. Santa Barbara, CA, USA (August 2022)"},{"key":"e_1_3_2_1_57_1","volume-title":"TCC.","author":"Lee J.","year":"2021","unstructured":"Lee, J.: Dory: Efficient, transparent arguments for generalised inner products and polynomial commitments. In: TCC. Raleigh, NC, USA (November 2021)"},{"key":"e_1_3_2_1_58_1","volume-title":"Wu","author":"Liang J.","year":"2025","unstructured":"Liang, J., Hu, D., Wu, P., Yang, Y., Shen, Q., Wu, Z.: SoK: Understanding zk-SNARKs: The gap between research and practice. In: USENIX Security. Seattle, WA, USA (August 2025)"},{"key":"e_1_3_2_1_59_1","volume-title":"Meiklejohn","author":"Maller M.","year":"2019","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: ACM CCS. London, UK (November 2019)"},{"key":"e_1_3_2_1_60_1","unstructured":"Mohnblatt N.: Sangria: a folding scheme for plonk https:\/\/geometry.xyz\/notebook\/sangria-a-folding-scheme-for-plonk"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.36227\/techrxiv.19374986.v1"},{"key":"e_1_3_2_1_62_1","volume-title":"zk-SNARKs: A gentle introduction","author":"Nitulescu A.","year":"2020","unstructured":"Nitulescu, A.: zk-SNARKs: A gentle introduction (2020), https:\/\/www.di.ens.fr\/~nitulesc\/files\/Survey-SNARKs.pdf"},{"key":"e_1_3_2_1_63_1","first-page":"1364","volume":"202","author":"Nitulescu A.","year":"2024","unstructured":"Nitulescu, A., Paslis, N., R\u00e0fols, C.: FLIP-and-prove R1CS. Cryptology ePrint Archive, Paper 2024\/1364 (2024), https:\/\/eprint.iacr.org\/2024\/1364","journal-title":"Paper"},{"key":"e_1_3_2_1_64_1","volume-title":"Tamassia","author":"Papamanthou C.","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: TCC. Tokyo, Japan (March 2013)"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3046025"},{"key":"e_1_3_2_1_66_1","unstructured":"PolygonLabs: Polygon zkevm https:\/\/wiki.polygon.technology\/docs\/zkevm\/"},{"key":"e_1_3_2_1_67_1","first-page":"957","volume":"202","author":"Posen J.","year":"2022","unstructured":"Posen, J., Kattis, A.A.: Caulk+: Table-independent lookup arguments. Cryptology ePrint Archive, Paper 2022\/957 (2022), https:\/\/eprint.iacr.org\/2022\/957","journal-title":"Paper"},{"issue":"4","key":"e_1_3_2_1_68_1","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"Schwartz J.T.","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. JACM 27(4), 701\u2013717 (1980)","journal-title":"JACM"},{"key":"e_1_3_2_1_69_1","volume-title":"CRYPTO.","author":"Setty S.","year":"2020","unstructured":"Setty, S.: Spartan: Efficient and general-purpose zkSNARKs without trusted setup. In: CRYPTO. Santa Barbara, CA, USA (August 2020)"},{"key":"e_1_3_2_1_70_1","first-page":"1799","volume":"202","author":"Setty S.","year":"2023","unstructured":"Setty, S., Thaler, J.: BabySpartan: Lasso-based SNARK for non-uniform computation. Cryptology ePrint Archive, Paper 2023\/1799 (2023), https:\/\/eprint.iacr.org\/ 2023\/1799","journal-title":"Paper"},{"key":"e_1_3_2_1_71_1","first-page":"552","volume":"202","author":"Setty S.","year":"2023","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive, Paper 2023\/552 (2023), https:\/\/eprint.iacr.org\/2023\/552","journal-title":"Paper"},{"key":"e_1_3_2_1_72_1","volume-title":"Wahby","author":"Setty S.","year":"2024","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with Lasso. In: EUROCRYPT. Zurich, Switzerland (May 2024)"},{"key":"e_1_3_2_1_73_1","unstructured":"Thaler J.: Proofs arguments and zero-knowledge https:\/\/people.cs.georgetown.edu\/jthaler\/ProofsArgsAndZK.pdf"},{"key":"e_1_3_2_1_74_1","series-title":"August 2022","volume-title":"Snark design, part I. https:\/\/www.youtube.com\/watch?v=tg6lKPdR_e4","author":"Thaler J.","unstructured":"Thaler, J.: Snark design, part I. https:\/\/www.youtube.com\/watch?v=tg6lKPdR_e4 (August 2022)"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_1_76_1","unstructured":"Whitehat B.: Lookup singularity https:\/\/zkresear.ch\/t\/lookup-singularity\/65\/7"},{"key":"e_1_3_2_1_77_1","volume-title":"Song","author":"Xie T.","year":"2022","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: Zero knowledge proof with linear prover time. In: CRYPTO. Santa Barbara, CA, USA (August 2022)"},{"key":"e_1_3_2_1_78_1","volume-title":"Simkin","author":"Zapico A.","unstructured":"Zapico, A., Buterin, V., Khovratovich, D., Maller, M., Nitulescu, A., Simkin, M.: Caulk: Lookup arguments in sublinear time. In: ACM CCS. Los Angeles, CA, USA (November 22)"},{"key":"e_1_3_2_1_79_1","first-page":"1565","volume":"202","author":"Zapico A.","year":"2022","unstructured":"Zapico, A., Gabizon, A., Khovratovich, D., Maller, M., R\u00e0fols, C.: Baloo: Nearly optimal lookup arguments. Cryptology ePrint Archive, Paper 2022\/1565 (2022), https:\/\/eprint.iacr.org\/2022\/1565","journal-title":"Paper"},{"key":"e_1_3_2_1_80_1","volume-title":"Fisch","author":"Zeilberger H.","year":"2024","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: Basefold: Efficient field-agnostic polynomial commitment schemes from foldable codes. In: CRYPTO. Santa Barbara, CA, USA (August 2024)"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"},{"key":"e_1_3_2_1_82_1","first-page":"1579","volume":"202","author":"Zheng T.","year":"2023","unstructured":"Zheng, T., Gao, S., Guo, Y., Xiao, B.: KiloNova: Non-uniform PCD with zero-knowledge property from generic folding schemes. Cryptology ePrint Archive, Paper 2023\/1579 (2023), https:\/\/eprint.iacr.org\/2023\/1579","journal-title":"Paper"},{"key":"e_1_3_2_1_83_1","volume-title":"International symposium on symbolic and algebraic manipulation. Marseille, France (June 1979)","author":"Zippel R.","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: International symposium on symbolic and algebraic manipulation. Marseille, France (June 1979)"}],"event":{"name":"ASIA CCS '26: ACM Asia Conference on Computer and Communications Security","location":"Bangalore India","acronym":"APKC '26","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the ACM ASIA Public-Key Cryptography Workshop"],"original-title":[],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T19:59:03Z","timestamp":1779479943000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3803627.3805818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,31]]},"references-count":83,"alternative-id":["10.1145\/3803627.3805818","10.1145\/3803627"],"URL":"https:\/\/doi.org\/10.1145\/3803627.3805818","relation":{},"subject":[],"published":{"date-parts":[[2026,5,31]]},"assertion":[{"value":"2026-05-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}