Unconditionally Reliable Message Transmission in Directed Hypergraphs

Authors:
Kannan Srinathan;Arpita Patra;Ashish Choudhary;C. Pandu Rangan
Affiliations:
Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India 500032;Dept of Computer Science and Engineering, IIT Madras, Chennai, India 600036;Dept of Computer Science and Engineering, IIT Madras, Chennai, India 600036;Dept of Computer Science and Engineering, IIT Madras, Chennai, India 600036
Venue:
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Year:
2008

Citing 6
Cited 2

Verifiable secret sharing and multiparty protocols with honest majority

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Secure hypergraphs: privacy from partial broadcast

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of 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 Reliable Message Transmission in Directed Hypergraphs

CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security

Unconditionally Reliable Message Transmission in Directed Hypergraphs

CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

International Journal of Applied Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of unconditionally reliable messagetransmission (URMT), where a sender S and a receiverR are part of a synchronous network modeled as a directedhypergraph, a part of which may be under the influence of anadversary having unbounded computing power. Sintends to transmit a message m to R, such thatR should correctly obtain S's message withprobability at least (1 - Δ ) for arbitrarily smallΔ 0. However, unlike most of the literature onthis problem, we assume the adversary modeling the faults isthreshold mixed, and can corrupt different set of nodes inByzantine, passive and fail-stop fashion simultaneously. The maincontribution of this work is the complete characterization of URMTin directed hypergraph tolerating such an adversary, which is donefor the first time in the literature.