A GOST-like Blind Signature Scheme Based on Elliptic Curve Discrete Logarithm Problem

In this paper, we propose a blind signature scheme and three practical educed schemes based on elliptic curve discrete logarithm problem. The proposed schemes impart the GOST signature structure and utilize the inherent advantage of elliptic curve cryptosystems in terms of smaller key size and lower computational overhead to its counterpart public key cryptosystems such as RSA and ElGamal. The proposed schemes are proved to be secure and have less time complexity in comparison with the existing schemes.

[1]  Niels Ferguson,et al.  Single Term Off-Line Coins , 1994, EUROCRYPT.

[2]  David Chaum,et al.  Blind Signature System , 1983, CRYPTO.

[3]  Joos Vandewalle,et al.  Efficient Electronic Cash with Restricted Privacy , 1997, Financial Cryptography.

[4]  Cheng-Chi Lee,et al.  A new blind signature based on the discrete logarithm problem for untraceability , 2005, Appl. Math. Comput..

[5]  Yu-Fang Chung,et al.  ID-based digital signature scheme on the elliptic curve cryptosystem , 2007, Comput. Stand. Interfaces.

[6]  Jacques Stern,et al.  Security Arguments for Digital Signatures and Blind Signatures , 2015, Journal of Cryptology.

[7]  Alfred Menezes,et al.  The State of Elliptic Curve Cryptography , 2000, Des. Codes Cryptogr..

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

[9]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[10]  Yumin Wang,et al.  Blind Signature Schemes Based on Gost Signature , 2004 .

[11]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[12]  David Pointcheval,et al.  Strengthened Security for Blind Signatures , 1998, EUROCRYPT.

[13]  Tatsuaki Okamoto,et al.  Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes , 1992, CRYPTO.

[14]  Morteza Nikooghadam,et al.  An efficient blind signature scheme based on the elliptic curve discrete logarithm problem , 2009, ISC Int. J. Inf. Secur..

[15]  Yiannis Tsiounis,et al.  "Indirect Discourse Proof": Achieving Efficient Fair Off-Line E-cash , 1996, ASIACRYPT.

[16]  Ting Wu,et al.  Comment: A new blind signature based on the discrete logarithm problem for untraceability , 2005, Appl. Math. Comput..

[17]  Jan Camenisch,et al.  Blind Signatures Based on the Discrete Logarithm Problem , 1994, EUROCRYPT.

[18]  David Naccache,et al.  GOST 34.10 - A brief overview of Russia's DSA , 1996, Comput. Secur..

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