| Title | On Perfectly Secret Message Transmission in Digraphs Tolerating Dual Failures |
| Publication Type | Conference Paper |
| Year of Publication | 2016 |
| Authors | Kishore, Ravi, Vanarasa, Chiranjeevi, Jha, Tushant, Srinathan, Kannan |
| Conference Name | Proceedings of the 17th International Conference on Distributed Computing and Networking |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 978-1-4503-4032-8 |
| Keywords | Adversary Models, directed networks, Human Behavior, information theoretic security, mixed adversary, perfect security, pubcrawl, reliable and secure message transmission, Resiliency, scalabilty, threshold adversary |
| 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 tp nodes are passively corrupted and further up to any tf nodes may fail. |
| URL | http://doi.acm.org/10.1145/2833312.2833327 |
| DOI | 10.1145/2833312.2833327 |
| Citation Key | kishore_perfectly_2016 |
On Perfectly Secret Message Transmission in Digraphs Tolerating Dual Failures