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