On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary

Authors:
Ashwinkumar B.V;Arpita Patra;Ashish Choudhary;Kannan Srinathan;Chandrasekharan Pandu Rangan
Affiliations:
Indian Institute of Technology Madras, Chennai, India;Indian Institute of Technology Madras, Chennai, India;Indian Institute of Technology Madras, Chennai, India;International Institute of Information Technology, Hyderabad, India;Indian Institute of Technology Madras, Chennai, India
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 7
Cited 5

Introduction to algorithms

Introduction to algorithms
Perfectly secure message transmission

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
Constant phase efficient protocols for secure message transmission in directed networks

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Efficient multiparty computations secure against an adaptive adversary

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Constant phase bit optimal protocols for perfectly reliable and secure message transmission

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Asymptotically optimal two-round perfectly secure message transmission

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
The disagreement power of an adversary: extended abstract

Proceedings of the 28th ACM symposium on Principles of distributed computing
The disagreement power of an adversary

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

International Journal of Applied Cryptography
On communication complexity of secure message transmission in directed networks

ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the inherent tradeoff between the network connectivity, phase complexity and communication complexity of perfectly reliable message transmission (PRMT) problem in undirected synchronous network, tolerating a mixed adversary A(tb,tf), who has unbounded computing power and can corrupt tb and tf nodes in the network in Byzantine and fail-stop fashion respectively.