A GOST-like Blind Signature Scheme Based on Elliptic Curve Discrete Logarithm Problem
This work addresses the need for more efficient cryptographic protocols in domains like digital signatures, though it appears incremental as it builds on existing GOST and elliptic curve structures.
The authors tackled the problem of designing efficient blind signature schemes by proposing a new scheme and three derived variants based on elliptic curve discrete logarithms, resulting in proven security and reduced time complexity compared to existing methods.
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.