盲签名理论分析与应用-应用数学专业毕业论文.docxVIP

Ab Abstract The theoretical analysis and application of blind signature ABSTRACT With the rapid development of computer hardware, the running speed of computer and the cracking ability to the traditional public key algorithm are becoming stronger, which puts a great threat to various of existing electronic payment protocols. Researchers enhance the safety of E-payment protocol through constructing more complex blind signature protocols. The efficiency of the protocol is not very well although the safety of the protocol can be improved. Consequently, the constructions of blind signature and E-payment scheme that are safe and efficient have become the research hot spots of information safety. Among the already proposed blind signature schemes that are based on public key cryptosystems, several schemes can successfully fabricate signature information through the meet-in-the-middle attack and active attack. This paper concludes five safe blind signature schemes that are based on public key cryptosystems from the proposed ones, and gives the efficiency analysis among them. The zero knowledge proof plan of Schnorr digital signature can protect the safety of Schnorr digital signature well, and prevent the signature from spreading freely. The prover does not need to provide the Schnorr digital signature to the verifier, but provides the interactive information of the zero knowledge proof protocol. The verifier can’t learn any relative information of the signature through interactive information, but ensure that the signer owns the signature information, which can effectively prevent the Schnorr digital signature from spreading freely. With the card safety theory, this paper raises two blind signature schemes that are based on identity in the standard model and certificateless signature in the random oracle model machine, respectively. Both of them define the blind signature system first, then structure the blind signature scheme by bilinear pairing, classify the safety to t