A Blind Signature Scheme Constructed with Error Correcting Codes

Abstract

In this paper we propose a conversion from signature scheme connected to coding theory into blind signature scheme. The blind signature scheme is based on CFS signature scheme, so the security of the proposed blind signature scheme is equal to the security of CFS signature scheme. The security can be reduced in the random oracle model to the well-known syndrome decoding problem and the distinguishability of permuted binary Goppa code from a random code. This is a secure blind signature scheme which cannot be broken by quantum computers via cryptanalyzing the underlying signature scheme employing Shor's algorithms. From security analysis, we know that the scheme not only has the basic features, such as blindness, unforgeability, untracability, but also is based on coding theory, so it can resist attacks from quantum algorithms. Compared with other blind signature algorithms, our scheme has better performance.