Conference paper
Concurrent zero-knowledge
Cynthia Dwork, Moni Naor, et al.
STOC 1998
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, Moni Naor, et al.
STOC 1998
Esti Yeger Lotem, Idit Keidar, et al.
PODC 1997
D.M. Choy, Cynthia Dwork, et al.
ADL 1996
Miklos Ajtai, Cynthia Dwork
STOC 1997