{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:47:19Z","timestamp":1780634839174,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":32,"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":"European Commission","award":["ERC #321310 PERCY"],"award-info":[{"award-number":["ERC #321310 PERCY"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134025","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"683-699","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Practical UC-Secure Delegatable Credentials with Attributes and Their Application to Blockchain"],"prefix":"10.1145","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[{"name":"IBM Research - Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manu","family":"Drijvers","sequence":"additional","affiliation":[{"name":"IBM Research - Zurich &amp; ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria","family":"Dubovitskaya","sequence":"additional","affiliation":[{"name":"IBM Research - Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Tal Rabin (Ed.)","author":"Abe Masayuki","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, 209--236."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_22"},{"key":"e_1_3_2_2_3_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, 108--125."},{"key":"e_1_3_2_2_4_1","volume-title":"Ari Juels, Rebecca N. Wright, and Sabrina De Capitani di Vimercati (Eds.)","author":"Bellare Mihir","unstructured":"Mihir Bellare and Gregory Neven 2006. Multi-signatures in the plain public-Key model and a general forking lemma ACM CCS 06, Ari Juels, Rebecca N. Wright, and Sabrina De Capitani di Vimercati (Eds.). ACM Press, 390--399."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Assaf Ben-David Noam Nisan and Benny Pinkas. 2008. FairplayMP: a system for secure multi-party computation ACM CCS 08 Peng Ning Paul F. Syverson and Somesh Jha (Eds.). ACM Press 257--266.","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2014.03.004"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53015-3_8"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_27"},{"key":"e_1_3_2_2_9_1","volume-title":"On the Portability of Generalized Schnorr Proofs EUROCRYPT 2009 (LNCS), Antoine Joux (Ed.)","volume":"5479","author":"Camenisch Jan","year":"2009","unstructured":"Jan Camenisch, Aggelos Kiayias, and Moti Yung. 2009. On the Portability of Generalized Schnorr Proofs EUROCRYPT 2009 (LNCS), Antoine Joux (Ed.), Vol. Vol. 5479. Springer, Heidelberg, 425--442."},{"key":"e_1_3_2_2_10_1","volume-title":"Matthew Franklin (Ed.)","author":"Camenisch Jan","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, 56--72."},{"key":"e_1_3_2_2_11_1","volume-title":"Practical Verifiable Encryption and Decryption of Discrete Logarithms CRYPTO 2003 (LNCS), Dan Boneh (Ed.)","volume":"2729","author":"Camenisch Jan","year":"2003","unstructured":"Jan Camenisch and Victor Shoup 2003. Practical Verifiable Encryption and Decryption of Discrete Logarithms CRYPTO 2003 (LNCS), Dan Boneh (Ed.), Vol. Vol. 2729. Springer, Heidelberg, 126--144."},{"key":"e_1_3_2_2_12_1","volume-title":"Burton S. Kaliski Jr. (Ed.)","author":"Camenisch Jan","unstructured":"Jan Camenisch and Markus Stadler 1997. Efficient Group Signature Schemes for Large Groups (Extended Abstract) CRYPTO'97 (LNCS), Burton S. Kaliski Jr. (Ed.), Vol. Vol. 1294. Springer, Heidelberg, 410--424."},{"key":"e_1_3_2_2_14_1","volume-title":"Universally Composable Security: A New Paradigm for Cryptographic Protocols 42nd FOCS","author":"Canetti Ran","unstructured":"Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols 42nd FOCS. IEEE Computer Society Press, 136--145."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2004.24"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_18"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_6"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2014.22"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_5"},{"key":"e_1_3_2_2_21_1","volume-title":"CRYPTO'82, David Chaum, Ronald L","author":"Chaum David","unstructured":"David Chaum. 1982. Blind Signatures for Untraceable Payments. In CRYPTO'82, David Chaum, Ronald L. Rivest, and Alan T. Sherman (Eds.). Plenum Press, New York, USA, 199--203."},{"key":"e_1_3_2_2_22_1","volume-title":"Multiparty Unconditionally Secure Protocols (Extended Abstract) 20th ACM STOC","author":"Chaum David","unstructured":"David Chaum, Claude Cr\u00e9peau, and Ivan Damgr ard. 1988. Multiparty Unconditionally Secure Protocols (Extended Abstract) 20th ACM STOC. ACM Press, 11--19."},{"key":"e_1_3_2_2_23_1","volume-title":"Tsuyoshi Takagi","author":"Devegili Augusto Jun","unstructured":"Augusto Jun Devegili, Michael Scott, and Ricardo Dahab. 2007. Implementing Cryptographic Pairings over Barreto-Naehrig Curves (Invited Talk) PAIRING 2007 (LNCS), Tsuyoshi Takagi, Tatsuaki Okamoto, Eiji Okamoto, and Takeshi Okamoto (Eds.), Vol. Vol. 4575. Springer, Heidelberg, 197--207."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02351717"},{"key":"e_1_3_2_2_25_1","volume-title":"Andrew M. Odlyzko (Ed.)","author":"Fiat Amos","unstructured":"Amos Fiat and Adi Shamir 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems CRYPTO'86 (LNCS), Andrew M. Odlyzko (Ed.), Vol. Vol. 263. Springer, Heidelberg, 186--194."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_14"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02002-5_6"},{"key":"e_1_3_2_2_28_1","volume-title":"The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) 17th ACM STOC","author":"Goldwasser Shafi","unstructured":"Shafi Goldwasser, Silvio Micali, and Charles Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) 17th ACM STOC. ACM Press, 291--304."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48797-6_11"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-013--9160-y"},{"key":"e_1_3_2_2_32_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system.","author":"Nakamoto Satoshi","year":"2008","unstructured":"Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. (2008)."},{"key":"e_1_3_2_2_33_1","volume-title":"Composition and Integrity Preservation of Secure Reactive Systems ACM CCS 00","author":"Pfitzmann Birgit","unstructured":"Birgit Pfitzmann and Michael Waidner 2000. Composition and Integrity Preservation of Secure Reactive Systems ACM CCS 00, S. Jajodia and P. Samarati (Eds.). ACM Press, 245--254."},{"key":"e_1_3_2_2_34_1","volume-title":"Gilles Brassard (Ed.)","author":"Schnorr Claus-Peter","unstructured":"Claus-Peter Schnorr. 1990. Efficient Identification and Signatures for Smart Cards CRYPTO'89 (LNCS), Gilles Brassard (Ed.), Vol. Vol. 435. Springer, Heidelberg, 239--252."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_37"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","location":"Dallas Texas USA","acronym":"CCS '17","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"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.3134025","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:02Z","timestamp":1750212662000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":32,"alternative-id":["10.1145\/3133956.3134025","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134025","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"}}]}}