Return to search

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 the proof. They are implementable in several ways. In this thesis, I investigate the graph isomorphism based zero-knowledge proofs protocol. My experiments and analyses suggest that graph isomorphism can easily be solved for many types of graphs and hence is not an ideal solution for implementing ZKP.

Identiferoai:union.ndltd.org:unt.edu/info:ark/67531/metadc12076
Date12 1900
CreatorsAyeh, Eric
ContributorsNamuduri, Kamesh, Varanasi, Murali R., Guturu, Parthasarathy
PublisherUniversity of North Texas
Source SetsUniversity of North Texas
LanguageEnglish
Detected LanguageEnglish
TypeThesis or Dissertation
FormatText
RightsPublic, Copyright, Ayeh, Eric, Copyright is held by the author, unless otherwise noted. All rights reserved.

Page generated in 0.0021 seconds