Provably Secure Group Signature Schemes From Code-Based Assumptions
From MaRDI portal
Publication:5124539
Recommendations
- A provably secure group signature scheme from code-based assumptions
- A code-based group signature scheme
- Public Key Cryptography – PKC 2004
- Provable secure dynamic group signature scheme
- scientific article; zbMATH DE number 1759783
- Information and Communications Security
- An efficient undeniable group-oriented signature scheme
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- Verifiably encrypted group signatures
- On the security of a convertible group signature scheme
Cited in
(13)- Zero-knowledge proofs for committed symmetric Boolean functions
- \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
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- Code-based signatures from new proofs of knowledge for the syndrome decoding problem
- A New Dynamic Code-Based Group Signature Scheme
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- Fully dynamic attribute-based signatures for circuits from codes
- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- On the traceability of group signatures: uncorrupted user must exist
- DGSP: an efficient scalable fully dynamic group signature scheme using \text{SPHINCS}\textsuperscript{+}
- Fuzzy matching template attacks on multivariate cryptography: a case study
This page was built for publication: Provably Secure Group Signature Schemes From Code-Based Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124539)
