Article

Constant phase efficient protocols for secure message transmission in directed networks

Authors:

Arpita Patra,

Ashish Choudhary,

Chanrasekharan Pandu RanganAuthors Info & Claims

PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

Pages 322 - 323

https://doi.org/10.1145/1281100.1281153

Published: 12 August 2007 Publication History

Get Access

Abstract

No abstract available.

References

[1]

Y. Desmedt and Y. Wang. Perfectly secure message transmission revisited. Cryptology ePrint Archive, Report 2002/128, 2002. url -- http://eprint.iacr.org.

Digital Library

Google Scholar

[2]

F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes. North-Holland Publishing Company, 1978.

Google Scholar

[3]

K. Srinathan and C. Pandu Rangan. Possibility and complexity of probabilistic reliable communication in directed networks. In Proc. of 25th PODC, pages 265--274. ACM Press, 2006.

Digital Library

Google Scholar

Cited By

View all

Kishore R(2025)Perfectly Secure Message Transmission Tolerating Omission Faults -- Possibility Feasibility, and OptimalityProceedings of the 26th International Conference on Distributed Computing and Networking10.1145/3700838.3700873(191-200)Online publication date: 4-Jan-2025
https://dl.acm.org/doi/10.1145/3700838.3700873
Kishore RInumella ASrinathan KHansdah RKrishnaswamy DVaidya N(2019)Perfectly secure message transmission over partially synchronous networksProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288612(302-306)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288612
Kishore RVanarasa CJha TSrinathan K(2016)On perfectly secret message transmission in digraphs tolerating dual failuresProceedings of the 17th International Conference on Distributed Computing and Networking10.1145/2833312.2833327(1-10)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2833312.2833327
Show More Cited By

Index Terms

Constant phase efficient protocols for secure message transmission in directed networks
1. Security and privacy
  1. Cryptography
  2. Systems security
    1. Operating systems security

Recommendations

Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
ACISP '08: Proceedings of the 13th Australasian conference on Information Security and Privacy

In this paper, we study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous network, a part of which is under the influence of an all ...
Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary
CANS'07: Proceedings of the 6th international conference on Cryptology and network security

In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple parallel edges (called wires), each of which are directed from S to R or vice-versa. ...
Constant phase bit optimal protocols for perfectly reliable and secure message transmission
INDOCRYPT'06: Proceedings of the 7th international conference on Cryptology in India

In this paper, we study the problem of perfectly reliable message transmission(PRMT) and perfectly secure message transmission(PSMT) between a sender S and a receiver R in a synchronous network, where S and R are connected by n vertex disjoint paths ...

Comments

Information & Contributors

Information

Published In

PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

August 2007

424 pages

ISBN:9781595936165

DOI:10.1145/1281100

General Chair:
Indranil Gupta
UIUC, USA
,
Program Chair:
Rogert Wattenhofer
ETH Zurich, Switzerland

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 August 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tag

information theoretic security

Qualifiers

Article

Conference

PODC07

Sponsor:

PODC07: ACM Symposium on Principles of Distributed Computing 2007

August 12 - 15, 2007

Oregon, Portland, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
157
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kishore R(2025)Perfectly Secure Message Transmission Tolerating Omission Faults -- Possibility Feasibility, and OptimalityProceedings of the 26th International Conference on Distributed Computing and Networking10.1145/3700838.3700873(191-200)Online publication date: 4-Jan-2025
https://dl.acm.org/doi/10.1145/3700838.3700873
Kishore RInumella ASrinathan KHansdah RKrishnaswamy DVaidya N(2019)Perfectly secure message transmission over partially synchronous networksProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288612(302-306)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288612
Kishore RVanarasa CJha TSrinathan K(2016)On perfectly secret message transmission in digraphs tolerating dual failuresProceedings of the 17th International Conference on Distributed Computing and Networking10.1145/2833312.2833327(1-10)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2833312.2833327
Mehta AAgrawal SSrinathan K(2012)Interplay between (im)perfectness, synchrony and connectivityProceedings of the 13th international conference on Distributed Computing and Networking10.1007/978-3-642-25959-3_10(138-152)Online publication date: 3-Jan-2012
https://dl.acm.org/doi/10.1007/978-3-642-25959-3_10
Choudhury AKurosawa KPatra A(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
https://dl.acm.org/doi/10.5555/2025968.2025991
Agrawal SMehta ASrinathan K(2011)Secure message transmission in asynchronous directed graphsProceedings of the 12th international conference on Cryptology in India10.1007/978-3-642-25578-6_26(359-378)Online publication date: 11-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25578-6_26
Choudhury AKurosawa KPatra A(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
https://doi.org/10.1007/978-3-642-21554-4_17
Patra AChoudhary ARangan C(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
https://dl.acm.org/doi/10.5555/2018057.2018069
Patra AChoudhary ARangan C(2010)On Communication Complexity of Secure Message Transmission in Directed NetworksDistributed Computing and Networking10.1007/978-3-642-11322-2_9(42-53)Online publication date: 2010
https://doi.org/10.1007/978-3-642-11322-2_9
Patra AChoudhary ARangan CSrinathan KRaghavendra P(2009)Perfectly reliable and secure message transmission tolerating mobile adversaryInternational Journal of Applied Cryptography10.1504/IJACT.2009.0234671:3(200-224)Online publication date: 1-Feb-2009
https://dl.acm.org/doi/10.1504/IJACT.2009.023467
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary

Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary

Constant phase bit optimal protocols for perfectly reliable and secure message transmission

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tag

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations