图同构的零知识证明协议

A Zero-Knowledge Proof Protocol Based Graph Isomorphism Algorithm

研究了图同构的交互式零知识证明协议,并通过分析基于零知识证明的基本模型,提出了子图同构的认证算法.大部分零知识证明的安全性是由复杂的数学运算和交互双方大规模的计算来保证的,而采用模运算方法对文件进行加密,仅需几个参数就可以表示,大大减小了存储空间.协议直接将模运算作用于文件加密,实现起来简单有效;而且由于零知识证明的特点,其安全保密性也较高,满足了基本保护需求.该算法同样适用于登录的身份验证及不可追查的选举投票.

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.