Investigation of Zero Knowledge Proof Approaches Based on Graph Theory

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 2011
Accession Number
ADA540835

Entities

People

  • Michael Gudaitis
  • Victoria Horan

Organizations

  • Air Force Research Laboratory

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Applied Mathematics
  • Artificial Intelligence
  • Artificial Intelligence Computing
  • Computer Science
  • Cryptography
  • Evolutionary Algorithms
  • Graph Theory
  • Information Processing
  • Information Science
  • Information Systems
  • Linear Programming
  • Network Science
  • Operations Research
  • Security Protocols
  • Theoretical Computer Science

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Cybersecurity.
  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design

Technology Areas

  • Space