{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:43:08Z","timestamp":1774946588056,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministerio de Econom\u00eda y Competitividad","award":["RTC-2016-4930-7"],"award-info":[{"award-number":["RTC-2016-4930-7"]}]},{"DOI":"10.13039\/501100008433","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["S2018\/TCS-4339"],"award-info":[{"award-number":["S2018\/TCS-4339"]}],"id":[{"id":"10.13039\/501100008433","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Protocol Labs","award":["PoSt"],"award-info":[{"award-number":["PoSt"]}]},{"name":"?la Caixa? Foundation","award":["LCF\/BQ\/ES18\/11670018"],"award-info":[{"award-number":["LCF\/BQ\/ES18\/11670018"]}]},{"name":"Ministerio de Ciencia e Innovaci\u00f3n","award":["ERC2018-092822,RTI2018-102043-B-I00"],"award-info":[{"award-number":["ERC2018-092822,RTI2018-102043-B-I00"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3339820","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"2075-2092","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":133,"title":["LegoSNARK"],"prefix":"10.1145","author":[{"given":"Matteo","family":"Campanelli","sequence":"first","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}]},{"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}]},{"given":"Ana\u00efs","family":"Querol","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute & Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Hyrax. https:\/\/github.com\/hyraxZK.  Hyrax. https:\/\/github.com\/hyraxZK."},{"key":"e_1_3_2_2_2_1","unstructured":"libsecp256k1. https:\/\/github.com\/apoelstra\/secp256k1-mw\/tree\/bulletproofs.  libsecp256k1. https:\/\/github.com\/apoelstra\/secp256k1-mw\/tree\/bulletproofs."},{"key":"e_1_3_2_2_3_1","unstructured":"libsnark. https:\/\/github.com\/scipr-lab\/libsnark.  libsnark. https:\/\/github.com\/scipr-lab\/libsnark."},{"key":"e_1_3_2_2_4_1","unstructured":"PyPy. https:\/\/pypy.org.  PyPy. https:\/\/pypy.org."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96878-0_22"},{"key":"e_1_3_2_2_6_1","volume-title":"Alonso and Jordi Herrera Joancomart\u00ed","author":"Kurt","year":"2018"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_8_1","volume-title":"ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 271--286","author":"Backes Michael","year":"2015"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_3_2_2_12_1","volume-title":"Interactive Oracle Proofs. In TCC 2016-B, Part II (LNCS), Martin Hirt and Adam D. Smith (Eds.)","volume":"9986","author":"Ben-Sasson Eli","year":"2016"},{"key":"e_1_3_2_2_13_1","unstructured":"Eli Ben-Sasson Alessandro Chiesa Eran Tromer and Madars Virza. 2014. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. In USENIX Security. 781--796.  Eli Ben-Sasson Alessandro Chiesa Eran Tromer and Madars Virza. 2014. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. In USENIX Security. 781--796."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-016-9241-9"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"e_1_3_2_2_17_1","volume-title":"Jakobsen","author":"Bootle Jonathan","year":"2017"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522733"},{"key":"e_1_3_2_2_20_1","first-page":"2017","article-title":"Bulletproofs: Efficient range proofs for confidential transactions. Technical Report. Cryptology ePrint Archive","volume":"2017","author":"B\u00fcnz Benedikt","year":"2017","journal-title":"Report"},{"key":"e_1_3_2_2_22_1","volume-title":"34th","author":"Canetti Ran"},{"key":"e_1_3_2_2_23_1","volume-title":"ACM CCS 17","author":"Chase Melissa","year":"1825"},{"key":"e_1_3_2_2_24_1","volume-title":"CRYPTO","volume":"9816","author":"Chase Melissa","year":"2016"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_2_26_1","volume-title":"Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 253--270","author":"Costello Craig","year":"2015"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70697-9_4"},{"key":"e_1_3_2_2_29_1","volume-title":"Hash First","author":"Fiore Dario"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_2_32_1","volume-title":"43rd ACM STOC, Lance Fortnow and Salil P","author":"Gentry Craig","year":"1993"},{"key":"e_1_3_2_2_33_1","volume-title":"ZKBoo: Faster ZeroKnowledge for Boolean Circuits. In 25th USENIX Security Symposium (USENIX Security 16)","author":"Giacomelli Irene","year":"2016"},{"key":"e_1_3_2_2_34_1","volume-title":"19th ACM STOC","author":"Goldreich Oded"},{"key":"e_1_3_2_2_35_1","volume-title":"Yael Tauman Kalai, and Guy N. Rothblum","author":"Goldwasser Shafi","year":"2008"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_2_37_1","volume-title":"Linear Algebra with Sub-linear Zero-Knowledge Arguments. In CRYPTO 2009 (LNCS), Shai Halevi (Ed.)","volume":"5677","author":"Groth Jens","year":"2009"},{"key":"e_1_3_2_2_38_1","volume-title":"Short Pairing-Based Non-interactive Zero-Knowledge Arguments. In ASIACRYPT 2010 (LNCS), Masayuki Abe (Ed.)","volume":"6477","author":"Groth Jens","year":"2010"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96878-0_24"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70697-9_16"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.10"},{"key":"e_1_3_2_2_43_1","volume-title":"39th ACM STOC, David S","author":"Ishai Yuval"},{"key":"e_1_3_2_2_45_1","volume-title":"24th","author":"Kilian Joe"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_4"},{"key":"e_1_3_2_2_47_1","volume-title":"TRUESET: Faster Verifiable Set Computations. In USENIX Security. 765--780.","author":"Kosba Ahmed E.","year":"2014"},{"key":"e_1_3_2_2_48_1","volume-title":"Progression-Free Sets and Sublinear Pairing-Based NonInteractive Zero-Knowledge Arguments. In TCC 2012 (LNCS), Ronald Cramer (Ed.)","volume":"7194","author":"Lipmaa Helger","year":"2012"},{"key":"e_1_3_2_2_49_1","volume-title":"AFRICACRYPT 16 (LNCS)","author":"Lipmaa Helger"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_2_51_1","volume-title":"CRYPTO'87 (LNCS)","author":"Merkle Ralph C."},{"key":"e_1_3_2_2_52_1","volume-title":"35th","author":"Micali Silvio","year":"1994"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_2_54_1","volume-title":"22nd","author":"Naor Moni"},{"key":"e_1_3_2_2_55_1","volume-title":"Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 238--252","author":"Parno Bryan","year":"2013"},{"key":"e_1_3_2_2_56_1","volume-title":"CRYPTO'91 (LNCS)","author":"Pedersen Torben P."},{"key":"e_1_3_2_2_57_1","volume-title":"Rothblum","author":"Reingold Omer","year":"2016"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"crossref","unstructured":"Leslie G. Valiant. 1976. Universal Circuits (Preliminary Report). In STOC. ACM 196--203.  Leslie G. Valiant. 1976. Universal Circuits (Preliminary Report). In STOC. ACM 196--203.","DOI":"10.1145\/800113.803649"},{"key":"e_1_3_2_2_62_1","volume-title":"AFRICACRYPT 17 (LNCS)","author":"Veeningen Meilof"},{"key":"e_1_3_2_2_63_1","volume-title":"ACM CCS 17","author":"Wahby Riad S.","year":"2071"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23097"},{"key":"e_1_3_2_2_65_1","volume-title":"Justin Thaler, and Michael Walfish.","author":"Wahby Riad S.","year":"2017"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.43"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3339820","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3339820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:01Z","timestamp":1750202641000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3339820"}},"subtitle":["Modular Design and Composition of Succinct Zero-Knowledge Proofs"],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":62,"alternative-id":["10.1145\/3319535.3339820","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3339820","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}