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

TL;DR

This paper introduces a new elliptic curve-based blind signature scheme inspired by GOST, offering enhanced security, smaller keys, and lower computational costs compared to traditional RSA and ElGamal schemes.

Contribution

The paper presents a novel GOST-like blind signature scheme based on elliptic curve discrete logarithm problem, with practical variants and improved efficiency.

Findings

Schemes are proven secure against known attacks.

Reduced key size and computational overhead compared to RSA and ElGamal.

Schemes demonstrate lower time complexity in experiments.

Abstract

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.