Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
From MaRDI portal
Publication:5087265
DOI10.1007/978-3-030-97121-2_15zbMATH Open1492.94186OpenAlexW4214666867MaRDI QIDQ5087265FDOQ5087265
Authors: 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
Recommendations
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Weakly secure equivalence-class signatures from standard assumptions
- Formal treatment of privacy-enhancing credential systems
- Delegatable anonymous credentials from mercurial signatures
Cites Work
- Title not available (Why is that?)
- Optimal verification of operations on dynamic sets
- Topics in Cryptology – CT-RSA 2005
- Efficient concurrent zero-knowledge in the auxiliary string model
- Malleable proof systems and applications
- Advances in Cryptology – CRYPTO 2004
- Randomizable Proofs and Delegatable Anonymous Credentials
- On Signatures of Knowledge
- An algebraic framework for Diffie-Hellman assumptions
- (Hierarchical) identity-based encryption from affine message authentication
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- 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
- Structure-preserving signatures on equivalence classes from standard assumptions
- Structure-preserving signatures from standard assumptions, revisited
- Efficient verifiable delay functions
- More efficient (almost) tightly secure structure-preserving signatures
- The kernel matrix Diffie-Hellman assumption
- Kurosawa-Desmedt meets tight security
- Stretching Groth-Sahai: NIZK proofs of partial satisfiability
- Adaptive partitioning
- Composable and modular anonymous credentials: definitions and practical constructions
- Practical Round-Optimal Blind Signatures in the Standard Model
- Constant-Size Commitments to Polynomials and Their Applications
- Signatures with flexible public key: introducing equivalence classes for public keys
- Weakly secure equivalence-class signatures from standard assumptions
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Efficient redactable signature and application to anonymous credentials
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Access Control Encryption for Equality, Comparison, and More
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Efficient invisible and unlinkable sanitizable signatures
- Issuer-hiding attribute-based credentials
- Delegatable anonymous credentials from mercurial signatures
- Zero-Knowledge Accumulators and Set Algebra
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
Cited In (12)
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System
- Selective delegation of attributes in mercurial signature credentials
- Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Breaking and fixing anonymous credentials for the cloud
- Attribute-based anonymous credential: optimization for single-use and multi-use
- On proving equivalence class signatures secure from non-interactive assumptions
- Formal treatment of privacy-enhancing credential systems
- A new approach to efficient revocable attribute-based anonymous credentials
- Auditable attribute-based credentials scheme and its application in contact tracing
This page was built for publication: Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087265)
