Practical dynamic group signatures without knowledge extractors
From MaRDI portal
Recommendations
Cites work
- A classification of computational assumptions in the algebraic group model
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Adaptive proofs of knowledge in the random oracle model
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Constructing elliptic curves with prescribed embedding degrees
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Dynamic fully anonymous short group signatures
- Efficient group signature schemes for large groups. (Extended abstract)
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Foundations of fully dynamic group signatures
- Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions
- Foundations of group signatures: the case of dynamic groups
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Fully Anonymous Group Signatures Without Random Oracles
- Get shorty via group signatures without encryption
- Group signature without random oracles from randomizable signatures
- Group signatures
- Group Signatures with Efficient Concurrent Join
- Group Signatures: Better Efficiency and New Theoretical Aspects
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- On the Non-malleability of the Fiat-Shamir Transform
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Pairings for cryptographers
- Public-key cryptosystems based on composite degree residuosity classes
- Security arguments for digital signatures and blind signatures
- Short accountable ring signatures based on DDH
- Short group signatures
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Short randomizable signatures
- Short threshold dynamic group signatures
- Signature schemes and anonymous credentials from bilinear maps
- Signatures from sequential-OR proofs
- Strengthening zero-knowledge protocols using signatures
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- The algebraic group model and its applications
- The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols
- Tightly-secure signatures from lossy identification schemes
- Towards practical public key systems secure against chosen ciphertext attacks
Cited in
(4)
This page was built for publication: Practical dynamic group signatures without knowledge extractors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692957)