• Citer

Code-Based Fully Dynamic Accountable Ring Signatures and Group Signatures Using the Helper Methodology

par Bhattacharyya, Rishiraj;Kollath, Sreehari;Petit, Christophe
Référence Lecture notes in computer science, 15659 LNCS, page (84-103)
Publication Publié, 2025-01-01

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

In this paper, we propose an efficient code-based accountable ring signature scheme based on the proof with helper paradigm. Our main technical contribution is a zero-knowledge OR proof based on the helper protocol of Beullens (Eurocrypt 2020). Combined with the Niederreiter encryption scheme, we leverage the framework of Beullens et al. (Eurocrypt 2022) to construct our accountable ring signature. We apply our construction to develop a code-based dynamic group signature scheme that simultaneously achieves a logarithmic signature size and the strongest security notion for full anonymity and unforgeability. Our construction results in a relatively short group signatures—just 51kB for a group of 220 members at the 128-bit security level—while maintaining the strongest security guarantees. In comparison, two recent code-based group signature schemes proposed at PKC 2024 and Asiacrypt 2024 achieve signature sizes of 146kB and 124kB, respectively, for the same number of users.