不使用对运算的随机化盲签名方案设计

摘要

鉴于目前大多数随机化盲签名方案都是基于双线性对的,耗时量比较大,提出一种不使用对运算的随机化盲签名方案.在离散对数问题和计算性Diffie-Hellman问题下,方案满足不可伪造性、随机性、可验证性、抗攻击性等.由于方案不使用对运算,因而大大提高了效率.%Because currently most of the randomised blind signature schemes are based on bilinear pairing which needs to consume a lot of time, a randomised partially blind signature scheme without pairing operation is proposed. The new scheme meets unforgeability, randomicity, verifiability, resistance to attack in discrete logarithm problem and computational Diffie-Hellman problem. Since the scheme doesn't use bilinear pairing, the efficiency is improved remarkably.