Research On Zero-Knowledge Proof And Its Applications

With the popularization of networks, it has become very convenient and effective that engaged in a variety of activities using network . online banking, e-commerce, e-government activities ,more and more activities are inseparable from the network. It is particularly important for these applications that its security requirements, otherwise, the consequences would be unthinkable. These security services are usually provided by the cryptographic protocols, zero knowledge proof is such a core technology to provide the security services. Zero-knowledge proof is an advanced cryptographic protocols, it is claimed that the prover to prove an assertion to the verifier but without revealing anything but the truth of the assertion. Zero knowledge proof play an important role in modern cryptography, It is not only provide strong support for the realization of a variety of cryptographic protocol analysis and structure as a basic tool, and it has been widely used as a method of proof. In addition, Zero-knowledge proof not only has important applications in cryptography, in the framework of the IP Protocol, this topic has developed into an important branch of computational complexity theory.The notion of bit commitment is at the heart of almost any construction of modern cryptographic protocols. It is important tool to achieve zero-knowledge proof. From the concept of bit commitment was proposed first by Blum in 1982, it has become an active area in cryptographic research. Cryptographer point out that any NP has a zero-knowledge proof proposition if we have a good encryption algorithm. Here, the algorithm of encryption is refer to bit commitment essentially. Bit commitment is an important sub-protocol to build zero-knowledge proof protocol. In addition, the type of bit commitment directly affects the type of zero-knowledge proof on the top level which was build by the bit commitment.At first, this thesis introduces the theory of bit commitment, and different ways to achieve bit commitment, and gives the bit commitment scheme of 0-1 knapsack problem. There introduces some knowledge of zero knowledge proof protocol in detailed. Then several examples of zero-knowledge proof are given, and some practical applications based on the zero-knowledge proof protocol are listed. According to the analysis of interactive of zero-knowledge proof about Hamilton circle, non-interactive zero-knowledge proof about Hamilton circle was discussed. Finally, there gives a brief introduction of cutting-edge research fields about zero-knowledge proof.