Secure and efficient fully dynamic lattice-based group signature scheme
Cluster Computing · 2026-07 · 29 (7)
DOI: 10.1007/s10586-026-06186-7 ↗Kurz gefasst
Fachartikel in der Zeitschrift Cluster Computing, online erschienen am 02.07.2026. Verfasst von Vishal Pareek und 3 weiteren Autor:innen. Die Arbeit nennt 51 Literaturangaben. Gefördert von: Council of Scientific and Industrial Research, India, India, Ministry of Electronics and Information technology, India.
Abstract (Originalsprache)
Group signature is an interesting primitive of cryptography, enabling each group member to sign messages on behalf of the entire group anonymously. In the literature, most lattice-based group signatures are designed for static settings, hindering their practical efficiency and effectiveness. A practically feasible group signature scheme should prioritize user-friendliness. It should also provide flexibility in user enrollment and revocation while maintaining an appropriate signature size. Keeping these considerations in mind, we have developed a variant of a lattice-based fully dynamic group signature scheme. Our scheme does not rely on a trapdoor function, which reduces its operational complexity. In our scheme, we employ an updatable Merkle tree accumulator based on the shortest integer solution \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\textsf{SIS})$$\end{document} hardness. This ensures the security of a user’s identity and enables timely updates to user information as needed. We have presented the signature sizes for standard parameter settings under different security levels. Our results are also compared with existing similar schemes.
Förderung
- Council of Scientific and Industrial Research, India, India
- Ministry of Electronics and Information technology, India
Zitieren
APA
Pareek, V., Biswas, C., Gangopadhyay, A. K., & Gangopadhyay, S. (2026). Secure and efficient fully dynamic lattice-based group signature scheme. Cluster Computing, 29(7). https://doi.org/10.1007/s10586-026-06186-7
Vancouver
Pareek V, Biswas C, Gangopadhyay AK, Gangopadhyay S. Secure and efficient fully dynamic lattice-based group signature scheme. Cluster Computing. 2026;29(7). doi:10.1007/s10586-026-06186-7
BibTeX
@article{Pareek2026,
author = {Pareek, Vishal and Biswas, Chinmoy and Gangopadhyay, Aditi Kar and Gangopadhyay, Sugata},
title = {Secure and efficient fully dynamic lattice-based group signature scheme},
journal = {Cluster Computing},
year = {2026},
volume = {29},
number = {7},
doi = {10.1007/s10586-026-06186-7}
}
EUVIMED