{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:04:44Z","timestamp":1781280284072,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T00:00:00Z","timestamp":1535328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,8,27]]},"DOI":"10.1145\/3230833.3234517","type":"proceedings-article","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T12:29:48Z","timestamp":1534163388000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Fully-Featured Anonymous Credentials with Reputation System"],"prefix":"10.1145","author":[{"given":"Kai","family":"Bemmann","sequence":"first","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"Bl\u00f6mer","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Bobolz","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henrik","family":"Br\u00f6cher","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Denis","family":"Diemert","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Eidens","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lukas","family":"Eilers","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Haltermann","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakob","family":"Juhnke","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Burhan","family":"Otour","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurens","family":"Porzenheim","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"Pukrop","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik","family":"Schilling","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Schlichtig","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcel","family":"Stienemeier","sequence":"additional","affiliation":[{"name":"Paderborn University, Department of Computer Science, Paderborn, NRW, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70630-4_13"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_22"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766171.1766225"},{"key":"e_1_3_2_1_6_1","volume-title":"CRYPTO'88 (LNCS)","author":"Benaloh Josh Cohen","unstructured":"Josh Cohen Benaloh and Jerry Leichter . 1990. Generalized Secret Sharing and Monotone Functions . In CRYPTO'88 (LNCS) , Shafi Goldwasser (Ed.), Vol. 403 . Springer , Heidelberg , 27--35. Josh Cohen Benaloh and Jerry Leichter. 1990. Generalized Secret Sharing and Monotone Functions. In CRYPTO'88 (LNCS), Shafi Goldwasser (Ed.), Vol. 403. Springer, Heidelberg, 27--35."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34961-4_38"},{"key":"e_1_3_2_1_8_1","volume-title":"Anonymous and Publicly Linkable Reputation Systems. In FC 2015 (LNCS), Rainer B\u00f6hme and Tatsuaki Okamoto (Eds.)","volume":"8975","author":"Bl\u00f6mer Johannes","year":"2015","unstructured":"Johannes Bl\u00f6mer , Jakob Juhnke , and Christina Kolb . 2015 . Anonymous and Publicly Linkable Reputation Systems. In FC 2015 (LNCS), Rainer B\u00f6hme and Tatsuaki Okamoto (Eds.) , Vol. 8975 . Springer, Heidelberg, 478--488. Johannes Bl\u00f6mer, Jakob Juhnke, and Christina Kolb. 2015. Anonymous and Publicly Linkable Reputation Systems. In FC 2015 (LNCS), Rainer B\u00f6hme and Tatsuaki Okamoto (Eds.), Vol. 8975. Springer, Heidelberg, 478--488."},{"key":"e_1_3_2_1_9_1","volume-title":"Short Signatures Without Random Oracles. In EUROCRYPT 2004 (LNCS), Christian Cachin and Jan Camenisch (Eds.)","volume":"3027","author":"Boneh Dan","year":"2004","unstructured":"Dan Boneh and Xavier Boyen . 2004 . Short Signatures Without Random Oracles. In EUROCRYPT 2004 (LNCS), Christian Cachin and Jan Camenisch (Eds.) , Vol. 3027 . Springer, Heidelberg, 56--73. Dan Boneh and Xavier Boyen. 2004. Short Signatures Without Random Oracles. In EUROCRYPT 2004 (LNCS), Christian Cachin and Jan Camenisch (Eds.), Vol. 3027. Springer, Heidelberg, 56--73."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48800-3_11"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455814"},{"key":"e_1_3_2_1_12_1","volume-title":"An Efficient System for Nontransferable Anonymous Credentials with Optional Anonymity Revocation. In EUROCRYPT 2001 (LNCS), Birgit Pfitzmann (Ed.)","volume":"2045","author":"Camenisch Jan","year":"2001","unstructured":"Jan Camenisch and Anna Lysyanskaya . 2001 . An Efficient System for Nontransferable Anonymous Credentials with Optional Anonymity Revocation. In EUROCRYPT 2001 (LNCS), Birgit Pfitzmann (Ed.) , Vol. 2045 . Springer, Heidelberg, 93--118. Jan Camenisch and Anna Lysyanskaya. 2001. An Efficient System for Nontransferable Anonymous Credentials with Optional Anonymity Revocation. In EUROCRYPT 2001 (LNCS), Birgit Pfitzmann (Ed.), Vol. 2045. Springer, Heidelberg, 93--118."},{"key":"e_1_3_2_1_13_1","volume-title":"SCN 02 (LNCS)","author":"Camenisch Jan","unstructured":"Jan Camenisch and Anna Lysyanskaya . 2003. A Signature Scheme with Efficient Protocols . In SCN 02 (LNCS) , Stelvio Cimato, Clemente Galdi, and Giuseppe Persiano (Eds.), Vol. 2576 . Springer , Heidelberg , 268--289. Jan Camenisch and Anna Lysyanskaya. 2003. A Signature Scheme with Efficient Protocols. In SCN 02 (LNCS), Stelvio Cimato, Clemente Galdi, and Giuseppe Persiano (Eds.), Vol. 2576. Springer, Heidelberg, 268--289."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"e_1_3_2_1_15_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","unstructured":"Jan Camenisch and Victor Shoup . 2003 . Practical Verifiable Encryption and Decryption of Discrete Logarithms. In CRYPTO 2003 (LNCS), Dan Boneh (Ed.) , Vol. 2729 . Springer, Heidelberg, 126--144. Jan Camenisch and Victor Shoup. 2003. Practical Verifiable Encryption and Decryption of Discrete Logarithms. In CRYPTO 2003 (LNCS), Dan Boneh (Ed.), Vol. 2729. Springer, Heidelberg, 126--144."},{"key":"e_1_3_2_1_16_1","volume-title":"CRYPTO'97 (LNCS)","author":"Camenisch Jan","unstructured":"Jan Camenisch and Markus Stadler . 1997. Efficient Group Signature Schemes for Large Groups (Extended Abstract) . In CRYPTO'97 (LNCS) , Burton S. Kaliski Jr. (Ed.), Vol. 1294 . Springer , Heidelberg , 410--424. Jan Camenisch and Markus Stadler. 1997. Efficient Group Signature Schemes for Large Groups (Extended Abstract). In CRYPTO'97 (LNCS), Burton S. Kaliski Jr. (Ed.), Vol. 1294. Springer, Heidelberg, 410--424."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586114"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484361"},{"key":"e_1_3_2_1_20_1","volume-title":"CRYPTO'94 (LNCS)","author":"Cramer Ronald","unstructured":"Ronald Cramer , Ivan Damg\u00e5rd , and Berry Schoenmakers . 1994. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols . In CRYPTO'94 (LNCS) , Yvo Desmedt (Ed.), Vol. 839 . Springer , Heidelberg , 174--187. Ronald Cramer, Ivan Damg\u00e5rd, and Berry Schoenmakers. 1994. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In CRYPTO'94 (LNCS), Yvo Desmedt (Ed.), Vol. 839. Springer, Heidelberg, 174--187."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756211"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352889"},{"key":"e_1_3_2_1_23_1","volume-title":"Workshop on Economics of Peer-to-Peer Systems","volume":"92","author":"Dingledine Roger","year":"2003","unstructured":"Roger Dingledine , Nick Mathewson , and Paul Syverson . 2003 . Reputation in P2P Anonymity Systems . In Workshop on Economics of Peer-to-Peer Systems , Vol. 92 . Roger Dingledine, Nick Mathewson, and Paul Syverson. 2003. Reputation in P2P Anonymity Systems. In Workshop on Economics of Peer-to-Peer Systems, Vol. 92."},{"key":"e_1_3_2_1_24_1","volume-title":"CRYPTO'86 (LNCS), Andrew M","author":"Fiat Amos","unstructured":"Amos Fiat and Adi Shamir . 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems . In CRYPTO'86 (LNCS), Andrew M . Odlyzko (Ed.), Vol. 263 . Springer , Heidelberg , 186--194. Amos Fiat and Adi Shamir. 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO'86 (LNCS), Andrew M. Odlyzko (Ed.), Vol. 263. Springer, Heidelberg, 186--194."},{"key":"e_1_3_2_1_26_1","volume-title":"CREDENTIAL: A Framework for Privacy-Preserving Cloud-Based Data Sharing","author":"H\u00f6randner Felix","year":"2016","unstructured":"Felix H\u00f6randner , Stephan Krenn , Andrea Migliavacca , Florian Thiemer , and Bernd Zwattendorfer . 2016 . CREDENTIAL: A Framework for Privacy-Preserving Cloud-Based Data Sharing . In ARES. IEEE Computer Society , 742--749. Felix H\u00f6randner, Stephan Krenn, Andrea Migliavacca, Florian Thiemer, and Bernd Zwattendorfer. 2016. CREDENTIAL: A Framework for Privacy-Preserving Cloud-Based Data Sharing. In ARES. IEEE Computer Society, 742--749."},{"key":"e_1_3_2_1_27_1","volume-title":"The Beta Reputation System. In BLED","author":"J\u00f8sang Audun","year":"2002","unstructured":"Audun J\u00f8sang and Roslan Ismail . 2002 . The Beta Reputation System. In BLED 2002. 41--55. Audun J\u00f8sang and Roslan Ismail. 2002. The Beta Reputation System. In BLED 2002. 41--55."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775242"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098954.3104061"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72738-5_17"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_3_2_1_33_1","volume-title":"U-Prove Cryptographic Specification V1.1 (Revision 3). (December","author":"Paquin Christian","year":"2013","unstructured":"Christian Paquin and Greg Zaverucha . 2013. U-Prove Cryptographic Specification V1.1 (Revision 3). (December 2013 ). https:\/\/www.microsoft.com\/en-us\/research\/publication\/u-prove-cryptographic-specification-v1-1-revision-3\/ Christian Paquin and Greg Zaverucha. 2013. U-Prove Cryptographic Specification V1.1 (Revision 3). (December 2013). https:\/\/www.microsoft.com\/en-us\/research\/publication\/u-prove-cryptographic-specification-v1-1-revision-3\/"},{"key":"e_1_3_2_1_34_1","volume-title":"CRYPTO'91 (LNCS)","author":"Pedersen Torben P.","unstructured":"Torben P. Pedersen . 1992. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing . In CRYPTO'91 (LNCS) , Joan Feigenbaum (Ed.), Vol. 576 . Springer , Heidelberg , 129--140. Torben P. Pedersen. 1992. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO'91 (LNCS), Joan Feigenbaum (Ed.), Vol. 576. Springer, Heidelberg, 129--140."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_7"},{"key":"e_1_3_2_1_38_1","volume-title":"Attribute-based Credentials for Trust: Identity in the Information Society","author":"Rannenberg Kai","unstructured":"Kai Rannenberg , Jan Camenisch , and Ahmad Sabouri . 2014. Attribute-based Credentials for Trust: Identity in the Information Society . Springer . Kai Rannenberg, Jan Camenisch, and Ahmad Sabouri. 2014. Attribute-based Credentials for Trust: Identity in the Information Society. Springer."},{"key":"e_1_3_2_1_39_1","volume-title":"PRISMACLOUD - PRIvacy and Security MAintaining services in the CLOUD. (April","author":"European Union's","year":"2018","unstructured":"European Union's Horizon 2020 research and innovation programme. 2018. PRISMACLOUD - PRIvacy and Security MAintaining services in the CLOUD. (April 2018 ). https:\/\/prismacloud.eu\/ European Union's Horizon 2020 research and innovation programme. 2018. PRISMACLOUD - PRIvacy and Security MAintaining services in the CLOUD. (April 2018). https:\/\/prismacloud.eu\/"},{"key":"e_1_3_2_1_40_1","unstructured":"European Union's Horizon 2020 research and innovation programme CREDENTIAL. 2018. CREDENTIAL. (April 2018). https:\/\/credential.eu\/  European Union's Horizon 2020 research and innovation programme CREDENTIAL. 2018. CREDENTIAL. (April 2018). https:\/\/credential.eu\/"},{"key":"e_1_3_2_1_41_1","volume-title":"Some efficient zeroknowledge proof techniques. (March","author":"Schoenmakers Berry","year":"2001","unstructured":"Berry Schoenmakers . 2001. Some efficient zeroknowledge proof techniques. (March 2001 ). Slides presented at the International Workshop on Cryptographic Protocols . Berry Schoenmakers. 2001. Some efficient zeroknowledge proof techniques. (March 2001). Slides presented at the International Workshop on Cryptographic Protocols."},{"key":"e_1_3_2_1_42_1","volume-title":"Qiuliang Xu, and Zuoxia Yu.","author":"Yang Rupeng","year":"2017","unstructured":"Rupeng Yang , Man Ho Au , Qiuliang Xu, and Zuoxia Yu. 2017 . Decentralized Black-listable Anonymous Credentials with Reputation. Cryptology ePrint Archive, Report 2017\/389. (2017). http:\/\/eprint.iacr.org\/2017\/389. Rupeng Yang, Man Ho Au, Qiuliang Xu, and Zuoxia Yu. 2017. Decentralized Black-listable Anonymous Credentials with Reputation. Cryptology ePrint Archive, Report 2017\/389. (2017). http:\/\/eprint.iacr.org\/2017\/389."}],"event":{"name":"ARES 2018: International Conference on Availability, Reliability and Security","location":"Hamburg Germany","acronym":"ARES 2018","sponsor":["Universit\u00e4t Hamburg Universit\u00e4t Hamburg"]},"container-title":["Proceedings of the 13th International Conference on Availability, Reliability and Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230833.3234517","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3230833.3234517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:08:13Z","timestamp":1750212493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230833.3234517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,27]]},"references-count":36,"alternative-id":["10.1145\/3230833.3234517","10.1145\/3230833"],"URL":"https:\/\/doi.org\/10.1145\/3230833.3234517","relation":{},"subject":[],"published":{"date-parts":[[2018,8,27]]},"assertion":[{"value":"2018-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}