Security of trusted repeater quantum key distribution networks
Journal of Computer Security - EU-Funded ICT Research on Trust and Security
Building a Quantum Network: How to Optimize Security and Expenses
Journal of Network and Systems Management
Cryptanalysis of secure message transmission protocols with feedback
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Public discussion must be back and forth in secure message transmission
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Secure communication in multicast graphs
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
On Game-Theoretic Network Security Provisioning
Journal of Network and Systems Management
| Hi-index | 754.84 |
Secure communications guaranteeing reliability and privacy (without unproven assumptions) in networks with active adversaries has been an important research issue. It has been studied for point to point networks by Dolev-Dwork-Waarts-Yung (J. ACM 1993), Desmedt-Wang (Eurocrypt 2002), and Srinathan-Narayanan-Rangan (Crypto 2004). Dolev-Dwork-Waarts-Yung gave necessary and sufficient conditions for secure communication in networks with the condition that (1) all the channels are two-way; or (2) all the channels are one-way from the sender to the receiver. In this paper, we study the general case with a network modeled by a directed graph. In this general case, there are communication channels from the sender to the receiver and there are feedback channels from the receiver to the sender. We give necessary and sufficient bounds on the number of channels that are required from sender to receiver given a number of ldquofeedbackrdquo channels from receiver to sender. We give these bounds for the case reliability is perfect, as well as for the case it is not perfect.