Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
From MaRDI portal
Recommendations
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- P-signatures and Noninteractive Anonymous Credentials
- Cryptanalysis of the structure-preserving signature scheme on equivalence classes from Asiacrypt 2014
- Compact structure-preserving signatures with almost tight security
- Compact structure-preserving signatures with almost tight security
- More efficient (almost) tightly secure structure-preserving signatures
- Anonymizable signature and its construction from pairings
- Advances in Cryptology – CRYPTO 2004
Cited in
(30)- Non-interactive blind signatures for random messages
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Interactive threshold mercurial signatures and applications
- Delegatable anonymous credentials from mercurial signatures with stronger privacy
- Non-interactive blind signatures: post-quantum and stronger security
- On security proofs of existing equivalence class signature schemes
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- SoK: signatures with randomizable keys
- Unlinkable and invisible \(\gamma \)-sanitizable signatures
- Cryptanalysis of the structure-preserving signature scheme on equivalence classes from Asiacrypt 2014
- Weakly secure equivalence-class signatures from standard assumptions
- Access Control Encryption for Equality, Comparison, and More
- Selective delegation of attributes in mercurial signature credentials
- Logarithmic-size (linkable) threshold ring signatures in the plain model
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- On the limits of non-interactive blind signatures
- An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations
- On proving equivalence class signatures secure from non-interactive assumptions
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Efficient round-optimal blind signatures in the standard model
- Formal treatment of privacy-enhancing credential systems
- A new approach to efficient revocable attribute-based anonymous credentials
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Practical dynamic group signatures without knowledge extractors
- Generalised asynchronous remote key generation for pairing-based cryptosystems
- Zero-Knowledge Accumulators and Set Algebra
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Automated analysis of cryptographic assumptions in generic group models
This page was built for publication: Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938861)
