research-article

On perfectly secret message transmission in digraphs tolerating dual failures

Authors:

Chiranjeevi Vanarasa,

Kannan SrinathanAuthors Info & Claims

ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and Networking

Article No.: 29, Pages 1 - 10

https://doi.org/10.1145/2833312.2833327

Published: 04 January 2016 Publication History

Abstract

Consider a synchronous distributed network which is partly controlled by an adversary. In a Perfectly Secret Message Transmission(PSMT) protocol, the sender S wishes to transmit a message to the receiver R such that the adversary learns nothing about the message. We characterize the set of directed graphs that admit PSMT protocols tolerating a dual failure model where up to t_p nodes are passively corrupted and further up to any t_f nodes may fail.

References

[1]

A. Badanidiyuru, A. Patra, A. Choudhury, K. Srinathan, and C. P. Rangan. On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission. J. ACM, 59(5):22, 2012.

Digital Library

[2]

Y. Desmedt and Y. Wang. Perfectly secure message transmission revisited. In EUROCRYPT '02: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, pages 502--517, London, UK, 2002. Springer-Verlag.

Digital Library

[3]

D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly Secure Message Transmission. Journal of the Association for Computing Machinery (JACM), 40(1):17--47, January 1993.

Digital Library

[4]

M. Fitzi, M. Hirt, and U. M. Maurer. Trading correctness for privacy in unconditional multi-party computation (extended abstract). In H. Krawczyk, editor, Advances in Cryptology - CRYPTO '98, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23--27, 1998, Proceedings, volume 1462 of Lecture Notes in Computer Science, pages 121--136. Springer, 1998.

Digital Library

[5]

A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35: 921--940, 1988.

Digital Library

[6]

R. Kishore, A. Kumar, C. Vanarasa, and K. Srinathan. Round-optimal perfectly secret message transmission with linear communication complexity. In A. Lehmann and S. Wolf, editors, Information Theoretic Security - 8th International Conference, ICITS 2015, Lugano, Switzerland, May 2--5, 2015. Proceedings, volume 9063 of Lecture Notes in Computer Science, pages 33--50. Springer, 2015.

[7]

K. Kurosawa and K. Suzuki. Truly efficient 2-round perfectly secure message transmission scheme. IEEE Trans. Inf. Theor., 55(11):5223--5232, 2009.

Digital Library

[8]

K. Menger. Zur allgemeinen kurventheorie. Fundamenta Mathematicae, 10: 96--115, 1927.

[9]

M. Nayak, S. Agrawal, and K. Srinathan. Minimal connectivity for unconditionally secure message transmission in synchronous directed networks. In S. Fehr, editor, ICITS, volume 6673 of Lecture Notes in Computer Science, pages 32--51. Springer, 2011.

Digital Library

[10]

A. Patra, A. Choudhary, and C. P. Rangan. Constant phase efficient protocols for secure message transmission in directed networks. In I. Gupta and R. Wattenhofer, editors, Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pages 322--323. ACM, 2007.

Digital Library

[11]

A. Patra, A. Choudhary, and C. P. Rangan. Brief announcement: perfectly secure message transmission in directed networks re-visited. In S. Tirthapura and L. Alvisi, editors, Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pages 278--279. ACM, 2009.

Digital Library

[12]

A. Patra, A. Choudhary, and C. P. Rangan. On communication complexity of secure message transmission in directed networks. In K. Kant, S. V. Pemmaraju, K. M. Sivalingam, and J. Wu, editors, Distributed Computing and Networking, 11th International Conference, ICDCN 2010, Kolkata, India, January 3--6, 2010. Proceedings, volume 5935 of Lecture Notes in Computer Science, pages 42--53. Springer, 2010.

Digital Library

[13]

A. Patra, A. Choudhary, K. Srinathan, and C. P. Rangan. Constant phase bit optimal protocols for perfectly reliable and secure message transmission. In R. Barua and T. Lange, editors, Progress in Cryptology - INDOCRYPT 2006, 7th International Conference on Cryptology in India, Kolkata, India, December 11--13, 2006, Proceedings, volume 4329 of Lecture Notes in Computer Science, pages 221--235. Springer, 2006.

Digital Library

[14]

A. Patra, A. Choudhary, K. Srinathan, and C. P. Rangan. Perfectly reliable and secure communication in directed networks tolerating mixed adversary. In A. Pelc, editor, Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24--26, 2007, Proceedings, volume 4731 of Lecture Notes in Computer Science, pages 496--498. Springer, 2007.

Digital Library

[15]

A. Patra, B. Shankar, A. Choudhary, K. Srinathan, and C. Rangan. Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary. In F. Bao, S. Ling, T. Okamoto, H. Wang, and C. Xing, editors, Cryptology and Network Security, volume 4856 of Lecture Notes in Computer Science, pages 80--101. Springer Berlin / Heidelberg, 2007.

Digital Library

[16]

A. Shamir. How to Share a Secret. Communications of the ACM, 22: 612--613, 1979.

Digital Library

[17]

K. Srinathan, A. Patra, A. Choudhary, and C. P. Rangan. Probabilistic perfectly reliable and secure message transmission - possibility, feasibility and optimality. In K. Srinathan, C. P. Rangan, and M. Yung, editors, Progress in Cryptology - INDOCRYPT 2007, 8th International Conference on Cryptology in India, Chennai, India, December 9--13, 2007, Proceedings, volume 4859 of Lecture Notes in Computer Science, pages 101--122. Springer, 2007.

Digital Library

[18]

K. Srinathan and C. P. Rangan. Possibility and complexity of probabilistic reliable communications in directed networks. In Proceedings of 25th ACM Symposium on Principles of Distributed Computing (PODC'06), 2006.

Digital Library

[19]

R. E. Tarjan. Testing graph connectivity. In Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, STOC '74, pages 185--193, New York, NY, USA, 1974. ACM.

Digital Library

Cited By

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

Index Terms

On perfectly secret message transmission in digraphs tolerating dual failures
1. Security and privacy
  1. Network security
    1. Security protocols
2. Theory of computation
  1. Computational complexity and cryptography
    1. Communication complexity
    2. Cryptographic protocols
  2. Design and analysis of algorithms
    1. Distributed algorithms

Recommendations

Perfectly secure message transmission over partially synchronous networks
ICDCN '19: Proceedings of the 20th International Conference on Distributed Computing and Networking

In a distributed network, we consider two special nodes called the sender S and the receiver R that are connected by n node-disjoint (except for S and R) bi-directional wires. Out of these n wires, the adversary can control at most t wires (of its ...
Perfectly reliable and secure message transmission tolerating mobile adversary

We study the problem of perfectly reliable message transmission (PRMT) and perfectly secure message transmission (PSMT) in an undirected synchronous network tolerating an all powerful threshold mobile Byzantine adversary. Specifically, we show that the ...
Perfectly Secure Message Transmission Tolerating Omission Faults -- Possibility Feasibility, and Optimality
ICDCN '25: Proceedings of the 26th International Conference on Distributed Computing and Networking
In a given graph with two designated nodes, namely the Sender and the Receiver, an adversary can corrupt up to any t nodes (except for S and R) of its choice in an Omission fashion (informally, if a node is corrupted in Omission fashion, the adversary can ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and Networking

January 2016

370 pages

ISBN:9781450340328

DOI:10.1145/2833312

Copyright © 2016 ACM.

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: 04 January 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Tata Consultancy Services (TCS)

Conference

ICDCN '16

ICDCN '16: 17th International Conference on Distributed Computing and Networking

January 4 - 7, 2016

Singapore, Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
81
Total Downloads

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

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

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

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.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten