P-signatures and Noninteractive Anonymous Credentials
From MaRDI portal
Recommendations
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Advances in Cryptology – CRYPTO 2004
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Group Signatures
- Compact Group Signatures Without Random Oracles
Cited in
(50)- A formal concept of domain pseudonymous signatures
- On the impossibility of structure-preserving deterministic primitives
- Graded signatures
- Non-interactive anonymous router
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Somewhere statistically binding commitment schemes with applications
- Escrow free attribute-based signature with self-revealability
- Non-interactive keyed-verification anonymous credentials
- Delegatable anonymous credentials from mercurial signatures
- Efficient and secure attribute-based signature for monotone predicates
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Formal treatment of privacy-enhancing credential systems
- Towards lightweight anonymous entity authentication for IoT applications
- Pseudonymous signature on eIDAS Token -- implementation based privacy threats
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Round-optimal privacy-preserving protocols with smooth projective hash functions
- Structure-preserving signatures and commitments to group elements
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Generalizing efficient multiparty computation
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Non-interactive confirmer signatures
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Randomizable Proofs and Delegatable Anonymous Credentials
- Compact E-Cash and Simulatable VRFs Revisited
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Efficient Traceable Signatures in the Standard Model
- Universally Composable Adaptive Priced Oblivious Transfer
- Security of Direct Anonymous Authentication Using TPM 2.0 Signature
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Universally Composable Adaptive Oblivious Transfer
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Decentralized attribute-based signatures
- Privacy-preserving blueprints
- PAPR: publicly auditable privacy revocation for anonymous credentials
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- Credential transparency system
- NIWI and new notions of extraction for algebraic languages
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- Smooth zero-knowledge hash functions
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Efficient traceable signatures in the standard model
- On black-box knowledge-sound commit-and-prove SNARKs
- Set (non-)membership NIZKs from determinantal accumulators
- On structure-preserving cryptography and lattices
- Oblivious issuance of proofs
- Efficient succinct zero-knowledge arguments in the CL framework
- Malleable SNARKs and their applications
- Lattice-based group signatures in the standard model, revisited
This page was built for publication: P-signatures and Noninteractive Anonymous Credentials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445515)
