Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes
From MaRDI portal
Publication:5087265
DOI10.1007/978-3-030-97121-2_15zbMath1492.94186OpenAlexW4214666867MaRDI QIDQ5087265
Aisling Connolly, Pascal Lafourcade, Octavio Perez Kempner
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_15
Related Items (3)
Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Attribute-based anonymous credential: optimization for single-use and multi-use ⋮ Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric
Cites Work
- Unnamed Item
- Unnamed Item
- More efficient (almost) tightly secure structure-preserving signatures
- Kurosawa-Desmedt meets tight security
- Signatures with flexible public key: introducing equivalence classes for public keys
- Weakly secure equivalence-class signatures from standard assumptions
- Efficient redactable signature and application to anonymous credentials
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Issuer-hiding attribute-based credentials
- Structure-preserving signatures on equivalence classes from standard assumptions
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Efficient invisible and unlinkable sanitizable signatures
- Delegatable anonymous credentials from mercurial signatures
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- An Algebraic Framework for Diffie-Hellman Assumptions
- (Hierarchical) Identity-Based Encryption from Affine Message Authentication
- Malleable Proof Systems and Applications
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Zero-Knowledge Accumulators and Set Algebra
- The Kernel Matrix Diffie-Hellman Assumption
- Constant-Size Commitments to Polynomials and Their Applications
- Randomizable Proofs and Delegatable Anonymous Credentials
- Practical Round-Optimal Blind Signatures in the Standard Model
- Structure-Preserving Signatures from Standard Assumptions, Revisited
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes
- Optimal Verification of Operations on Dynamic Sets
- Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
- Adaptive Partitioning
- Advances in Cryptology – CRYPTO 2004
- Topics in Cryptology – CT-RSA 2005
- Access Control Encryption for Equality, Comparison, and More
- On Signatures of Knowledge
- Efficient verifiable delay functions
This page was built for publication: Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes
