Research Repository

Secure message transmission on directed networks

Renault, Jérôme and Renou, Ludovic and Tomala, Tristan (2014) 'Secure message transmission on directed networks.' Games and Economic Behavior, 85. pp. 1-18. ISSN 0899-8256

Full text not available from this repository.


A sender wishes to transmit a secret to a receiver through a communication network, where some nodes are controlled by an adversary. We characterize the directed networks for which there exist ε -secret and ε -strongly secure communication protocols (∀ε>0∀ε>0): if all nodes are obedient the receiver learns the secret with probability at least 1−ε1−ε and no information is leaked (secrecy), and this property is maintained under every strategy of the adversary (security). For secrecy, a necessary and sufficient condition is that there is a directed path from the sender to the receiver, and for each possible adversarial coalition A, there is an undirected path from the sender to the receiver that contains no node in A. For security, a necessary and sufficient condition is that for every possible adversarial coalition A, the graph obtained by removing all nodes in A still has the previous property.

Item Type: Article
Uncontrolled Keywords: Secure communication; Protocols; Communication
Subjects: H Social Sciences > HB Economic Theory
Divisions: Faculty of Social Sciences > Economics, Department of
Depositing User: Jim Jamieson
Date Deposited: 14 Jan 2015 13:25
Last Modified: 14 Jan 2015 13:25

Actions (login required)

View Item View Item