An investigation into graph isomorphism based zero-knowledge proofs.

摘要: Zero-knowledge proofs protocols are effective interactive methods to prove a node's identity without disclosing any additional information other than the veracity of proof. They implementable in several ways. In this thesis, I investigate graph isomorphism based zero-knowledge protocol. My experiments and analyses suggest that can easily be solved for many types graphs hence is not an ideal solution implementing ZKP.