Perfectly secure message transmission

  • Authors:
  • Danny Dolev;Cynthia Dwork;Orli Waarts;Moti Yung

  • Affiliations:
  • IBM Almaden Research Center, San Jose, CA;IBM Almaden Research Center, San Jose, CA;Stanford Univ., Stanford, CA;IBM T. J. Watson Research Center, Yorktown Heights, NY

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1993

Quantified Score

Hi-index 0.07

Visualization

Abstract

This paper studies the problem of perfectly secure communication in general network in which processors and communication lines may be faulty. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms are obtained that operate with this connectivity and rely on no complexity-theoretic assumptions. These are the first algorithms for secure communication in a general network to simultaneously achieve the three goals of perfect secrecy, perfect resiliency, and worst-case time linear in the diameter of the network.