{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:00:31Z","timestamp":1777964431339,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":37,"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":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RU 1664\/3-1, PA 587\/10-1"],"award-info":[{"award-number":["RU 1664\/3-1, PA 587\/10-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354251","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"2093-2110","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Efficient Zero-Knowledge Arguments in the Discrete Log Setting, Revisited"],"prefix":"10.1145","author":[{"given":"Max","family":"Hoffmann","sequence":"first","affiliation":[{"name":"Ruhr-University Bochum, Bochum, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kloo\u00df","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"Rupp","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96878-0_22"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_3_1","unstructured":"D. F. Aranha and C. P. L. Gouv\u00eaa. [n. d.]. RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic. ([n. d.]).  D. F. Aranha and C. P. L. Gouv\u00eaa. [n. d.]. RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic. ([n. d.])."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_3_2_2_6_1","volume-title":"Ward","author":"Ben-Sasson Eli","year":"2018"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34961-4_38"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-016-9241-9"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"e_1_3_2_2_10_1","volume-title":"Jakobsen","author":"Bootle Jonathan","year":"2017"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76581-5_19"},{"key":"e_1_3_2_2_12_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press","author":"B\u00fcnz Benedikt","year":"2018"},{"key":"e_1_3_2_2_13_1","volume-title":"ACM CCS 17","author":"Chase Melissa","year":"1825"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_4"},{"key":"e_1_3_2_2_15_1","volume-title":"Zero-Knowledge Proofs for Finite Field Arithmetic","author":"Cramer Ronald"},{"key":"e_1_3_2_2_16_1","volume-title":"Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In EUROCRYPT 2000 (LNCS ), Bart Preneel (Ed.)","volume":"1807","author":"Damg\u00e5rd Ivan","year":"2000"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45611-8_28"},{"key":"e_1_3_2_2_18_1","volume-title":"Fine-Tuning Groth-Sahai Proofs. In PKC 2014 (LNCS ), Hugo Krawczyk (Ed.)","volume":"8383","author":"Escala Alex","year":"2014"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_2_21_1","volume-title":"ACM CCS 18","author":"Gennaro Rosario"},{"key":"e_1_3_2_2_22_1","volume-title":"ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In USENIX Security Symposium. USENIX Association, 1069--1083","author":"Giacomelli Irene","year":"2016"},{"key":"e_1_3_2_2_24_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_25_1","volume-title":"Short Non-interactive Zero-Knowledge Proofs. In ASIACRYPT 2010 (LNCS ), Masayuki Abe (Ed.)","volume":"6477","author":"Groth Jens","year":"2010"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_22"},{"key":"e_1_3_2_2_29_1","volume-title":"Efficient Non-interactive Proof Systems for Bilinear Groups. In EUROCRYPT 2008 (LNCS ), Nigel P. Smart (Ed.)","volume":"4965","author":"Groth Jens","year":"2008"},{"key":"e_1_3_2_2_30_1","first-page":"944","article-title":"Efficient zero-knowledge arguments in the discrete log setting, revisited","volume":"2019","author":"Hoffmann Max","year":"2019","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_31_1","volume-title":"39th ACM STOC, David S","author":"Ishai Yuval"},{"key":"e_1_3_2_2_32_1","first-page":"1093","article-title":"$CptysetCptyset$: A Framework for Building Composable Zero-Knowledge Proofs","volume":"2015","author":"Kosba Ahmed E.","year":"2015","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46494-6_5"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42033-7_3"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0103-5"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_27"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1237500.1237502"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_2_39_1","first-page":"1157","article-title":"Special Soundness Revisited","volume":"2018","author":"Douglas Wikstr\u00f6","year":"2018","journal-title":"IACR Cryptology ePrint Archive"}],"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.3354251","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:32Z","timestamp":1750203872000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":37,"alternative-id":["10.1145\/3319535.3354251","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354251","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"}}]}}