Group Signatures with Efficient Concurrent Join
From MaRDI portal
Recommendations
Cited in
(23)- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- On the impossibility of structure-preserving deterministic primitives
- Foundations of fully dynamic group signatures
- An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users
- Practical dynamic group signatures without knowledge extractors
- Foundations of fully dynamic group signatures
- Structure-preserving signatures and commitments to group elements
- Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Group signatures are suitable for constrained devices
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Compact Group Signatures Without Random Oracles
- Unclonable Group Identification
- Unlinkable Randomizable Signature and Its Application in Group Signature
- Fully Anonymous Group Signatures Without Random Oracles
- Group Encryption
- Progress in Cryptology – Mycrypt 2005
- A New Dynamic Code-Based Group Signature Scheme
- Real Hidden Identity-Based Signatures
- Survey of lattice-based group signature
- Accumulating composites and improved group signing
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
This page was built for publication: Group Signatures with Efficient Concurrent Join
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385730)