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.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc12076 |
| Date | 12 1900 |
| Creators | Ayeh, Eric |
| Contributors | Namuduri, Kamesh, Varanasi, Murali R., Guturu, Parthasarathy |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | Text |
| Rights | Public, Copyright, Ayeh, Eric, Copyright is held by the author, unless otherwise noted. All rights reserved. |
Page generated in 0.0018 seconds