摘要
针对现有基于身份环签名方案签名长度过长、安全性不高等问题,利用椭圆曲线双线性对技术,文中提出了一种新的基于身份环签名方案,在标准模型下证明了其能抵抗适应性选择消息攻击,并且具有无条件匿名性.新方案签名长度达到了固定值,并且算法只需要三个双线性对运算.与现有的标准模型下基于身份环签名方案相比,该方案占用通信带宽低,计算效率高,安全性强,因此能更好地满足应用要求.
Aiming at the efficiency and security weaknesses that exist in the identity-based ring signature schemes, using the method of bilinear pairing, this paper propose a new construction of identity-based ring signature scheme. This scheme is existentially unforgeable against adaptive chosen message attacks in the standard model, and can achieve unconditional anonymity. The new scheme, with constant size signatures, only needs three pairing operations. Compared with other existing schemes, this construction can provide better efficiency in terms of the communica- tion cost and computation cost as well as the security guarantee, thus it can more satisfy the application requirements.
出处
《计算机学报》
EI
CSCD
北大核心
2012年第9期1874-1880,共7页
Chinese Journal of Computers
基金
国家自然科学基金(61170278
91118006)
河南省重点科技攻关项目(092101210502)
信息安全国家重点实验室开放课题(01-02-8)资助~~
关键词
基于身份环签名
匿名性
双线性对
标准模型
identity-based ring signature
anonymity
bilinear pairing
standard model
