Message Recovery Fair Blind Signature

As the blind signature introduced by Chaum [10] does not reveal any information about the message or its signature, it has been used for providing the anonymity in secure electronic payment systems. Unfortunately, this perfect anonymity could be misused by criminals as blind signatures prevent linking the withdrawal of money and the payment made by the same customer. Therefore, we should provide publicly verifiable mechanism if it is required for the judge to trace the blackmailed messages. In this study, we propose a modified fair blind signature, which additionally provides the role of message recovery. After analyzing the existing meta-ElGamal scheme [12] suggested by Horster, the model of message recovery blind signature is considered at first. And we suggest a new fair blind signature based on the oblivious transfer protocol, with which a judge can verify its fairness. Proposed scheme can be advanced into the blind multi-signature and it is also applicable to the diverse payment applications.

[1]  Ernest F. Brickell,et al.  Trustee-based tracing extensions to anonymous cash and the making of anonymous change , 1995, SODA '95.

[2]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[3]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[4]  Guillaume Poupard,et al.  Efficient scalable fair cash with off-line extortion prevention , 1997, ICICS.

[5]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[6]  Patrick Horster,et al.  Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications , 1994, ASIACRYPT.

[7]  Silvio Micali,et al.  Non-Interactive Oblivious Transfer and Applications , 1989, CRYPTO.

[8]  Markus Stadler,et al.  Publicly Verifiable Secret Sharing , 1996, EUROCRYPT.

[9]  Stefan A. Brands,et al.  Untraceable Off-line Cash in Wallet with Observers , 2002 .

[10]  N. Asokan,et al.  Optimistic fair exchange of digital signatures , 1998, IEEE Journal on Selected Areas in Communications.

[11]  Patrick Horster,et al.  Meta-ElGamal signature schemes , 1994, CCS '94.

[12]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[13]  Stefan A. Brands,et al.  An Efficient Off-line Electronic Cash System Based On The Representation Problem. , 1993 .

[14]  Jan Camenisch,et al.  An Efficient Electronic Payment System Protecting Privacy , 1994, ESORICS.

[15]  S. Micali.  Fair cryptosystems , 1994 .

[16]  Jan Camenisch,et al.  Fair Blind Signatures , 1995, EUROCRYPT.

[17]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[18]  David Naccache,et al.  On blind signatures and perfect crimes , 1992, Comput. Secur..

[19]  Amos Fiat,et al.  Untraceable Electronic Cash , 1990, CRYPTO.

[20]  Holger Petersen,et al.  Meta-Multisignature schemes based on the discrete logarithm problem , 1995 .