A Zero-Knowledge Proof Protocol Based Graph Isomorphism Algorithm

Abstract

The interactive zero-knowledge proof protocol for the graph isomorphism was studied,and subgraph isomorphism certification algorithm was proposed by analyzing the basic model based on zeroknowledge proof.The security of most of the zero knowledge proofs was guaranteed by complex mathematical operations and large scale computations of interaction on both sides.Modulo operation was directly applied to the file encryption,and that only required a few parameters,which greatly reduced the storage space,and the method was simple and effective.Because of the characteristic of the zero-knowledge proof,it has better level of security,and meets the demand of basic protection.The algorithm is suitable for the authentication algorithm of login and vote that cannot be traced.