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

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 115-124

  Ashwinkumar, B V ^a   Patra, Arpita ^a,b   Choudhary, Ashish ^a,c   Srinathan, Kannan ^d   Rangan, C Pandu ^a,c  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b MICROSOFT RESEARCH INDIA   (India)

^c Govt of India ^*

^d INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

Unbounded computing power

Indexed keywords

COMMUNICATION COMPLEXITY; MESSAGE TRANSMISSIONS; NETWORK CONNECTIVITIES; RELIABLE COMMUNICATIONS; SYNCHRONOUS NETWORKS; UNBOUNDED COMPUTING POWER;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 57549090072     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. S. Agarwal, R. Cramer, and R. de Haan. Asymptotically optinial two-round perfectly secure message transmission. In G. Dwork, editor, Proc. of Advances in Cryptology: CRYPTO 2006, LNCS 4117, pages 394-408. Springer-Verlag, 2006.
2. T. H. Gormen. C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2002.
3. R. Cramer, I. Damgård. S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In Proc. of EUROCRYPT 1999, volume 1592 of LNCS, pages 311-326. Springer Verlag, 1999.
4. Y. Dcsniedt and Y. Wang. Perfectly secure message transmission revisited. In Proc. of Advances in Cryptology: Eurocrypt 2002, LNCS 2332. pages 502-517. Springer-Verlag. 2003.
5. D. Dolev, C. Dwork, O. Waarts. and M. Yung. Perfectly secure message transmission. J ACM, 40(1):17-47, 1993.
6. M. Franklin and R. Wright. Secure communication in minimal connectivity models. Journal of Cryptology, 13(1):9-30. 2000.
7. F. J. Mac Williams and N. J. A. Sloanc. The Theory of Error Correcting Codes. North-Holland Publishing Company, 1978.
8. K. Monger. Zur allgemeinen kurventheorie. Fundamenta Mathematicae, 10:96-115. 1927.
9. A. Patra, A. Choudhary, and C. Pandu Rangan. Constant phase efficient protocols for secure message transmission in directed networks. In ACM PODC, pages 322-323. ACM Press, 2007.
10. A. Patra. A. Choudhary. K. Srinathan, and C. Pandu Rangan. Constant phase bit optimal protocols for perfectly reliable and secure message transmission. In Proc. of INDOCRYPT 2006, volume 4329 of LNCS, pages 221-235. Springer Verlag, 2006.
11. K. Srinathan, A. Narayanan, and C. Pandu Rangan. Optimal perfectly secure message transmission. In Proc. of Advances in Cryptology: CRYPTO 2004, LNCS 3152. pages 545-561. Springer-Verlag, 2004.