A New Dynamic Code-Based Group Signature Scheme
From MaRDI portal
Publication:5739046
DOI10.1007/978-3-319-55589-8_23zbMath1365.94398OpenAlexW2594624897MaRDI QIDQ5739046
El Mamoun Souidi, Berenger Edoukou Ayebie, Hafsa Assidi
Publication date: 1 June 2017
Published in: Codes, Cryptology and Information Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55589-8_23
code-based cryptographyMcEliece cryptosystemQC-MDPC codesdynamic group signatureGeneral Decoding problem
Related Items (3)
\textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme ⋮ Security analysis of DGM and GM group signature schemes instantiated with XMSS-T ⋮ New code-based cryptographic accumulator and fully dynamic group signature
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A code-based group signature scheme
- Improved identification schemes based on error-correcting codes
- Security arguments for digital signatures and blind signatures
- A Provably Secure Group Signature Scheme from Code-Based Assumptions
- Lattice-Based Group Signatures with Logarithmic Signature Size
- Extended Security Arguments for Signature Schemes
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
- A Group Signature Scheme from Lattice Assumptions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Group Signatures
- On the inherent intractability of certain coding problems (Corresp.)
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Group Signatures with Efficient Concurrent Join
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
- Topics in Cryptology – CT-RSA 2005
This page was built for publication: A New Dynamic Code-Based Group Signature Scheme
