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

Nasima Begum, T. Nakanishi, Shahidatul Sadiah, Md. Ezharul Islam
{"title":"Implementation of a Revocable Group Signature Scheme with Compact Revocation List Using Accumulator","authors":"Nasima Begum, T. Nakanishi, Shahidatul Sadiah, Md. Ezharul Islam","doi":"10.1109/CANDAR.2016.0110","DOIUrl":null,"url":null,"abstract":"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 N) 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.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CANDAR.2016.0110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

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 N) 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.
利用累加器实现具有紧凑吊销列表的可撤销群签名方案
组签名方案允许用户代表组对消息进行匿名签名。群签名方案中的一个重要问题是用户撤销问题。此前,Libert等人提出了一种优雅的可撤销群签名方案,其签名/验证成本为O(1),签名大小为O(1),成员证书大小为O(1),公钥大小为O(log N),其中N为组成员数。但是,撤销列表(RL)大小为0 (R),其中R是被撤销成员的数量。由于RL中有0 (R)个签名,当R=10,000时,RL的大小为8mb。然后,通过累积RL中的T个条目,对整数参数T提出了一个RL大小为0 (R/T)的可撤销群签名方案。因此,我们可以预期在移动环境中签名者获取RL的延迟时间会减少。作为权衡,签约成本增加了O(T)。然而,这种具有紧凑RL的方案尚未实现,对于具体T的计算次数的实用性尚不清楚。在本文中,我们使用紧凑的RL实现了该方案,并探索了其实用性,其中通过减少前一篇文章中所示的累加器的见证计算的技术大大减少了签名时间。从实验结果来看,即使在T=100的情况下,签名和验证时间也小于500 ms和900 ms,从而可以证实所实现方案的实用性,并且所实现方案中的累积技术是足够有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信