Zero-knowledge proof protocol of the isomorphism of graphs

Abstract

The discussion of the zero knowledge-proof protocol of the nonisomorphism of graphs (GNI) has appeared in many papers, but they are not complete zero-knowledge proof protocols at all. We will propose a complete zero-knowledge proof protocol, it implies that it is very difficult to design a secure zero-knowledge interactive proof protocols.