New code-based cryptographic accumulator and fully dynamic group signature

DOI10.1007/S10623-022-01007-5MaRDI QIDQ2099154zbMATH OpenOpenAlexWikidataFDO

Authors Edoukou Berenger Ayebie, El Mamoun Souidi

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

zbMATH Keywords

code-based cryptographycryptographic accumulatordouble circulant codesfully dynamic group signatureMerkle-treepost-quantum cryptography

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05)

Recommendations

• A New Dynamic Code-Based Group Signature Scheme
• A code-based group signature scheme
• A provably secure group signature scheme from code-based assumptions
• A practical group signature scheme based on rank metric
• New code-based privacy-preserving cryptographic constructions

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
• Foundations of fully dynamic group signatures
• scientific article; zbMATH DE number 1942413 (Why is no real title available?)
• scientific article; zbMATH DE number 1962159 (Why is no real title available?)
• scientific article; zbMATH DE number 1394309 (Why is no real title available?)
• 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
• 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)

• New code-based privacy-preserving cryptographic constructions
• A New Dynamic Code-Based Group Signature Scheme
• Short code-based one-out-of-many proofs and applications
• Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs

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)