摘要
通过巧妙设置公共参数,提出一种新的基于身份的高效环签名方案,利用签名参数和身份的线性关系减少验证时双线性对的个数。在标准模型下证明其能抵抗签名伪造攻击,且具有无条件匿名性。与现有标准模型下基于身份的环签名方案相比,对于n个成员的环,签名验证仅需要2个双线性对运算,因此签名验证效率有很大提高。
A new efficient identify-based ring signature scheme was proposed by skillfully setting public parameters. It can reduce the bilinear pairings needed in verifying phase by using liner relations between signature parameters and identify. It is proved to be unforgeable in the standard model,and is unconditionally anonymous. Compared with the existing attribute-based ring signature scheme,for a ring of n members,the signature only requires 2 pairings to verify. Thus the efficiency of verifying the signature improves greatly.
出处
《计算机应用》
CSCD
北大核心
2009年第11期2990-2992,2997,共4页
journal of Computer Applications
