Dynamic group signature scheme using ideal lattices
by M.H. Abhilash; B.B. Amberker
International Journal of Information and Computer Security (IJICS), Vol. 22, No. 1, 2023

Abstract: Group signature scheme is a cryptographic primitive that allows its registered group members to generate signatures on behalf of the whole group without revealing their identity. Ling et al. (2018) proposed the first constant size group signature scheme using ideal lattices, where signatures size is independent of number of users N in the group. This is a partial dynamic scheme that supports only registration of new users. It does not allow revocation of group users. In this paper, we construct an ideal lattice based constant size dynamic group signature scheme that supports both revocation and registration. In addition, an efficient revocation technique based on time bound signing keys is proposed to reduce the verification cost. The security of the proposed scheme is proved in the random oracle model based on the hardness of ring short integer solution (RSIS) and ring learning with errors (RLWEs) assumptions.

Online publication date: Thu, 14-Sep-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com