On communication complexity of secure message transmission in directed networks

Authors:
Arpita Patra;Ashish Choudhary;C. Pandu Rangan
Affiliations:
Dept of Computer Science and Engineering, IIT Madras, Chennai, India;Dept of Computer Science and Engineering, IIT Madras, Chennai, India;Dept of Computer Science and Engineering, IIT Madras, Chennai, India
Venue:
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Year:
2010

Citing 14
Cited 3

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
Perfectly secure message transmission

Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
On sharing secrets and Reed-Solomon codes

Communications of the ACM
How to share a secret

Communications of the ACM
Distributed Algorithms

Distributed Algorithms
Constant phase efficient protocols for secure message transmission in directed networks

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Brief announcement: perfectly secure message transmission in directed networks re-visited

Proceedings of the 28th ACM symposium on Principles of distributed computing
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
Truly efficient 2-round perfectly secure message transmission scheme

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology

Simple and efficient single round almost perfectly secure message transmission tolerating generalized adversary

ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Secure message transmission in asynchronous directed graphs

INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbounded computing power. Specifically, we derive the lower bounds on communication complexity of (a) two phase PSMT protocols and (b) three or more phase PSMT protocols in directed networks. Moreover, we show that our lower bounds are asymptotically tight, by designing communication optimal PSMT protocols in directed networks, which are first of their kind. We re-visit the problem of perfectly reliable message transmission (PRMT) as well. Any PRMT protocol that sends a message containing l field elements by communicating O(l) field elements, is referred as communication optimal PRMT or PRMT with constant factor overhead. Here, we characterize the class of directed networks over which communication optimal PRMT or PRMT with constant factor overhead is possible. Moreover, we design a communication optimal PRMT over a directed network that satisfies the conditions stated in our characterization.