Probabilistic perfectly reliable and secure message transmission - possibility, feasibility and optimality

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;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:
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Year:
2007

Citing 6
Cited 7

Verifiable secret sharing and multiparty protocols with honest majority

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Elements of information theory

Elements of information theory
Perfectly secure message transmission

Journal of the ACM (JACM)
On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication

SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
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
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

International Journal of Applied Cryptography
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
Public discussion must be back and forth in secure message transmission

ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
A general construction for 1-round δ-RMT and (0, δ)-SMT

ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
On the communication complexity of reliable and secure message transmission in asynchronous networks

ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
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 study the interplay of network connectivity and the issues related to feasibility and optimality for probabilistic perfectly reliable message transmission (PPRMT) and probabilistic perfectly secure message transmission (PPSMT) in a synchronous network under the influence of a mixed adversary who possesses unbounded computing power and can corrupt different set of nodes in Byzantine, omission, failstop and passive fashion simultaneously. Our results show that that randomness helps in the possibility of multiphase PPSMT and significantly improves the lower bound on communication complexity for both PPRMT and PPSMT protocols!!.