{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:28Z","timestamp":1750221268851,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Marie Curie COFUND","award":["600387"],"award-info":[{"award-number":["600387"]}]},{"name":"DFG","award":["PA 587\/10-1"],"award-info":[{"award-number":["PA 587\/10-1"]}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RU 1664\/3-1"],"award-info":[{"award-number":["RU 1664\/3-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ERC","award":["StG-335086"],"award-info":[{"award-number":["StG-335086"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134068","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"1547-1564","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs"],"prefix":"10.1145","author":[{"given":"Gottfried","family":"Herold","sequence":"first","affiliation":[{"name":"Ecole Normale Sup\u00e9rieure, Lyon, France"}]},{"given":"Max","family":"Hoffmann","sequence":"additional","affiliation":[{"name":"Ruhr-Universit\u00e4t Bochum, Bochum, Germany"}]},{"given":"Michael","family":"Kloo\u00df","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Carla","family":"R\u00e0fols","sequence":"additional","affiliation":[{"name":"Universitat Pompeu Fabra, Barcelona, Spain"}]},{"given":"Andy","family":"Rupp","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"volume-title":"Tal Rabin (Ed.)","author":"Abe Masayuki","key":"e_1_3_2_2_1_1","unstructured":"Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, and Miyako Ohkubo. 2010. Structure-Preserving Signatures and Commitments to Group Elements CRYPTO 2010 (LNCS), Tal Rabin (Ed.), Vol. Vol. 6223. Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 209--236."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Joseph A. Akinyele Gilles Barthe Benjamin Gr\u00e9goire Benedikt Schmidt and Pierre-Yves Strub. 2014. Certified Synthesis of Efficient Batch Verifiers. (2014) 153--165.","DOI":"10.1109\/CSF.2014.19"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382248"},{"key":"e_1_3_2_2_4_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.])."},{"key":"e_1_3_2_2_5_1","volume-title":"Randomizable Proofs and Delegatable Anonymous Credentials CRYPTO 2009 (LNCS), Shai Halevi (Ed.)","volume":"5677","author":"Belenkiy Mira","year":"2009","unstructured":"Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, and Hovav Shacham 2009. Randomizable Proofs and Delegatable Anonymous Credentials CRYPTO 2009 (LNCS), Shai Halevi (Ed.), Vol. Vol. 5677. Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 108--125."},{"key":"e_1_3_2_2_6_1","volume-title":"P-signatures and Noninteractive Anonymous Credentials TCC 2008 (LNCS), Ran Canetti (Ed.)","volume":"4948","author":"Belenkiy Mira","year":"2008","unstructured":"Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, and Anna Lysyanskaya 2008. P-signatures and Noninteractive Anonymous Credentials TCC 2008 (LNCS), Ran Canetti (Ed.), Vol. Vol. 4948. Springer, Heidelberg, Germany, San Francisco, CA, USA, 356--374."},{"volume-title":"Compact E-Cash and Simulatable VRFs Revisited. PAIRING 2009 (LNCS)","author":"Belenkiy Mira","key":"e_1_3_2_2_7_1","unstructured":"Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, and Anna Lysyanskaya 2009. Compact E-Cash and Simulatable VRFs Revisited. PAIRING 2009 (LNCS), Hovav Shacham and Brent Waters (Eds.), Vol. Vol. 5671. Springer, Heidelberg, Germany, Palo Alto, CA, USA, 114--131."},{"volume-title":"Kaisa Nyberg (Ed.)","author":"Bellare Mihir","key":"e_1_3_2_2_8_1","unstructured":"Mihir Bellare, Juan A. Garay, and Tal Rabin 1998. Fast Batch Verification for Modular Exponentiation and Digital Signatures EUROCRYPT'98 (LNCS), Kaisa Nyberg (Ed.), Vol. Vol. 1403. Springer, Heidelberg, Germany, Espoo, Finland, 236--250."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_35"},{"key":"e_1_3_2_2_10_1","first-page":"580","article-title":"The Hunting of the SNARK","volume":"2014","author":"Bitansky Nir","year":"2014","unstructured":"Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, and Eran Tromer. 2014. The Hunting of the SNARK. IACR Cryptology ePrint Archive Vol. 2014 (2014), 580. http:\/\/eprint.iacr.org\/2014\/580","journal-title":"IACR Cryptology ePrint Archive"},{"volume-title":"Batch Groth-Sahai ACNS 10 (LNCS)","author":"Blazy Olivier","key":"e_1_3_2_2_11_1","unstructured":"Olivier Blazy, Georg Fuchsbauer, Malika Izabach\u00e8ne, Amandine Jambert, Herv\u00e9 Sibert, and Damien Vergnaud 2010. Batch Groth-Sahai ACNS 10 (LNCS), Jianying Zhou and Moti Yung (Eds.), Vol. Vol. 6123. Springer, Heidelberg, Germany, Beijing, China, 218--235."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_13"},{"volume-title":"Eli Biham (Ed.)","author":"Boneh Dan","key":"e_1_3_2_2_14_1","unstructured":"Dan Boneh, Craig Gentry, Ben Lynn, and Hovav Shacham. 2003. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps EUROCRYPT 2003 (LNCS), Eli Biham (Ed.), Vol. Vol. 2656. Springer, Heidelberg, Germany, Warsaw, Poland, 416--432."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662--48800--3_11"},{"key":"e_1_3_2_2_16_1","volume-title":"Compact E-Cash EUROCRYPT 2005 (LNCS), Ronald Cramer (Ed.)","volume":"3494","author":"Camenisch Jan","year":"2005","unstructured":"Jan Camenisch, Susan Hohenberger, and Anna Lysyanskaya. 2005. Compact E-Cash EUROCRYPT 2005 (LNCS), Ronald Cramer (Ed.), Vol. Vol. 3494. Springer, Heidelberg, Germany, Aarhus, Denmark, 302--321."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_14"},{"volume-title":"Matthew Franklin (Ed.)","author":"Camenisch Jan","key":"e_1_3_2_2_18_1","unstructured":"Jan Camenisch and Anna Lysyanskaya 2004. Signature Schemes and Anonymous Credentials from Bilinear Maps CRYPTO 2004 (LNCS), Matthew Franklin (Ed.), Vol. Vol. 3152. Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 56--72."},{"volume-title":"BeleniosRF: A Non-interactive Receipt-Free Electronic Voting Scheme ACM CCS 16","author":"Chaidos Pyrros","key":"e_1_3_2_2_19_1","unstructured":"Pyrros Chaidos, V\u00e9ronique Cortier, Georg Fuchsbauer, and David Galindo 2016. BeleniosRF: A Non-interactive Receipt-Free Electronic Voting Scheme ACM CCS 16. ACM Press, 1614--1625."},{"key":"e_1_3_2_2_20_1","volume-title":"Ring Signatures of Sub-linear Size Without Random Oracles ICALP 2007 (LNCS), Lars Arge, Christian Cachin, Tomasz Jurdzinski, and Andrzej Tarlecki (Eds.)","volume":"4596","author":"Chandran Nishanth","year":"2007","unstructured":"Nishanth Chandran, Jens Groth, and Amit Sahai 2007. Ring Signatures of Sub-linear Size Without Random Oracles ICALP 2007 (LNCS), Lars Arge, Christian Cachin, Tomasz Jurdzinski, and Andrzej Tarlecki (Eds.), Vol. Vol. 4596. Springer, Heidelberg, Germany, Wroclaw, Poland, 423--434."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_18"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--36362--7_29"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TC.2006.207","article-title":"Use of Sparse and\/or Complex Exponents in Batch Verification of Exponentiations","volume":"55","author":"Cheon Jung Hee","year":"2006","unstructured":"Jung Hee Cheon and Dong Hoon Lee 2006. Use of Sparse and\/or Complex Exponents in Batch Verification of Exponentiations. IEEE Trans. Comput. Vol. 55, 12 (Dec 2006), 1536--1542. \/10.1007\/3-540-09519-5_73","journal-title":"IEEE Trans. Comput."}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Dallas Texas USA","acronym":"CCS '17"},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134068","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:03Z","timestamp":1750212663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":23,"alternative-id":["10.1145\/3133956.3134068","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134068","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}