论文部分内容阅读
为满足电子世界一种特殊的签名需要,利用丛同态理论设计了一种部分盲签名方案。利用归约方法证明具有多项式计算能力的攻击者无法伪造一个可以通过验证的部分盲签名。也不能签署一个消息,随后又成功地否认签署过这个消息。具有无穷计算能力的攻击者,虽然能够成功伪造一个可通过验证的签名,但是伪造的签名很容易被发现。这样的部分盲签名方案同时保护了签名人的利益和签名依赖人的隐私信息。
In order to meet the special need of signature in the electronic world, a partially blind signature scheme is designed by using the pheromone theory. Using the reduction method, an attacker who proves polynomial computing power can not forge a partially blind signature that can be verified. Can not sign a message, then successfully denied signing the news. An attacker with infinite computing power, while able to successfully forge a validated signature, can forge an easily signed signature. Such a partially blind signature scheme also protects the signer’s interests and the signature of the dependent person’s privacy information.