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!!
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agarwal, S., Cramer, R., de Haan, R.: Asymptotically optimal two-round perfectly secure message transmission. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 394–408. Springer, Heidelberg (2006)
Cover, T.H., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Chichester (2004)
Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. JACM 40(1), 17–47 (1993)
Franklin, M., Wright, R.N.: Secure communication in minimal connectivity models. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 346–360. Springer, Heidelberg (1998)
Kurosawa, K., Suzuki, K.: Almost secure (1-round, n-channel) message transmission scheme. Cryptology ePrint Archive, Report 2007/076 (2007), http://eprint.iacr.org/
Menger, K.: Zur allgemeinen kurventheorie. Fundamenta Mathematicae 10, 96–115 (1927)
Patra, A., Choudhary, A., Srinathan, K., Rangan, P.C.: Bit optimal protocols for perfectly reliable and secure message transmission in the presence of mixed adversary. Manuscript
Patra, A., Choudhary, A., Srinathan, K., Rangan, P.C.: Does randomization helps in reliable and secure communication. Manuscript
Patra, A., Choudhary, A., Srinathan, K., Rangan, C.P.: Constant phase bit optimal protocols for perfectly reliable and secure message transmission. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol. 4329, pp. 221–235. Springer, Heidelberg (2006)
Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. of twenty-first annual ACM symposium on Theory of computing, pp. 73–85. ACM Press, New York (1989)
Srinathan, K.: Secure Distributed Communication. PhD thesis, Indian Institute of Technology Madras (2006)
Srinathan, K., Narayanan, A., Rangan, C.P.: Optimal perfectly secure message transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 545–561. Springer, Heidelberg (2004)
Srinathan, K., Prasad, N.R., Rangan, C.P.: On the optimal communication complexity of multiphase protocols for perfect communication. In: IEEE Symposium on Security and Privacy, pp. 311–320 (2007)
Wang, Y., Desmedt, Y.: Secure communication in multicast channels: The answer to Franklin and Wright’s question. Journal of Cryptology 14(2), 121–135 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Srinathan, K., Patra, A., Choudhary, A., Rangan, C.P. (2007). Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality. In: Srinathan, K., Rangan, C.P., Yung, M. (eds) Progress in Cryptology – INDOCRYPT 2007. INDOCRYPT 2007. Lecture Notes in Computer Science, vol 4859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77026-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-77026-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77025-1
Online ISBN: 978-3-540-77026-8
eBook Packages: Computer ScienceComputer Science (R0)