Provably Secure Group Signature Schemes From Code-Based Assumptions

DOI10.1109/TIT.2020.2976073zbMath1448.94242OpenAlexW3007043454WikidataQ114628642 ScholiaQ114628642MaRDI QIDQ5124539

Hyung Tae Lee, Khoa Nguyen, Huaxiong Wang, San Ling, Martianus Frederic Ezerman

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2020.2976073

zbMATH Keywords

code-based cryptographyprovably secure group signature schemes

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

\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 ⋮ Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Fully dynamic attribute-based signatures for circuits from codes ⋮ Fuzzy matching template attacks on multivariate cryptography: a case study ⋮ Zero-knowledge proofs for committed symmetric Boolean functions

This page was built for publication: Provably Secure Group Signature Schemes From Code-Based Assumptions