Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
From MaRDI portal
Publication:6584313
DOI10.3934/amc.2022077MaRDI QIDQ6584313
Publication date: 6 August 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
code-based cryptographygroup signaturespost-quantum cryptographysyndrome decoding problemMerkle-tree
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94) Privacy of data (68P27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A code-based group signature scheme
- Semantic security for the McEliece cryptosystem without random oracles
- New code-based privacy-preserving cryptographic constructions
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- A Provably Secure Group Signature Scheme from Code-Based Assumptions
- Foundations of Fully Dynamic Group Signatures
- A Lattice-Based Group Signature Scheme with Message-Dependent Opening
- Lattice-Based Group Signatures with Logarithmic Signature Size
- Scalable Group Signatures with Revocation
- Simpler Efficient Group Signatures from Lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A Group Signature Scheme from Lattice Assumptions
- A new paradigm for public key identification
- Compact Group Signatures Without Random Oracles
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Group Signatures
- On the inherent intractability of certain coding problems (Corresp.)
- Provably Secure Group Signature Schemes From Code-Based Assumptions
- Advances in Cryptology – CRYPTO 2004
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Topics in Cryptology – CT-RSA 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
- Advances in Cryptology - ASIACRYPT 2003
This page was built for publication: Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting