Network Court Protocol and Malicious Node Conviction

Abstract

A Network Court Protocol is designed for malicious node conviction based on the information from network node accusing and testifying operations, which are formally modeled by algebraic operators. It is shown that the malicious node unambiguous conviction is equivalent to the uniqueness of the solution of a system of Boolean equations and that is equivalent to the uniqueness of a corresponding satisfiability problem. A linear time algorithm is presented for the conviction process using a conviction graph search. The general protocol and algorithms are applied to P2P networks with promising experimental results.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 2007
Accession Number
AD1001219

Entities

People

  • David Lee
  • Na Li

Organizations

  • Ohio State University

Tags

Communities of Interest

  • Cyber
  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Authentication
  • Case Studies
  • Computer Communications
  • Computer Network Security
  • Computer Networks
  • Computers
  • Cybersecurity
  • Detection
  • Detectors
  • Information Processing
  • Intrusion Detection
  • Local Area Networks
  • Network Protocols
  • Network Science
  • Network Topology
  • Ring Networks

Fields of Study

  • Computer science

Readers

  • Aerospace Engineering
  • Computer Networking
  • Operations Research