摘要
在这篇文章里,我们用双线性对构造了一种无证书的环签名方案,并证明它是无条件匿名的,且在随机预言模型中,计算性Diffie-Hellman问题是难解的,我们方案在适应性选择消息攻击下是存在性不可伪造的,它的安全性比在基于身份的公钥密码体制下高.本文首次用多线性形式构造了一个基于身份的广播多重签名方案,它的安全性是基于计算性Diffie-Hellman困难问题.
In this paper, we propose a certificateless ring signature scheme, based on the bilinear pairings, which provides unconditional anonymity, and prove this scheme is existentially un forgeable under adaptive chose-message attacks, in the random oracle model, assuming that the computational Diffie-Hellman problem is hard to solve. We propose an ID-based broadcasting multisignature scheme from multilinear forms, and its security bases on the hardness of the computational Diffie-Hellman problem.
出处
《数学研究》
CSCD
2006年第2期155-163,共9页
Journal of Mathematical Study
基金
厦门大学985二期信息创新平台项目资助