Paper 2025/760

DGSP: An Efficient Scalable Fully Dynamic Group Signature Scheme Using $\rm{SPHINCS}^+$

Seyyed Arash Azimi, CPS2 Lab, Electrical Engineering Department, Shahid Rajaee Teacher Training University, Tehran, Iran

Sabyasachi Karati, Cryptology and Security Research Unit, Indian Statistical Institute, Kolkata, India

Samuel Jaques, Department of Combinatorics & Optimization, University of Waterloo, Canada

Abstract

A group signature scheme enables users of a group to anonymously sign messages on behalf of the group, while a designated authority can revoke anonymity when needed to ensure user accountability. Among group signature schemes, fully dynamic ones are particularly desirable as they allow new users to join and misbehaved existing users to be revoked without requiring system-wide updates. This paper introduces DGSP, a post-quantum fully dynamic group signature scheme that addresses key limitations of existing schemes like DGMT and SPHINX-in-the-Head (SITH). Leveraging the properties of ${\rm SPHINCS}^+$, DGSP achieves a superior balance between scalability and efficiency by (i) supporting up to $2^{60}$ users, (ii) requiring negligible setup time, and (iii) featuring efficient algorithms with short signatures of constant-size. Notably, while DGMT is limited to $2^{15}$ users, DGSP extends this to $2^{60}$ while keeping signatures compact—only 3.03 to 4.93 times larger than those of DGMT, yet just 0.021 to 0.004 times the size of SITH signatures. This makes DGSP a compelling solution for applications requiring both large-scale user support and signature efficiency in the post-quantum setting. Moreover, DGSP strengthens managerial accountability compared to DGMT by (i) enabling users to verify their certificates generated by the manager and (ii) ensuring public verifiability of the manager's signature attribution. Although SITH claims to support $2^{60}$ users, our analysis reveals that its opening algorithm is highly inefficient, making it impractical to handle such a large number of users. Our security analysis shows that DGSP achieves unforgeability, anonymity, and traceability in the standard model. We also provide a complete implementation of DGSP. Our experimental study exhibits that DGSP is superior over existing schemes in terms of efficiency and scalability.

Note: This manuscript is the extended version of ``DGSP: An Efficient Scalable Fully Dynamic Group Signature Scheme Using $\rm{SPHINCS}^+$," which published in the proceedings of EUROCRYPT~2026 by Springer-Verlag, available at \url{https://doi.org/10.1007/978-3-032-25330-9_16}. It includes the full security proofs and additional exposition on $\rm{SPHINCS}^+$.

@misc{cryptoeprint:2025/760,
      author = {Mojtaba Fadavi and Seyyed Arash Azimi and Sabyasachi Karati and Samuel Jaques},
      title = {{DGSP}: An Efficient Scalable Fully Dynamic Group Signature Scheme Using $\rm{{SPHINCS}}^+$},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/760},
      year = {2025},
      url = {https://eprint.iacr.org/2025/760}
}