New code-based cryptographic accumulator and fully dynamic group signature
DOI10.1007/S10623-022-01007-5zbMath1504.94098OpenAlexW4210558206WikidataQ114849795 ScholiaQ114849795MaRDI QIDQ2099154
El Mamoun Souidi, Edoukou Berenger Ayebie
Publication date: 23 November 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01007-5
code-based cryptographypost-quantum cryptographydouble circulant codescryptographic accumulatorfully dynamic group signatureMerkle-tree
Linear codes (general theory) (94B05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Prefix, length-variable, comma-free codes (94A45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A code-based group signature scheme
- Security arguments for digital signatures and blind signatures
- Two mutual authentication protocols based on zero-knowledge proofs for RFID systems
- Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives
- Lattice-based universal accumulator with nonmembership arguments
- New code-based privacy-preserving cryptographic constructions
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Foundations of Fully Dynamic Group Signatures
- Universal Accumulators with Efficient Nonmembership Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Vector Commitments and Their Applications
- Progress in Cryptology – Mycrypt 2005
- A New Dynamic Code-Based Group Signature Scheme
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
This page was built for publication: New code-based cryptographic accumulator and fully dynamic group signature
