Randomizable Proofs and Delegatable Anonymous Credentials
From MaRDI portal
Recommendations
- Delegatable anonymous credentials from mercurial signatures
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- P-signatures and Noninteractive Anonymous Credentials
- Revocation for delegatable anonymous credentials
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
Cited in
(57)- Delegatable attribute-based anonymous credentials from dynamically malleable signatures
- Anonymous credential system with efficient proofs for monotone formulas on attributes
- Transferable e-cash: a cleaner model and the first practical instantiation
- Lattice-based blind signatures, revisited
- Two-sided malicious security for private intersection-sum with cardinality
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Another look at extraction and randomization of Groth's zk-SNARK
- Issuer-hiding attribute-based credentials
- Gemini: elastic SNARKs for diverse environments
- Fully homomorphic NIZK and NIWI proofs
- Delegatable anonymous credentials from mercurial signatures
- Efficient fully structure-preserving signatures and shrinking commitments
- Short tightly secure signatures for signing a vector of group elements: a new approach
- Efficient and secure attribute-based signature for monotone predicates
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Recovering lost device-bound credentials
- Composable and modular anonymous credentials: definitions and practical constructions
- Hierarchical identities from group signatures and pseudonymous signatures
- Formal treatment of privacy-enhancing credential systems
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Achieving optimal anonymity in transferable e-cash with a judge
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Revocation for delegatable anonymous credentials
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Compact E-Cash and Simulatable VRFs Revisited
- Efficient Traceable Signatures in the Standard Model
- Structure-preserving signatures from standard assumptions, revisited
- A new approach to efficient revocable attribute-based anonymous credentials
- Decentralized attribute-based signatures
- Tagged one-time signatures: tight security and optimal tag size
- Efficient completely context-hiding quotable and linearly homomorphic signatures
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Extendable threshold ring signatures with enhanced anonymity
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Obtaining simulation extractable NIZKs in the updatable CRS model generically
- Hierarchical Attribute-Based Signatures
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Efficient traceable signatures in the standard model
- Auditable attribute-based credentials scheme and its application in contact tracing
- Threshold structure-preserving signatures
- zk-SNARKs from codes with rank metrics
- On proving equivalence class signatures secure from non-interactive assumptions
- Oblivious issuance of proofs
- Updatable privacy-preserving blueprints
- Delegatable anonymous credentials from mercurial signatures with stronger privacy
- On security proofs of existing equivalence class signature schemes
- Unclonable non-interactive zero-knowledge
- Foundations of anonymous signatures: formal definitions, simplified requirements, and a construction based on general assumptions
- Non-interactive zero-knowledge arguments with certified deletion
- \textsf{Spectra}: interval-agnostic vector range argument for unstructured range assertions
- On quantum simulation-soundness
This page was built for publication: Randomizable Proofs and Delegatable Anonymous Credentials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183560)
