On perfectly secret message transmission in digraphs tolerating dual failures


Consider a synchronous distributed network which is partly controlled by an adversary. In a Perfectly Secret Message Transmission(PSMT) protocol, the sender <i>S</i> wishes to transmit a message to the receiver <i>R</i> such that the adversary learns nothing about the message. We characterize the set of directed graphs that admit PSMT protocols tolerating a… (More)
DOI: 10.1145/2833312.2833327


6 Figures and Tables