论文信息 - Optimistic fair-exchange protocols based on DSA signatures

Optimistic fair-exchange protocols based on DSA signatures

The problem of fair exchange is a fundamental problem in secure electronic transactions and digital rights management. Park et al. (2003) presented an optimistic fair-exchange protocol based on RSA. Dodis and Reyain (2003) analyzed the vulnerability of Park's scheme and presented an optimistic fair-exchange protocol based on GDH. This paper point out that Dodis and Reyain's scheme is also insecure and inefficient. This work presents a multisignature scheme based on DSA, and describes a novel method of constructing very efficient fair-exchange protocols based on improved DSA signatures. The protocols in this paper are more secure and efficient.

Hong Fan | Zhu Xian | Wang Shaobin

[1] Yevgeniy Dodis,et al. Breaking and repairing optimistic fair exchange from PODC 2003 , 2003, DRM '03.

[2] R. A. Rueppel,et al. Message recovery for signature schemes based on the discrete logarithm problem , 1994, EUROCRYPT.

[3] Edwin K. P. Chong,et al. Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures , 2003, PODC '03.

[4] Alexandra Boldyreva,et al. Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme , 2002 .

[5] Alexandra Boldyreva,et al. Efficient threshold signature , multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme , 2002 .