New code-based cryptographic accumulator and fully dynamic group signature
From MaRDI portal
Publication:2099154
Recommendations
Cites work
- A code-based group signature scheme
- A New Dynamic Code-Based Group Signature Scheme
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Dynamic accumulators and application to efficient revocation of anonymous credentials
- Foundations of fully dynamic group signatures
- Fractal Merkle tree representation and traversal
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Lattice-based universal accumulator with nonmembership arguments
- New code-based privacy-preserving cryptographic constructions
- One-way accumulators: A decentralized alternative to digital signatures
- Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives
- Progress in Cryptology – Mycrypt 2005
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Security arguments for digital signatures and blind signatures
- Two mutual authentication protocols based on zero-knowledge proofs for RFID systems
- Universal Accumulators with Efficient Nonmembership Proofs
- Vector commitments and their applications
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
Cited in
(4)
This page was built for publication: New code-based cryptographic accumulator and fully dynamic group signature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099154)