A new approach to efficient revocable attribute-based anonymous credentials
From MaRDI portal
Publication:3460098
DOI10.1007/978-3-319-27239-9_4zbMATH Open1376.94031OpenAlexW2397797004MaRDI QIDQ3460098FDOQ3460098
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
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
- Universal Accumulators with Efficient Nonmembership Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- Efficient pairings and ECC for embedded systems
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- Randomizable Proofs and Delegatable Anonymous Credentials
- Security Analysis of the Strong Diffie-Hellman Problem
- Title not available (Why is that?)
- The Uber-Assumption Family
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Composable and modular anonymous credentials: definitions and practical constructions
- An Efficient Anonymous Credential System
- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System
- Formal treatment of privacy-enhancing credential systems
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Title not available (Why is that?)
Cited In (9)
- ARBRA: Anonymous Reputation-Based Revocation with Efficient Authentication
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System
- Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric
- Solving revocation with efficient update of anonymous credentials
- 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
Uses Software
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)
