Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission

Authors:
Abhinav Mehta;Shashank Agrawal;Kannan Srinathan
Affiliations:
Center for Security, Theory and Algorithmic Research (C-STAR), International Institute of Information Technology, Hyderabad, India;Center for Security, Theory and Algorithmic Research (C-STAR), International Institute of Information Technology, Hyderabad, India;Center for Security, Theory and Algorithmic Research (C-STAR), International Institute of Information Technology, Hyderabad, India
Venue:
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Year:
2012

Citing 11
Cited 0

Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Perfectly secure message transmission

Journal of the ACM (JACM)
Asynchronous secure computation

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Perfectly Secure Message Transmission Revisited

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Possibility and complexity of probabilistic reliable communication in directed networks

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Constant phase efficient protocols for secure message transmission in directed networks

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Unconditionally reliable message transmission in directed networks

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks

ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Cryptanalysis of secure message transmission protocols with feedback

ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Brief announcement: synchronous Las Vegas URMT iff asynchronous Monte Carlo URMT

DISC'10 Proceedings of the 24th international conference on Distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

For unconditionally reliable message transmission (URMT) in synchronous directed networks of n nodes, a subset of which may be malicious, it is well-known that the minimum connectivity requirements for zero-error (perfect) protocols to exist is strictly higher than those where a negligible yet non-zero error probability is allowed (Monte Carlo protocols) [12]. In this work, we study the minimum connectivity requirements for the existence of (a) synchronous Las Vegas, (b) asynchronous Monte Carlo, and (c) asynchronous Las Vegas protocols for URMT. Interestingly, we prove that in any network, a synchronous Las Vegas URMT protocol exists if and only if an asynchronous Monte Carlo URMT protocol exists too. We further show that in any network, an asynchronous Las Vegas URMT protocol exists if and only if a synchronous perfect protocol exists as well. Thus, our results establish an interesting interplay between (im)perfectness, synchrony and connectivity for the case of URMT.