{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:02:01Z","timestamp":1771488121112,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560686","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"1323-1335","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Reinforced Concrete"],"prefix":"10.1145","author":[{"given":"Lorenzo","family":"Grassi","sequence":"first","affiliation":[{"name":"Radboud University, Nijmegen, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Khovratovich","sequence":"additional","affiliation":[{"name":"Dusk Network, Luxembourg, Luxembourg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"L\u00fcftenegger","sequence":"additional","affiliation":[{"name":"Graz University of Technology, Graz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Rechberger","sequence":"additional","affiliation":[{"name":"Graz University of Technology, Graz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Schofnegger","sequence":"additional","affiliation":[{"name":"Graz University of Technology, Graz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Walch","sequence":"additional","affiliation":[{"name":"Graz University of Technology & Know-Center GmbH, Graz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Hash functions for Zero-Knowledge applications Zoo. https:\/\/extgit.iaik. tugraz.at\/krypto\/zkfriendlyhashzoo. IAIK","unstructured":"2021. Hash functions for Zero-Knowledge applications Zoo. https:\/\/extgit.iaik. tugraz.at\/krypto\/zkfriendlyhashzoo. IAIK , Graz University of Technology . 2021. Hash functions for Zero-Knowledge applications Zoo. https:\/\/extgit.iaik. tugraz.at\/krypto\/zkfriendlyhashzoo. IAIK, Graz University of Technology."},{"key":"e_1_3_2_1_2_1","unstructured":"2021. Tornado Cash Privacy Solution Version 1.4. https:\/\/tornado.cash\/Tornado. cash_whitepaper_v1.4.pdf.  2021. Tornado Cash Privacy Solution Version 1.4. https:\/\/tornado.cash\/Tornado. cash_whitepaper_v1.4.pdf."},{"key":"e_1_3_2_1_3_1","unstructured":"2022 1st February. ZCash protocol specification. https:\/\/github.com\/zcash\/zips\/ blob\/master\/protocol\/protocol.pdf.  2022 1st February. ZCash protocol specification. https:\/\/github.com\/zcash\/zips\/ blob\/master\/protocol\/protocol.pdf."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34618-8_13"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29962-0_8"},{"key":"e_1_3_2_1_6_1","volume-title":"MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT 2016 (LNCS","volume":"219","author":"Albrecht Martin R.","year":"2016","unstructured":"Martin R. Albrecht , Lorenzo Grassi , Christian Rechberger , Arnab Roy , and Tyge Tiessen . 2016 . MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT 2016 (LNCS , Vol. 10031). 191-- 219 . Martin R. Albrecht, Lorenzo Grassi, Christian Rechberger, Arnab Roy, and Tyge Tiessen. 2016. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT 2016 (LNCS, Vol. 10031). 191--219."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2020.i3.1-45"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Augustin Bariant Cl\u00e9mence Bouvier Ga\u00ebtan Leurent and L\u00e9o Perrin. 2022. Practical Algebraic Attacks against some Arithmetization-oriented Hash Functions. available at https:\/\/hal.archives-ouvertes.fr\/hal-03518757\/document.  Augustin Bariant Cl\u00e9mence Bouvier Ga\u00ebtan Leurent and L\u00e9o Perrin. 2022. Practical Algebraic Attacks against some Arithmetization-oriented Hash Functions. available at https:\/\/hal.archives-ouvertes.fr\/hal-03518757\/document.","DOI":"10.46586\/tosc.v2022.i3.73-101"},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Fast Reed-Solomon Interactive Oracle Proofs of Proximity. In ICALP (LIPIcs, Vol. 107)","volume":"14","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson , Iddo Bentov , Yinon Horesh , and Michael Riabzev . 2018 . Fast Reed-Solomon Interactive Oracle Proofs of Proximity. In ICALP (LIPIcs, Vol. 107) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 14 : 1 -- 14 :17. Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2018. Fast Reed-Solomon Interactive Oracle Proofs of Proximity. In ICALP (LIPIcs, Vol. 107). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 14:1--14:17.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_11_1","volume-title":"Ward","author":"Ben-Sasson Eli","year":"2019","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , Michael Riabzev , Nicholas Spooner , Madars Virza , and Nicholas P . Ward . 2019 . Aurora : Transparent Succinct Arguments for R1CS. In EUROCRYPT (1) (Lecture Notes in Computer Science , Vol. 11476). Springer, 103-- 128 . Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P. Ward. 2019. Aurora: Transparent Succinct Arguments for R1CS. In EUROCRYPT (1) (Lecture Notes in Computer Science, Vol. 11476). Springer, 103--128."},{"key":"e_1_3_2_1_12_1","volume-title":"On the Indifferentiability of the Sponge Construction. In EUROCRYPT 2008 (LNCS","volume":"197","author":"Bertoni Guido","year":"2008","unstructured":"Guido Bertoni , Joan Daemen , Micha\u00ebl Peeters , and Gilles Van Assche . 2008 . On the Indifferentiability of the Sponge Construction. In EUROCRYPT 2008 (LNCS , Vol. 4965). 181-- 197 . Guido Bertoni, Joan Daemen, Micha\u00ebl Peeters, and Gilles Van Assche. 2008. On the Indifferentiability of the Sponge Construction. In EUROCRYPT 2008 (LNCS, Vol. 4965). 181--197."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_11"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"e_1_3_2_1_15_1","volume-title":"Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution. In ASIACRYPT (1) (Lecture Notes in Computer Science","author":"Bootle Jonathan","year":"2018","unstructured":"Jonathan Bootle , Andrea Cerulli , Jens Groth , Sune K. Jakobsen , and Mary Maller . 2018 . Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution. In ASIACRYPT (1) (Lecture Notes in Computer Science , Vol. 11272). Springer, 595-- 626 . Jonathan Bootle, Andrea Cerulli, Jens Groth, Sune K. Jakobsen, and Mary Maller. 2018. Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution. In ASIACRYPT (1) (Lecture Notes in Computer Science, Vol. 11272). Springer, 595--626."},{"key":"e_1_3_2_1_16_1","volume-title":"Zcash Orchard: Sinsemilla Gadget.","author":"Bowe Sean","year":"2021","unstructured":"Sean Bowe and Daira Hopwood . 2021 . Zcash Orchard: Sinsemilla Gadget. available at https:\/\/zcash.github.io\/orchard\/design\/circuit\/gadgets\/sinsemilla.html. Sean Bowe and Daira Hopwood. 2021. Zcash Orchard: Sinsemilla Gadget. available at https:\/\/zcash.github.io\/orchard\/design\/circuit\/gadgets\/sinsemilla.html."},{"key":"e_1_3_2_1_17_1","volume-title":"CRYPTO (1) (Lecture Notes in Computer Science","author":"B\u00fcnz Benedikt","unstructured":"Benedikt B\u00fcnz , Alessandro Chiesa , William Lin , Pratyush Mishra , and Nicholas Spooner . 2021. Proof-Carrying Data Without Succinct Arguments . In CRYPTO (1) (Lecture Notes in Computer Science , Vol. 12825). Springer, 681-- 710 . Benedikt B\u00fcnz, Alessandro Chiesa, William Lin, Pratyush Mishra, and Nicholas Spooner. 2021. Proof-Carrying Data Without Succinct Arguments. In CRYPTO (1) (Lecture Notes in Computer Science, Vol. 12825). Springer, 681--710."},{"key":"e_1_3_2_1_18_1","volume-title":"TCC (2) (Lecture Notes in Computer Science","author":"B\u00fcnz Benedikt","unstructured":"Benedikt B\u00fcnz , Alessandro Chiesa , Pratyush Mishra , and Nicholas Spooner . 2020. Recursive Proof Composition from Accumulation Schemes . In TCC (2) (Lecture Notes in Computer Science , Vol. 12551). Springer, 1-- 18 . Benedikt B\u00fcnz, Alessandro Chiesa, Pratyush Mishra, and Nicholas Spooner. 2020. Recursive Proof Composition from Accumulation Schemes. In TCC (2) (Lecture Notes in Computer Science, Vol. 12551). Springer, 1--18."},{"key":"e_1_3_2_1_19_1","volume-title":"Fractal: Post-quantum and Transparent Recursive Proofs from Holography. In EUROCRYPT (1) (Lecture Notes in Computer Science","author":"Chiesa Alessandro","year":"2020","unstructured":"Alessandro Chiesa , Dev Ojha , and Nicholas Spooner . 2020 . Fractal: Post-quantum and Transparent Recursive Proofs from Holography. In EUROCRYPT (1) (Lecture Notes in Computer Science , Vol. 12105). Springer, 769-- 793 . Alessandro Chiesa, Dev Ojha, and Nicholas Spooner. 2020. Fractal: Post-quantum and Transparent Recursive Proofs from Holography. In EUROCRYPT (1) (Lecture Notes in Computer Science, Vol. 12105). Springer, 769--793."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_18"},{"key":"e_1_3_2_1_21_1","volume-title":"Courtois and Josef Pieprzyk","author":"Nicolas","year":"2002","unstructured":"Nicolas T. Courtois and Josef Pieprzyk . 2002 . Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. In ASIACRYPT (LNCS , Vol. 2501). Springer, 267-- 287 . Nicolas T. Courtois and Josef Pieprzyk. 2002. Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. In ASIACRYPT (LNCS, Vol. 2501). Springer, 267--287."},{"key":"e_1_3_2_1_22_1","volume-title":"varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.)","author":"Cox David A.","unstructured":"David A. Cox , John Little , and Donal O'Shea . 1997. Ideals , varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.) . Springer . David A. Cox, John Little, and Donal O'Shea. 1997. Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.). Springer."},{"key":"e_1_3_2_1_23_1","volume-title":"The Design of Rijndael: AES - The Advanced Encryption Standard","author":"Daemen Joan","unstructured":"Joan Daemen and Vincent Rijmen . 2002. The Design of Rijndael: AES - The Advanced Encryption Standard . Springer . Joan Daemen and Vincent Rijmen. 2002. The Design of Rijndael: AES - The Advanced Encryption Standard. Springer."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64837-4_16"},{"key":"e_1_3_2_1_25_1","first-page":"315","article-title":"plookup: A simplified polynomial protocol for lookup tables","volume":"2020","author":"Gabizon Ariel","year":"2020","unstructured":"Ariel Gabizon and Zachary J Williamson . 2020 . plookup: A simplified polynomial protocol for lookup tables . IACR Cryptol. ePrint Arch. , Vol. 2020 (2020), 315 . Ariel Gabizon and Zachary J Williamson. 2020. plookup: A simplified polynomial protocol for lookup tables. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 315.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_26_1","first-page":"953","article-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge","volume":"2019","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon , Zachary J Williamson , and Oana Ciobotaru . 2019 . PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge . IACR Cryptol. ePrint Arch. , Vol. 2019 (2019), 953 . Ariel Gabizon, Zachary J Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. IACR Cryptol. ePrint Arch., Vol. 2019 (2019), 953.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_27_1","volume-title":"Cairo-a Turing-complete STARK-friendly CPU architecture. Cryptology ePrint Archive","author":"Goldberg Lior","year":"2021","unstructured":"Lior Goldberg , Shahar Papini , and Michael Riabzev . 2021. Cairo-a Turing-complete STARK-friendly CPU architecture. Cryptology ePrint Archive ( 2021 ). Lior Goldberg, Shahar Papini, and Michael Riabzev. 2021. Cairo-a Turing-complete STARK-friendly CPU architecture. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_29_1","volume-title":"The Legendre Symbol and the Modulo-2 Operator in Symmetric Schemes over Fnp\/sub>. Cryptology ePrint Archive","author":"Grassi Lorenzo","year":"2021","unstructured":"Lorenzo Grassi , Dmitry Khovratovich , Sondre R\u00f8njom , and Markus Schofnegger . 2021a. The Legendre Symbol and the Modulo-2 Operator in Symmetric Schemes over Fnp\/sub>. Cryptology ePrint Archive ( 2021 ). Lorenzo Grassi, Dmitry Khovratovich, Sondre R\u00f8njom, and Markus Schofnegger. 2021a. The Legendre Symbol and the Modulo-2 Operator in Symmetric Schemes over Fnp\/sub>. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_30_1","volume-title":"Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. Usenix Security 2021","author":"Grassi Lorenzo","year":"2021","unstructured":"Lorenzo Grassi , Dmitry Khovratovich , Arnab Roy , Christian Rechberger , and Markus Schofnegger . 2021 b. Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. Usenix Security 2021 (2021). Lorenzo Grassi, Dmitry Khovratovich, Arnab Roy, Christian Rechberger, and Markus Schofnegger. 2021b. Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. Usenix Security 2021 (2021)."},{"key":"e_1_3_2_1_31_1","volume-title":"EUROCRYPT (2) (Lecture Notes in Computer Science","author":"Grassi Lorenzo","unstructured":"Lorenzo Grassi , Reinhard L\u00fcftenegger , Christian Rechberger , Dragos Rotaru , and Markus Schofnegger . 2020. On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy . In EUROCRYPT (2) (Lecture Notes in Computer Science , Vol. 12106). Springer, 674-- 704 . Lorenzo Grassi, Reinhard L\u00fcftenegger, Christian Rechberger, Dragos Rotaru, and Markus Schofnegger. 2020. On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy. In EUROCRYPT (2) (Lecture Notes in Computer Science, Vol. 12106). Springer, 674--704."},{"key":"e_1_3_2_1_33_1","article-title":"Proving Resistance Against Infinitely Long Subspace Trails: How to Choose the Linear Layer","volume":"2021","author":"Grassi Lorenzo","year":"2021","unstructured":"Lorenzo Grassi , Christian Rechberger , and Markus Schofnegger . 2021 d. Proving Resistance Against Infinitely Long Subspace Trails: How to Choose the Linear Layer . IACR Trans. Symmetric Cryptol. , Vol. 2021 , 2 (2021). Lorenzo Grassi, Christian Rechberger, and Markus Schofnegger. 2021d. Proving Resistance Against Infinitely Long Subspace Trails: How to Choose the Linear Layer. IACR Trans. Symmetric Cryptol., Vol. 2021, 2 (2021).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"e_1_3_2_1_34_1","volume-title":"EUROCRYPT (2) (Lecture Notes in Computer Science","author":"Groth Jens","unstructured":"Jens Groth . 2016. On the Size of Pairing-Based Non-interactive Arguments . In EUROCRYPT (2) (Lecture Notes in Computer Science , Vol. 9666). Springer, 305-- 326 . Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT (2) (Lecture Notes in Computer Science, Vol. 9666). Springer, 305--326."},{"key":"e_1_3_2_1_35_1","unstructured":"Bertoni Guido Daemen Joan P Micha\u00ebl and VA Gilles. 2011. Cryptographic sponge functions.  Bertoni Guido Daemen Joan P Micha\u00ebl and VA Gilles. 2011. Cryptographic sponge functions."},{"key":"e_1_3_2_1_36_1","unstructured":"Daira Hopwood. 2019. Zcon0 conference notes. available at https:\/\/www.zfnd.org\/zcon\/0\/workshop-notes\/Zcon0%20Circuit%20Optimisation%20handout.pdf.  Daira Hopwood. 2019. Zcon0 conference notes. available at https:\/\/www.zfnd.org\/zcon\/0\/workshop-notes\/Zcon0%20Circuit%20Optimisation%20handout.pdf."},{"key":"e_1_3_2_1_37_1","volume-title":"The Interpolation Attack on Block Ciphers. In FSE 1997 (LNCS","volume":"40","author":"Jakobsen Thomas","unstructured":"Thomas Jakobsen and Lars R. Knudsen . 1997 . The Interpolation Attack on Block Ciphers. In FSE 1997 (LNCS , Vol. 1267). 28-- 40 . Thomas Jakobsen and Lars R. Knudsen. 1997. The Interpolation Attack on Block Ciphers. In FSE 1997 (LNCS, Vol. 1267). 28--40."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_2"},{"key":"e_1_3_2_1_39_1","volume-title":"Rebound Distinguishers: Results on the Full Whirlpool Compression Function. In ASIACRYPT 2009 (LNCS","volume":"143","author":"Lamberger Mario","year":"2009","unstructured":"Mario Lamberger , Florian Mendel , Christian Rechberger , Vincent Rijmen , and Martin Schl\u00e4ffer . 2009 . Rebound Distinguishers: Results on the Full Whirlpool Compression Function. In ASIACRYPT 2009 (LNCS , Vol. 5912). 126-- 143 . Mario Lamberger, Florian Mendel, Christian Rechberger, Vincent Rijmen, and Martin Schl\u00e4ffer. 2009. Rebound Distinguishers: Results on the Full Whirlpool Compression Function. In ASIACRYPT 2009 (LNCS, Vol. 5912). 126--143."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339817"},{"key":"e_1_3_2_1_41_1","volume-title":"The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Gr\u00f8stl. In FSE 2009 (LNCS","volume":"276","author":"Mendel Florian","unstructured":"Florian Mendel , Christian Rechberger , Martin Schl\u00e4ffer , and S\u00f8ren S. Thomsen . 2009 . The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Gr\u00f8stl. In FSE 2009 (LNCS , Vol. 5665). 260-- 276 . Florian Mendel, Christian Rechberger, Martin Schl\u00e4ffer, and S\u00f8ren S. Thomsen. 2009. The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Gr\u00f8stl. In FSE 2009 (LNCS, Vol. 5665). 260--276."},{"key":"e_1_3_2_1_42_1","volume-title":"29th {USENIX} Security Symposium ({USENIX} Security 20). 2075--2092.","author":"Ozdemir Alex","unstructured":"Alex Ozdemir , Riad Wahby , Barry Whitehat , and Dan Boneh . 2020. Scaling verifiable computation using efficient set accumulators . In 29th {USENIX} Security Symposium ({USENIX} Security 20). 2075--2092. Alex Ozdemir, Riad Wahby, Barry Whitehat, and Dan Boneh. 2020. Scaling verifiable computation using efficient set accumulators. In 29th {USENIX} Security Symposium ({USENIX} Security 20). 2075--2092."},{"key":"e_1_3_2_1_43_1","volume-title":"Pinocchio: Nearly Practical Verifiable Computation. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 238--252","author":"Parno Bryan","year":"2013","unstructured":"Bryan Parno , Jon Howell , Craig Gentry , and Mariana Raykova . 2013 . Pinocchio: Nearly Practical Verifiable Computation. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 238--252 . Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2013. Pinocchio: Nearly Practical Verifiable Computation. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 238--252."},{"key":"e_1_3_2_1_44_1","volume-title":"PlonKup: Reconciling PlonK with plookup. Cryptology ePrint Archive","author":"Pearson Luke","year":"2022","unstructured":"Luke Pearson , Joshua Fitzgerald , H\u00e9ctor Masip , Marta Bell\u00e9s-Munoz , and Jose Luis Munoz-Tapia . 2022. PlonKup: Reconciling PlonK with plookup. Cryptology ePrint Archive ( 2022 ). Luke Pearson, Joshua Fitzgerald, H\u00e9ctor Masip, Marta Bell\u00e9s-Munoz, and Jose Luis Munoz-Tapia. 2022. PlonKup: Reconciling PlonK with plookup. Cryptology ePrint Archive (2022)."},{"key":"e_1_3_2_1_45_1","volume-title":"Sok: Gr\u00f6bner basis algorithms for arithmetization oriented ciphers. Cryptology ePrint Archive","author":"Sauer Jan Ferdinand","year":"2021","unstructured":"Jan Ferdinand Sauer and Alan Szepieniec . 2021 . Sok: Gr\u00f6bner basis algorithms for arithmetization oriented ciphers. Cryptology ePrint Archive (2021). Jan Ferdinand Sauer and Alan Szepieniec. 2021. Sok: Gr\u00f6bner basis algorithms for arithmetization oriented ciphers. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_46_1","volume-title":"On the use of the Legendre symbol in symmetric cipher design. Cryptology ePrint Archive","author":"Szepieniec Alan","year":"2021","unstructured":"Alan Szepieniec . 2021. On the use of the Legendre symbol in symmetric cipher design. Cryptology ePrint Archive ( 2021 ). Alan Szepieniec. 2021. On the use of the Legendre symbol in symmetric cipher design. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_47_1","unstructured":"Zac Williamson. 2020. zkSummit: Plookup. available at https:\/\/youtu.be\/Vdlc1CmRYRY?t=1564.  Zac Williamson. 2020. zkSummit: Plookup. available at https:\/\/youtu.be\/Vdlc1CmRYRY?t=1564."},{"key":"e_1_3_2_1_48_1","volume-title":"Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper.(2014). io","author":"Gavin Wood","year":"2014","unstructured":"Gavin Wood et al. 2014 . Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper.(2014). io Gavin Wood et al. 2014. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper.(2014). io"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:59Z","timestamp":1750182539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560686"}},"subtitle":["A Fast Hash Function for Verifiable Computation"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":45,"alternative-id":["10.1145\/3548606.3560686","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560686","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}