Solving revocation with efficient update of anonymous credentials

DOI10.1007/978-3-642-15317-4_28MaRDI QIDQ3588359zbMATH OpenOpenAlexFDO

Authors Jan Camenisch, Markulf Kohlweiss, Claudio Soriente

Publication date 10 September 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15317-4_28

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• An Efficient Anonymous Credential System
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• scientific article; zbMATH DE number 1722673
• A new approach to efficient revocable attribute-based anonymous credentials
• Revocation for delegatable anonymous credentials

Cited in

(14)

• \textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme
• scientific article; zbMATH DE number 1722673 (Why is no real title available?)
• Recovering lost device-bound credentials
• UC commitments for modular protocol design and applications to revocation and attribute tokens
• ARBRA: Anonymous Reputation-Based Revocation with Efficient Authentication
• An Efficient Anonymous Credential System
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• Information Security and Privacy
• PAPR: publicly auditable privacy revocation for anonymous credentials
• Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric
• Scored anonymous credentials
• Delegatable anonymous credentials from mercurial signatures with stronger privacy
• Unclonable non-interactive zero-knowledge
• Foundations of anonymous signatures: formal definitions, simplified requirements, and a construction based on general assumptions

This page was built for publication: Solving revocation with efficient update of anonymous credentials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588359)