Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting

DOI10.3934/AMC.2022077MaRDI QIDQ6584313FDOQ6584313

Publication date: 6 August 2024

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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
DGM: a \underline{D}ynamic and revocable \underline{G}roup \underline{M}erkle signature
Lattice-based group signatures: achieving full dynamicity (and deniability) with ease

zbMATH Keywords

code-based cryptography group signatures post-quantum cryptography syndrome decoding problem Merkle-tree

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62) Privacy of data (68P27)

Cites Work

How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Title not available (Why is that?)
On the inherent intractability of certain coding problems (Corresp.)
Title not available (Why is that?)
Scalable group signatures with revocation
Compact Group Signatures Without Random Oracles
Group Signatures
Title not available (Why is that?)
Advances in Cryptology – CRYPTO 2004
Topics in Cryptology – CT-RSA 2005
Lattice-based group signatures with logarithmic signature size
Simpler efficient group signatures from lattices
Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
A Group Signature Scheme from Lattice Assumptions
A new paradigm for public key identification
Lattice-based group signature scheme with verifier-local revocation
Title not available (Why is that?)
Semantic security for the McEliece cryptosystem without random oracles
A provably secure group signature scheme from code-based assumptions
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
A code-based group signature scheme
Provably Secure Group Signature Schemes From Code-Based Assumptions
Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
Title not available (Why is that?)
A lattice-based group signature scheme with message-dependent opening
Title not available (Why is that?)
Foundations of fully dynamic group signatures
New code-based privacy-preserving cryptographic constructions
Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
A New Dynamic Code-Based Group Signature Scheme
Accumulating composites and improved group signing

This page was built for publication: Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584313)