Concurrence signature method with explicitly revocable fuzziness

Abstract

The invention discloses a concurrence signature method with explicitly revocable fuzziness, which is called as revocable concurrence signature (RCS). The RCS provides a revoking algorithm and comprises the following steps of: setting parameters, generating a signature, authenticating the signature, determining the identity of the signer, and the like. When both sides exchange signatures, the method only needs to generate a keystone, and the fuzziness of the signature can be explicitly revoked according to the published keystone, so that the signatures exchanged by the two parties have the properties of standard signatures, various possible attacks in the aspects of concurrence signature fuzziness are eliminated, and the safety of the signature is greatly improved.

Description

technical field [0001] The invention belongs to the field of digital signatures, relates to a concurrent signature mechanism in a network environment, in particular to a concurrent signature method in which ambiguity can be explicitly abolished. Background technique [0002] Fair exchange of digital signatures in the network environment is a widely researched problem in the field of cryptography, and its typical applications include contract signing, payment systems, e-commerce, and authenticated e-mail. Traditional solutions include secret gradual release (G. Garay, C. Pomerance. Timed fair exchange of standard signatures. In Proc. Financial Cryptography 2003, LNCS 2742, 190-207, 2003.) and online or offline semi-trusted Three parties (G. Ateniese. Verifiable encryption of digital signatures and applications, ACM Transactions on Information and System Security, 7(1): 1-20, 2004.) Two types. [0003] Gradual secret releasing cannot achieve strict fairness when there are lar...

AI Technical Summary

Problems solved by technology

However, the attacker can rely on s 1 with s 2 And the mathematical relationship of t, publish a new keystone k′≠k, and the same keystone imprint s can be calculated according to k′ 2 , the result is that the signature of the matching signer is bound to the identity, but his own signature is not bound to the identity, resulting in an unfair result

[0007] The asymmetric concurrent signature proposed by Nguyen (K.Nguyen.Asymmetric concurrent signatures.Proc.of 7th International Conference on Information and Communications Security (ICICS 2005), LNCS 3783, 181-193, 2005.), to some extent also solves concurrent signatures However, this scheme requires the exchange parties to use different algorithms to generate signatures, which is not only inconvenient to implement, but also provides certain clues for the attacker to speculate on the identities of both parties

Images