Byzantine fault tolerant public key authentication in peer-to-peer systems

  • Authors:
  • Vivek Pathak;Liviu Iftode

  • Affiliations:
  • Department of Computer Science, Rutgers, The State University of New Jersey, Piscataway, NJ;Department of Computer Science, Rutgers, The State University of New Jersey, Piscataway, NJ

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe Byzantine fault tolerant authentication, a mechanism for public key authentication in peer-to-peer systems. Authentication is done without trusted third parties, tolerates Byzantine faults and is eventually correct if more than a threshold of the peers are honest. This paper addresses the design, correctness, and fault tolerance of authentication over insecure asynchronous networks. An anti-entropy version of the protocol is developed to provide lazy authentication with logarithmic messaging cost. The cost implications of the authentication mechanism are studied by simulation.