摘要
针对标准模型下环签名存在的双线性对运算过多和多已知签名存在伪造攻击的问题,提出了一个新的高效高安全环签名方案。在减少公共参数的基础上为每个环成员引入一个包含秘密值的哈希函数,使其达到最强安全要求且具有无条件匿名性。与现有标准模型下基于身份的环签名相比,对于有n个成员的环,签名验证时只需要2次双线性对运算,无需预运算,较大地提高了效率。
The ring signatures in the standard model have too many pairings and multiple-known-signature encounters forgery attack,so a new efficient and safe ring signature was proposed.On the basis of reducing public parameters,a Hash function with secret was introduced into every member,so it achieved the best safety requirements and had the unconditional anonymity.Compared with the existing identity-based ring signature schemes in the standard model,for n members of a ring,the signature only needs two pairings to verify without pre-operation,thus it can greatly improve the efficiency.
出处
《计算机应用》
CSCD
北大核心
2012年第7期2015-2017,2026,共4页
journal of Computer Applications