摘要
提出了两个新的高效的基于属性的环签名方案,签名者用其部分描述属性签署消息,所有拥有这些签名属性的用户组成一个环,环以外的成员不能伪造签名,并分别在随机预言模型和标准模型下证明其能抵抗签名伪造攻击.匿名性方面,对有相同签名属性集的用户是匿名的,对属性管理中心也是匿名的.由于基于属性的环签名不需要知道环成员的公钥,因此与以往提出的基于身份环签名相比较,提出的签名方案具有更加便捷、更加灵活的特点;与现有的基于属性的环签名相比,签名长度减少了1/3,验证所需的双线性对减少了1/3,因此新方案在签名长度、运算效率等方面都有明显优势.同时基于属性的环签名在匿名认证和基于属性的通信系统中有很重要的应用.
Two new attribute-based ring signature schemes are proposed in this paper. The signer can sign message with parts of its attribute. All users that possess these attributes can form a ring. Anyone out of this ring could not forge the signature on behalf of the ring. The first one is existentially unforgeable against selective attributes attacks in the random oracle model and the second construction is existentially unforgeable against selective attributes attacks in the standard model. Both schemes in this paper rest on the hardness of the computational Diffie-Hellman in tractability assumption. For anonymity, it requires that the signer is anonymous among the users with the same attributes for signature, even for the attribute center. In attribute-based ring signature scheme the signer need not know who are involved in this ring, so these new schemes are more efficient and flexible than the previous identity-based ring signature schemes. Compared with the existing attribute-based ring signature scheme, the size of the signature decreases by 1 3, and the pairing operations in our schemes also decrease by 1 3. Thus new schemes are more efficient in the communication cost and the computational cost. Attribute-based ring signature is useful in many important applications such as anonymous authentication and attribute-based messaging systems.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2010年第12期2075-2082,共8页
Journal of Computer Research and Development
基金
国家自然科学基金重点项目(60833008)
