Analysis And Research On Blind DLP Signature Issue

In today’s society, digital information has become increasingly important. The applications of computer network have become essential to people’s daily communications, and greatly promote the development of economy and living information. But, with the rapid development of network technology, information security has started to show up. At the same time, it has brought a lot of inconvenience to people’s lives and work. Digital signature technology has been widely concerned and effectively ensures the security of the communication, as the core technology of information security with the authentication, data integrity and anti-repudiation.Blind signature is a special signature with a wide range of applications. In electronic voting system or electronic electing system, the user’s ID should not be known by other persons. In other words, the information should be anonymity. However, the ordinary digital signature is unable to realize the requirements. So, the research and development of blind signature will become an important project in the area of information security.The focus of this paper is blind signature algorithm based on the DLP—discrete logarithm problem. DLP is one of the most difficult problems in mathematics now, the next few years also. This feature can be applied in blind signature algorithm. Confidential information will need blind treatment, so that blinded message can not be known by others. This paper raises a few relatively secure blind signature schemes, based on several DLP blind signature algorithms. The main task is as follows:(1)This paper describes a General construction algorithm of Schnorr, EIGamal, DSA, and analysis it.(2) On the basis of the DSA blind signature, this paper proposed an improved scheme of DSA signature algorithm which based on the original DSA algorithm. Although the improved scheme is a weak blind signature scheme, the efficiency is greatly improved.(3) Focus on the traceability of the first scheme, a new blind signature which has non-traceability is proposed. It is a strong blind signature scheme, and has the characteristics of strong blind signature.(4) The proxy blind signature is a signature algorithm which combines the proxy signature with blind signature. In this paper, Tan scheme is analyzed and improved, as some of the shortcomings and deficiencies are pointed out. In improved agent scheme, hash function is combined with proxy blind signature. The new scheme which has non-traceability and enforceability has greatly improved the security, by using the confidentiality of private key.(5) In this paper, the Y-X proxy blind signature scheme is analyzed and improved, as the deficiencies of traceability and forging are pointed out. An improved scheme which can overcome the shortcomings and deficiencies above, realizes the security requirements of proxy blind signature.Since the research of blind signature is in the period of constantly perfecting, and not ripe enough in security and efficiency. In this paper, today’s schemes are analyzed and improved, by improving the security and efficiency. Without doubt, future development of blind signature still needs incremental improvements and further researches.