{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:14:58Z","timestamp":1783008898751,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100023561","name":"Ministerio de Universidades","doi-asserted-by":"publisher","award":["FPU21\/00600"],"award-info":[{"award-number":["FPU21\/00600"]}],"id":[{"id":"10.13039\/501100023561","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["TED2021-132464B-I00"],"award-info":[{"award-number":["TED2021-132464B-I00"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PID2022-142290OB-I00"],"award-info":[{"award-number":["PID2022-142290OB-I00"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101001283"],"award-info":[{"award-number":["101001283"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018699","name":"HORIZON EUROPE Digital, Industry and Space","doi-asserted-by":"publisher","award":["101097122"],"award-info":[{"award-number":["101097122"]}],"id":[{"id":"10.13039\/100018699","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010198","name":"Ministerio de Asuntos Econ\u00f3micos y Transformaci\u00f3n Digital, Gobierno de Espa\u00f1a","doi-asserted-by":"publisher","award":["PID2019-109379RB-I00"],"award-info":[{"award-number":["PID2019-109379RB-I00"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623160","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"1437-1451","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4864-1125","authenticated-orcid":false,"given":"David","family":"Balb\u00e1s","sequence":"first","affiliation":[{"name":"IMDEA Software Institute &amp; Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7274-6600","authenticated-orcid":false,"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7452-9121","authenticated-orcid":false,"given":"Maria Isabel","family":"Gonz\u00e1lez Vasco","sequence":"additional","affiliation":[{"name":"Universidad Carlos III de Madrid, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6024-7105","authenticated-orcid":false,"given":"Damien","family":"Robissout","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8215-5457","authenticated-orcid":false,"given":"Claudio","family":"Soriente","sequence":"additional","affiliation":[{"name":"NEC Laboratories Europe, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"On Polynomial Approximations for Privacy-Preserving and Verifiable ReLU Networks. CoRR","author":"Ali Ramy E.","year":"2020","unstructured":"Ramy E. Ali, Jinhyun So, and Amir Salman Avestimehr. 2020. On Polynomial Approximations for Privacy-Preserving and Verifiable ReLU Networks. CoRR , Vol. abs\/2011.05530 (2020). showeprint[arXiv]2011.05530 https:\/\/arxiv.org\/abs\/2011.05530"},{"key":"e_1_3_2_1_2_1","unstructured":"arkworks contributors. 2022. textttarkworks zkSNARK ecosystem. https:\/\/arkworks.rs"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339820"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3162105"},{"key":"e_1_3_2_1_6_1","volume-title":"Dongwoo Kim, and Daejun Park.","author":"Chen Shuo","year":"2019","unstructured":"Shuo Chen, Jung Hee Cheon, Dongwoo Kim, and Daejun Park. 2019. Verifiable Computing for Approximate Computation. Cryptology ePrint Archive, Report 2019\/762. https:\/\/eprint.iacr.org\/2019\/762."},{"key":"e_1_3_2_1_7_1","volume-title":"cudnn: Efficient primitives for deep learning. arXiv preprint arXiv:1410.0759","author":"Chetlur Sharan","year":"2014","unstructured":"Sharan Chetlur, Cliff Woolley, Philippe Vandermersch, Jonathan Cohen, John Tran, Bryan Catanzaro, and Evan Shelhamer. 2014. cudnn: Efficient primitives for deep learning. arXiv preprint arXiv:1410.0759 (2014)."},{"key":"e_1_3_2_1_8_1","unstructured":"Alessandro Chiesa Michael A. Forbes and Nicholas Spooner. 2017. A Zero Knowledge Sumcheck and its Applications. Cryptology ePrint Archive Report 2017\/305. https:\/\/eprint.iacr.org\/2017\/305."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings. 310--331","author":"Chiesa Alessandro","year":"2010","unstructured":"Alessandro Chiesa and Eran Tromer. 2010. Proof-Carrying Data and Hearsay Arguments from Signature Cards. In Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5--7, 2010. Proceedings. 310--331."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047488"},{"key":"e_1_3_2_1_13_1","unstructured":"Council of European Union. 2000. Council Directive 2000\/43\/EC of 29 June 2000 implementing the principle of equal treatment between persons irrespective of racial or ethnic origin. newlinehttps:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/?uri=CELEX:32000L0043."},{"key":"e_1_3_2_1_14_1","unstructured":"Council of European Union. 2004. Council Directive 2004\/113\/EC of 13 December 2004 implementing the principle of equal treatment between men and women in the access to and supply of goods and services. newlinehttps:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/?uri=CELEX:32004L0113."},{"key":"e_1_3_2_1_15_1","volume-title":"A guide to convolution arithmetic for deep learning. arXiv preprint arXiv:1603.07285","author":"Dumoulin Vincent","year":"2016","unstructured":"Vincent Dumoulin and Francesco Visin. 2016. A guide to convolution arithmetic for deep learning. arXiv preprint arXiv:1603.07285 (2016)."},{"key":"e_1_3_2_1_16_1","unstructured":"Liam Eagen Dario Fiore and Ariel Gabizon. 2022. cq: Cached quotients for fast lookups. Cryptology ePrint Archive Report 2022\/1763. https:\/\/eprint.iacr.org\/2022\/1763."},{"key":"e_1_3_2_1_17_1","unstructured":"Federal Office for Information Security Germany (BSI). 2022. Auditing machine learning algorithms - A white paper for public auditors. https:\/\/www.hhi.fraunhofer.de\/fileadmin\/Departments\/AI\/TechnologiesAndSolutions\/2022-05--23-whitepaper-tuev-bsi-hhi-towards-auditable-ai-systems.pdf."},{"key":"e_1_3_2_1_18_1","volume-title":"ZEN: An Optimizing Compiler for Verifiable, Zero-Knowledge Neural Network Inferences. Cryptology ePrint Archive, Report 2021\/087. https:\/\/ia.cr\/2021\/087.","author":"Feng Boyuan","year":"2021","unstructured":"Boyuan Feng, Lianke Qin, Zhenfei Zhang, Yufei Ding, and Shumo Chu. 2021. ZEN: An Optimizing Compiler for Verifiable, Zero-Knowledge Neural Network Inferences. Cryptology ePrint Archive, Report 2021\/087. https:\/\/ia.cr\/2021\/087."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_1_21_1","volume-title":"Wahby","author":"Golovnev Alexander","year":"2021","unstructured":"Alexander Golovnev, Jonathan Lee, Srinath Setty, Justin Thaler, and Riad S. Wahby. 2021. Brakedown: Linear-time and post-quantum SNARKs for R1CS. Cryptology ePrint Archive, Report 2021\/1043. https:\/\/ia.cr\/2021\/1043."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00021"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00286"},{"key":"e_1_3_2_1_24_1","unstructured":"Daniel Kang Tatsunori Hashimoto Ion Stoica and Yi Sun. 2022. ZK-IMG: Attested Images via Zero-Knowledge Proofs to Fight Disinformation. arxiv: 2211.04775 [cs.CR]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_26_1","unstructured":"Seunghwa Lee Hankyung Ko Jihye Kim and Hyunok Oh. 2020. vCNN: Verifiable Convolutional Neural Network. Cryptology ePrint Archive Report 2020\/584. https:\/\/eprint.iacr.org\/2020\/584."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3485379"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3485379"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.23"},{"key":"e_1_3_2_1_31_1","volume-title":"Kattis","author":"Posen Jim","year":"2022","unstructured":"Jim Posen and Assimakis A. Kattis. 2022. Caulk: Table-independent lookup arguments. Cryptology ePrint Archive, Report 2022\/957. https:\/\/eprint.iacr.org\/2022\/957."},{"key":"e_1_3_2_1_32_1","unstructured":"scipr-lab. 2017. libsnark: a C library for zkSNARK proofs. https:\/\/github.com\/scipr-lab\/libsnark."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22318-1_18"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--40084--1_5"},{"key":"e_1_3_2_1_36_1","volume-title":"the Netherlands, Norway and the UK","author":"Finland Supreme Audit","year":"2020","unstructured":"the Supreme Audit Institutions of Finland, Germany, the Netherlands, Norway and the UK. 2020. Towards Auditable AI Systems - From Principles to Practice. https:\/\/www.auditingalgorithms.net\/."},{"key":"e_1_3_2_1_37_1","unstructured":"Stanford University. [n. d.]. CS231: Convolutional Neural Networks for Pattern Recognition. https:\/\/cs231n.github.io\/convolutional-networks\/#convert."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.48"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133984"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--26954--8_24"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--15985--5_11"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560646"},{"key":"e_1_3_2_1_44_1","volume-title":"Baloo: Nearly Optimal Lookup Arguments. Cryptology ePrint Archive, Report 2022\/1565. https:\/\/eprint.iacr.org\/2022\/1565.","author":"Zapico Arantxa","year":"2022","unstructured":"Arantxa Zapico, Ariel Gabizon, Dmitry Khovratovich, Mary Maller, and Carla R\u00e0fols. 2022b. Baloo: Nearly Optimal Lookup Arguments. Cryptology ePrint Archive, Report 2022\/1565. https:\/\/eprint.iacr.org\/2022\/1565."},{"key":"e_1_3_2_1_45_1","unstructured":"zcash. 2022. halo2. https:\/\/zcash.github.io\/halo2\/."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417278"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484767"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.43"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00013"}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623160","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:50:29Z","timestamp":1755741029000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":50,"alternative-id":["10.1145\/3576915.3623160","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623160","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}