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

DOI10.3934/AMC.2022077MaRDI QIDQ6584313zbMATH OpenFDO

Authors Jayashree Dey, Ratna Dutta

Publication date 6 August 2024

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

zbMATH Keywords

code-based cryptographygroup signaturespost-quantum cryptographysyndrome decoding problemMerkle-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)

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

Cites work

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

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)