Paper Info
Title
A Revocable Group Signature Scheme With Scalability From Simple Assumptions And Its Implementation
Abstract
Group signatures are signatures providing signer anonymity where signers can produce signatures on behalf of the group that they belong to. Although such anonymity is quite attractive considering privacy issues, it is not trivial to check whether a signer has been revoked or not. Thus, how to revoke the rights of signers is one of the major topics in the research on group signatures. In particular, scalability, where the signing and verification costs and the signature size are constant in terms of the number of signers N, and other costs regarding signers are at most logarithmic in N, is quite important. In this paper, we propose a revocable group signature scheme which is currently more efficient compared to previous all scalable schemes. Moreover, our revocable group signature scheme is secure under simple assumptions (in the random oracle model), whereas all scalable schemes are secure under q-type assumptions. Finally, we implemented our scheme by employing the Barreto-Lynn-Scott curves over a 455-bit prime field (BLS455), and the Barreto-Naehrig curves over a 382-bit prime field (BN382), respectively, by using the RELIC library. We showed that the running times of our signing algorithm were approximately 21 ms (BLS455) and 17ms (BN382), and those of our verification algorithm were approximately 31 ms (BLS455) and 24 ms (BN382), respectively.
Year
DOI
Venue
2018
10.1007/978-3-319-99136-8_24
INFORMATION SECURITY (ISC 2018)
Field
DocType
Volume
Prime field,Computer science,Random oracle,Theoretical computer science,Group signature,Anonymity,Logarithm,Scalability
Conference
11060
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
29
2
Name
Order
Citations
PageRank
Keita Emura131636.97
Takuya Hayashi243.88