群签名方案的效率分析

Efficiency Analysis on Group Signature Schemes

自1991年群签名的概念由Chaum与vanHeyst提出以来,群签名因其显著的特性引起人们的广泛关注。许多群签名方案及基于群签名方案的密码协议被提出。但是,群签名方案的效率是一个棘手问题。为使群签名同时具有匿名性与可追踪性(发生争议时可打开),群签名的执行效率往往比较低下。因此,群签名方案的效率分析便成为一个令人感兴趣的课题。该文对3个典型群签名方案进行了效率分析。结果显示,Ateniese等人在CRYPTO’2000上提出的群签名方案具有较为优越的效率与安全特性,以该方案为基础构造各种密码协议可能会达到较好性能。

Since the concept of group signature schemes was introduced by Chaum and van Heyst in 1991,the salient features of group signatures make them remarkable for research.Many group signature schemes and cryptographical protocols based on group signature schemes have been proposed from then on.However,the efficiency of group signature schemes is always an intractable problem.Though providing both anonymity and traceability(which means signatures can be opened in dispute cases),most group signature schemes achieve these features at the cost of performing efficiency.So,making efficiency analysis on group signature schemes has come into an attractive task.In this paper,we make efficiency analysis on three typical group signature schemes.As a result,we conclude that the scheme proposed by Ateniese at al.in CRYPTO'2000 is particularly efficient and provably secure,and maybe it can be used as an efficient building block for other cryptographical protocols.