Back to search

University of North Texas

An Investigation into Graph Isomorphism Based Zero-Knowledge Proofs

Abstract

dc:description

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.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
2009

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ayeh, Eric
Contributors dc:contributor
  • Namuduri, Kamesh
  • Varanasi, Murali R.
  • Guturu, Parthasarathy

Subjects

dc:subject × 5

Rights

dc:rights
Statement dc:rights
  • Public
  • Copyright
  • Ayeh, Eric
  • Copyright is held by the author, unless otherwise noted. All rights reserved.
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
https://digital.library.unt.edu/ark:/67531/metadc12076/
ark: ark:/67531/metadc12076

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Ayeh, Eric. An Investigation into Graph Isomorphism Based Zero-Knowledge Proofs. University of North Texas, 2009. https://doi.org/10.12794/metadc12076