Visible to the public Biblio

Filters: Author is Srinathan, Kannan  [Clear All Filters]
2017-10-04
Kishore, Ravi, Vanarasa, Chiranjeevi, Jha, Tushant, Srinathan, Kannan.  2016.  On Perfectly Secret Message Transmission in Digraphs Tolerating Dual Failures. Proceedings of the 17th International Conference on Distributed Computing and Networking. :29:1–29:10.
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 tp nodes are passively corrupted and further up to any tf nodes may fail.