Performing work efficiently in the presence of faults
Cynthia Dwork, Joseph Y. Halpern, et al.
PODC 1992
The problem of perfectly secure communication in a general network in which processors and communication lines may be faulty is studied. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms that operate with this connectivity and rely on no complexity theoretic assumptions are derived. These are the first algorithms for secure communication in a general network to achieve simultaneously the goals of perfect secrecy, perfect resiliency, and worst case time linear in the diameter of the network.
Cynthia Dwork, Joseph Y. Halpern, et al.
PODC 1992
D. Dolev, H.R. Strong
Symposium on Reliability in Distributed Software and Database Systems 1981
Cynthia Dwork, Larry Stockmeyer
SIAM Journal on Computing
Miklos Ajtai, Cynthia Dwork
STOC 1997