Minimal connectivity for unconditionally secure message transmission in synchronous directed networks

Authors:
Manan Nayak;Shashank Agrawal;Kannan Srinathan
Affiliations:
Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India;Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India;Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India
Venue:
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Year:
2011

Citing 13
Cited 1

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
On perfectly secure communication over arbitrary networks

Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
Unconditionally reliable message transmission in directed networks

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary

Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary

CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Cryptanalysis of secure message transmission protocols with feedback

ICITS'09 Proceedings of the 4th international conference on Information theoretic security

Secure message transmission in asynchronous directed graphs

INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give the minimal connectivity required in a synchronous directed network, which is under the influence of a computationally unbounded Byzantine adversary that can corrupt a subset of nodes, so that Secure Message Transmission is possible between sender S and receiver R. We also show that secure communication between a pair of nodes in a given synchronous directed network is possible in both directions if and only if reliable communication is possible between them. We assume that in a network, every node is capable of computation and we model the network along the lines of [14].