摘要
在某些特殊应用中,如电子投票等系统要求可以确定两个或多个签名是否出自同一用户,具有可关联性的环签名方案可以实现这一功能。已有的可关联环签名方案只支持基于DL的公钥系统,该文基于离散对数和因数分解的难解性提出了一个可分的可关联门限环签名方案,可以同时支持基于DL和基于ID的公钥系统,参与方可以独立地选择公钥体制、系统参数及密钥,具有更广泛的实用性。
In some special applications, such as electronic voting schemes, the schemes can distinguish whether two or more different signatures are generated by the same signer or not. Linkable ring signature can realize the function. Previous linkable threshold ring signature schemes are constructed on the base of DL-based public key system. This paper proposes a separable linkable threshold ring signature scheme on the difficulty of DL problem and factoring, which allows the use of both DL-based and ID-based public keys at the same time. And the participants can choose public key system; system parameters and keys independently of each other. So it is more practical.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第23期158-160,共3页
Computer Engineering
基金
国家自然科学基金资助项目(10501053)
关键词
环签名
门限环签名
可关联性
可分性
ring signature
threshold ring signature
linkability
separability