Investigation of Zero Knowledge Proof Approaches Based on Graph Theory

Abstract

Abstract : Zero-knowledge proof systems have many characteristics that are desirable for determining trustworthy parties in an airborne networking environment. One approach is to base zero-knowledge proof systems on the instances and solutions of NP-complete problem. This report investigates this approach with a focus on the graph theory problems within the NP-complete and NP-hard classes.