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
Cynthia Dwork, Paris C. Kanellakis, et al.
SIAM Journal on Computing
D. Dolev, H.R. Strong
Symposium on Reliability in Distributed Software and Database Systems 1981
Ray Strong, D. Dolev, et al.
RTSS 1990