{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:34:06Z","timestamp":1780068846232,"version":"3.54.0"},"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":[{"name":"German Research Foundation","award":["272573906, 393541319"],"award-info":[{"award-number":["272573906, 393541319"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354262","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"2057-2074","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Succinct Arguments for Bilinear Group Arithmetic"],"prefix":"10.1145","author":[{"given":"Russell W. F.","family":"Lai","sequence":"first","affiliation":[{"name":"Friedrich-Alexander University Erlangen-Nuremberg, Erlangen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Viktoria","family":"Ronge","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander University Erlangen-Nuremberg, Erlangen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Advances in Cryptology - Asiacrypt 2015 (Lecture Notes in Computer Science)","volume":"9452","author":"Abe Masayuki","year":"2015"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_12"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9196-7"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_19"},{"key":"e_1_3_2_2_5_1","volume-title":"On the Practical Security of Inner Product Functional Encryption. In PKC 2015 (LNCS ), Jonathan Katz (Ed.)","volume":"9020","author":"Agrawal Shashank","year":"2015"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956"},{"key":"e_1_3_2_2_7_1","volume-title":"Pairing-Friendly Elliptic Curves of Prime Order. In SAC 2005 (LNCS ), Bart Preneel and Stafford Tavares (Eds.)","volume":"3897","author":"Paulo S. L."},{"key":"e_1_3_2_2_9_1","volume-title":"Ward","author":"Ben-Sasson Eli","year":"2019"},{"key":"e_1_3_2_2_10_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_11_1","volume-title":"20th","author":"Blum Manuel"},{"key":"e_1_3_2_2_12_1","volume-title":"CRYPTO 2001 (LNCS ), Joe Kilian (Ed.)","volume":"2139","author":"Boneh Dan"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Jonathan Bootle Andrea Cerulli Pyrros Chaidos Jens Groth and Christophe Petit. 2016. Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting See citeNEC16--2 327--357. https:\/\/doi.org\/10.1007\/978--3--662--49896--5_12  Jonathan Bootle Andrea Cerulli Pyrros Chaidos Jens Groth and Christophe Petit. 2016. Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting See citeNEC16--2 327--357. https:\/\/doi.org\/10.1007\/978--3--662--49896--5_12","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"e_1_3_2_2_14_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More, See citeNSP18, 315--334. https:\/\/doi.org\/10.1109\/SP.2018.00020","author":"B\u00fcnz Benedikt","year":"2018"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Jan Camenisch Kristiyan Haralambiev Markulf Kohlweiss Jorn Lapon and Vincent Naessens. 2011. Structure Preserving CCA Secure Encryption and Applications See citeNAC11 89--106. https:\/\/doi.org\/10.1007\/978--3--642--25385-0_5  Jan Camenisch Kristiyan Haralambiev Markulf Kohlweiss Jorn Lapon and Vincent Naessens. 2011. Structure Preserving CCA Secure Encryption and Applications See citeNAC11 89--106. https:\/\/doi.org\/10.1007\/978--3--642--25385-0_5","DOI":"10.1007\/978-3-642-25385-0_5"},{"key":"e_1_3_2_2_16_1","volume-title":"Practical Verifiable Encryption and Decryption of Discrete Logarithms. In CRYPTO 2003 (LNCS ), Dan Boneh (Ed.)","volume":"2729","author":"Camenisch Jan","year":"2003"},{"key":"e_1_3_2_2_17_1","volume-title":"Group Encryption: Non-interactive Realization in the Standard Model. In ASIACRYPT 2009 (LNCS ), Mitsuru Matsui (Ed.)","volume":"5912","author":"Cathalo Julien","year":"2009"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_3_2_2_20_1","volume-title":"CRYPTO'86 (LNCS ), Andrew M","author":"Fiat Amos"},{"key":"e_1_3_2_2_21_1","volume-title":"EUROCRYPT","volume":"9666","author":"Fischlin Marc","year":"2016"},{"key":"e_1_3_2_2_22_1","volume-title":"Commuting Signatures and Verifiable Encryption. In EUROCRYPT 2011 (LNCS ), Kenneth G. Paterson (Ed.)","volume":"6632","author":"Fuchsbauer Georg","year":"2011"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_2_24_1","volume-title":"43rd ACM STOC, Lance Fortnow and Salil P","author":"Gentry Craig","year":"1993"},{"key":"e_1_3_2_2_25_1","volume-title":"Groth-Sahai Proofs Revisited. In PKC 2010 (LNCS ), Phong Q. Nguyen and David Pointcheval (Eds.)","volume":"6056","author":"Ghadafi Essam","year":"2010"},{"key":"e_1_3_2_2_26_1","volume-title":"Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data. In ACM CCS 2006","author":"Goyal Vipul","year":"2006"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11935230_29"},{"key":"e_1_3_2_2_28_1","unstructured":"Jens Groth. 2011. Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments See citeNAC11 431--448. https:\/\/doi.org\/10.1007\/978--3--642--25385-0_23  Jens Groth. 2011. Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments See citeNAC11 431--448. https:\/\/doi.org\/10.1007\/978--3--642--25385-0_23"},{"key":"e_1_3_2_2_29_1","unstructured":"Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments See citeNEC16--2 305--326. https:\/\/doi.org\/10.1007\/978--3--662--49896--5_11  Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments See citeNEC16--2 305--326. https:\/\/doi.org\/10.1007\/978--3--662--49896--5_11"},{"key":"e_1_3_2_2_30_1","unstructured":"Jens Groth and Yuval Ishai. 2008. Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle See citeNEC08 379--396. https:\/\/doi.org\/10.1007\/978--3--540--78967--3_22  Jens Groth and Yuval Ishai. 2008. Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle See citeNEC08 379--396. https:\/\/doi.org\/10.1007\/978--3--540--78967--3_22"},{"key":"e_1_3_2_2_31_1","volume-title":"Perfect Non-interactive Zero Knowledge for NP. In EUROCRYPT 2006 (LNCS ), Serge Vaudenay (Ed.)","volume":"4004","author":"Groth Jens","year":"2006"},{"key":"e_1_3_2_2_32_1","unstructured":"Jens Groth and Amit Sahai. 2008. Efficient Non-interactive Proof Systems for Bilinear Groups See citeNEC08 415--432. https:\/\/doi.org\/10.1007\/978--3--540--78967--3_24  Jens Groth and Amit Sahai. 2008. Efficient Non-interactive Proof Systems for Bilinear Groups See citeNEC08 415--432. https:\/\/doi.org\/10.1007\/978--3--540--78967--3_24"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725386"},{"key":"e_1_3_2_2_34_1","volume-title":"CRYPTO'91 (LNCS )","author":"Pedersen Torben P."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"e_1_3_2_2_36_1","volume-title":"Fuzzy Identity-Based Encryption. In EUROCRYPT 2005 (LNCS ), Ronald Cramer (Ed.)","volume":"3494","author":"Sahai Amit"},{"key":"e_1_3_2_2_37_1","volume-title":"CRYPTO'89 (LNCS )","author":"Schnorr Claus-Peter"},{"key":"e_1_3_2_2_38_1","volume-title":"EUROCRYPT","volume":"4965","author":"Ed Nigel P.","year":"2008"},{"key":"e_1_3_2_2_39_1","volume-title":"Justin Thaler, and Michael Walfish.","author":"Wahby Riad S.","year":"2018"}],"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.3354262","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354262","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.3354262"}},"subtitle":["Practical Structure-Preserving Cryptography"],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":37,"alternative-id":["10.1145\/3319535.3354262","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354262","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"}}]}}