Implementation of a Revocable Group Signature Scheme with Compact Revocation List Using Accumulator

被引:0
作者
Begum, Nasima [1 ]
Nakanishi, Toru [2 ]
Sadiah, Shahidatul [2 ]
Islam, Md. Ezharul [3 ]
机构
[1] Manarat Int Univ, Dhaka, Bangladesh
[2] Hiroshima Univ, Grad Sch Engn, Hiroshima, Japan
[3] Jahangirnagar Univ, Dhaka, Bangladesh
来源
2016 FOURTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR) | 2016年
关键词
Authentication; Anonymity; Group signatures; Revocation;
D O I
10.1109/CANDAR.2016.63
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A group signature scheme allows a user to anonymously sign a message on behalf of a group. One of important issues in group signature schemes is the user revocation. Previously, Libert et al. proposed an elegant revocable group signature scheme with O(1) signing/verification costs, O(1) signature size, O(1) membership certificate size, and O(log..) public key size, where N is the number of group members. However, the revocation list (RL) size is O(R), where R is the number of revoked members. Due to O(R) signatures in the RL, the RL size amounts to 8 MB in case of R = 10, 000. Then, a revocable group signature scheme with O(R/T) RL size was previously proposed for an integer parameter T, by accumulating T entries in the RL. Thus, we can expect that the delay time for a signer to fetch the RL is reduced in mobile environment. As the trade-off, the signing cost is increased by O(T). However, this scheme with the compact RL has not been implemented yet, and the practicality on the computation times for concrete T is unknown. In this paper, we implemented the scheme with the compact RL, and explore the practicality, where the signing time is greatly reduced by the technique to reduce the witness computation for the accumulator shown in the previous paper. From the experimental results, the signing and verification times are less than 500 ms and 900 ms even for T = 100, and thus we can confirm that the implemented scheme is practical, and the accumulating technique in the implemented scheme is sufficiently effective.
引用
收藏
页码:610 / 615
页数:6
相关论文
共 16 条
[1]  
Abe Masayuki., 2010, Cryptology ePrint Archive
[2]   Fast Ate Pairing Computation of Embedding Degree 12 Using Subfield-Twisted Elliptic Curve [J].
Akane, Masataka ;
Nogami, Yasuyuki ;
Morikawa, Yoshitaka .
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2009, E92A (02) :508-516
[3]  
Begum N., 2012, INT C INF SECUR CRYP, P495
[4]   Short group signatures [J].
Boneh, D ;
Boyen, X ;
Shacham, H .
ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 :41-55
[5]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P56
[6]  
Boneh D., 2004, CCS 04, P168, DOI DOI 10.1145/1030083.1030106
[7]  
Camenisch J, 2002, LECT NOTES COMPUT SC, V2442, P61
[8]  
Groth J, 2006, LECT NOTES COMPUT SC, V4284, P444
[9]  
Groth J, 2008, LECT NOTES COMPUT SC, V4965, P415
[10]  
Kiltz E, 2006, LECT NOTES COMPUT SC, V3876, P581