Partially blind signatures played an important role in many electronic commerce applications. Many existing partially blind signature scheme based on a single hard problem but not secure. In this study, we propose a secure partially blind signature scheme based on factoring and discrete logarithms and show that the proposed scheme satisfies the partial blindness, randomization, unlinkability and unforgeability properties. We also analyse the computation cost of the proposed scheme.

A.P. Stakhov in [12] proposed the concepts golden matrices and new kind of cryptography. In this paper, we propose a new kind of digital signature scheme based on factoring problem and the golden matrices, called the golden digital signature. The method is very fast and simple for technical realization and can be used for signature protection of digital signals (telecommunication and measurement system).

No abstract

No abstract

No abstract