Shai Fine, Yishay Mansour
Machine Learning
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. © 1993, ACM. All rights reserved.
Shai Fine, Yishay Mansour
Machine Learning
Arthur Nádas
IEEE Transactions on Neural Networks
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Merve Unuvar, Yurdaer Doganata, et al.
CLOUD 2014