A new approach to efficient revocable attribute-based anonymous credentials

DOI10.1007/978-3-319-27239-9_4MaRDI QIDQ3460098zbMATH OpenOpenAlexFDO

Authors David Derler, Christian Hanser, Daniel Slamanig

Publication date 12 January 2016

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-27239-9_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Formal treatment of privacy-enhancing credential systems
• Traceable constant-size multi-authority credentials
• Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
• Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
• Revocation for delegatable anonymous credentials

Cites work

• scientific article; zbMATH DE number 1722673 (Why is no real title available?)
• scientific article; zbMATH DE number 1942413 (Why is no real title available?)
• scientific article; zbMATH DE number 1952906 (Why is no real title available?)
• scientific article; zbMATH DE number 2081085 (Why is no real title available?)
• scientific article; zbMATH DE number 1394309 (Why is no real title available?)
• scientific article; zbMATH DE number 1440890 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• An Efficient Anonymous Credential System
• Composable and modular anonymous credentials: definitions and practical constructions
• Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
• Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System
• Efficient pairings and ECC for embedded systems
• Formal treatment of privacy-enhancing credential systems
• Randomizable Proofs and Delegatable Anonymous Credentials
• Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
• Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
• Security Analysis of the Strong Diffie-Hellman Problem
• Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
• The Uber-Assumption Family
• Topics in Cryptology – CT-RSA 2005
• Universal Accumulators with Efficient Nonmembership Proofs
• Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps

Cited in

(9)

• ARBRA: Anonymous Reputation-Based Revocation with Efficient Authentication
• Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System
• Solving revocation with efficient update of anonymous credentials
• Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Attribute-based anonymous credential: optimization for single-use and multi-use
• On proving equivalence class signatures secure from non-interactive assumptions
• Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
• Anonymous credential system with efficient proofs for monotone formulas on attributes

Describes a project that uses

Uses Software

• U-Prove

This page was built for publication: A new approach to efficient revocable attribute-based anonymous credentials

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