skip to main content
10.1145/1400751.1400855acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
demonstration

Efficient single phase unconditionally secure message transmission with optimum communication complexity

Published: 18 August 2008 Publication History

Abstract

No abstract available.

References

[1]
M. Franklin and R. N. Wright. Secure communication in minimal connectivity models. In Proc of EUROCRYPT'98, volume 1403 of Lecture Notes in Computer Science (LNCS), pages 346--360. Springer-Verlag, 1998.
[2]
K. Kurosawa and K. Suzuki. Almost secure (1-round, n-channel) message transmission scheme. In Proc. of ICITS 2007. Also appeared as Cryptology ePrint Archive, Report 2007/076, 2007.
[3]
A. Patra, A. Choudhary, K. Srinathan, and C. Pandu Rangan. Unconditionally reliable and secure message transmission in undirected synchronous networks: Possibility, feasibility and optimality. Cryptology ePrint Archive, Report 2008/141, 2008.

Cited By

View all
  • (2019)Truly efficient 2-round perfectly secure message transmission schemeIEEE Transactions on Information Theory10.1109/TIT.2009.203043455:11(5223-5232)Online publication date: 21-Nov-2019
  • (2012)A general construction for 1-round δ-RMT and (0, δ)-SMTProceedings of the 10th international conference on Applied Cryptography and Network Security10.1007/978-3-642-31284-7_21(344-362)Online publication date: 26-Jun-2012
  • (2011)Simple and efficient single round almost perfectly secure message transmission tolerating generalized adversaryProceedings of the 9th international conference on Applied cryptography and network security10.5555/2025968.2025991(292-308)Online publication date: 7-Jun-2011
  • Show More Cited By

Index Terms

  1. Efficient single phase unconditionally secure message transmission with optimum communication complexity

        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. unconditional security

        Qualifiers

        • Demonstration

        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)1
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 17 Jan 2025

        Other Metrics

        Citations

        Cited By

        View all
        • (2019)Truly efficient 2-round perfectly secure message transmission schemeIEEE Transactions on Information Theory10.1109/TIT.2009.203043455:11(5223-5232)Online publication date: 21-Nov-2019
        • (2012)A general construction for 1-round δ-RMT and (0, δ)-SMTProceedings of the 10th international conference on Applied Cryptography and Network Security10.1007/978-3-642-31284-7_21(344-362)Online publication date: 26-Jun-2012
        • (2011)Simple and efficient single round almost perfectly secure message transmission tolerating generalized adversaryProceedings of the 9th international conference on Applied cryptography and network security10.5555/2025968.2025991(292-308)Online publication date: 7-Jun-2011
        • (2011)Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized AdversaryApplied Cryptography and Network Security10.1007/978-3-642-21554-4_17(292-308)Online publication date: 2011
        • (2010)Simple and communication complexity efficient almost secure and perfectly secure message transmission schemesProceedings of the Third international conference on Cryptology in Africa10.1007/978-3-642-12678-9_11(166-183)Online publication date: 3-May-2010

        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