skip to main content
10.1145/1400751.1400768acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
research-article

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

Published: 18 August 2008 Publication History

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.

References

[1]
S. Agarwal, R. Cramer, and R. de Haan. Asymptotically optimal two-round perfectly secure message transmission. In C. Dwork, editor, Proc. of Advances in Cryptology: CRYPTO 2006, LNCS 4117, pages 394--408. Springer-Verlag, 2006.
[2]
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2002.
[3]
R. Cramer, I. Damgard, 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. Desmedt 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. JACM, 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. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes. North-Holland Publishing Company, 1978.
[8]
K. Menger. 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.

Cited By

View all
  • (2011)The disagreement power of an adversaryDistributed Computing10.1007/s00446-010-0122-424:3-4(137-147)Online publication date: 1-Nov-2011
  • (2010)On communication complexity of secure message transmission in directed networksProceedings of the 11th international conference on Distributed computing and networking10.5555/2018057.2018069(42-53)Online publication date: 3-Jan-2010
  • (2009)The disagreement power of an adversaryProceedings of the 28th ACM symposium on Principles of distributed computing10.1145/1582716.1582769(288-289)Online publication date: 10-Aug-2009

Index Terms

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

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
        August 2008
        474 pages
        ISBN:9781595939890
        DOI:10.1145/1400751
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 18 August 2008

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tag

        1. unbounded computing power

        Qualifiers

        • Research-article

        Conference

        PODC '08

        Acceptance Rates

        Overall Acceptance Rate 740 of 2,477 submissions, 30%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)2
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 17 Jan 2025

        Other Metrics

        Citations

        Cited By

        View all
        • (2011)The disagreement power of an adversaryDistributed Computing10.1007/s00446-010-0122-424:3-4(137-147)Online publication date: 1-Nov-2011
        • (2010)On communication complexity of secure message transmission in directed networksProceedings of the 11th international conference on Distributed computing and networking10.5555/2018057.2018069(42-53)Online publication date: 3-Jan-2010
        • (2009)The disagreement power of an adversaryProceedings of the 28th ACM symposium on Principles of distributed computing10.1145/1582716.1582769(288-289)Online publication date: 10-Aug-2009

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media