Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Information Processing Letters

On minimal connectivity requirements for secure message transmission in directed networks

Ravi Kishore, Chiranjeevi Vanarasa, Kannan Srinathan

Published Nov 10, 2017• 2 citations
Publisher
DOI
10.1016/j.ipl.2017.11.001

Related papers

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks

Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar +2 more

Lecture notes in computer science•Jan 1, 2008•19 citations

Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks

Manan Nayak, Shashank Agrawal, Kannan Srinathan

Lecture notes in computer science•Jan 1, 2011•7 citations

Secure message transmission on directed networks

Jérôme Renault, Ludovic Renou, Tristan Tomala

Games and Economic Behavior•Feb 2, 2014•12 citations

Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks.

Manan Nayak, Shashank Agrawal, Kannan Srinathan

Abstract. In this paper we give the minimal connectivity required in a synchronous directed network, which is under the influence of a computationally unbounded Byzantine adversary that can corrupt a subset of nodes, so that Secure Message Transmission is possible between sender S and receiver R. We also show that secure communication between a pair of nodes in a given synchronous directed network is possible in both directions if and only if reliable communication is possible between them. We assume that in a network, every node is capable of computation and we model the network along the lines of [14].

•Jan 1, 2011•0 citations

Cryptanalysis of Secure Message Transmission Protocols with Feedback.

Qiushi Yang, Yvo Desmedt

Abstract. In the context of secure point-to-point message transmission in networks with minimal connectivity, previous studies showed that feedbacks from the receiver to the sender can be used to reduce the requirements of network connectivity. We observe that the way how feedbacks were used in previous work does not guarantee perfect privacy to the transmitted message, when the adversary performs a Guessing Attack. In this paper, we shall describe our new Guessing Attack to some existing protocols (in fact, we are the first to point out a flaw in the protocols of Desmedt-Wang’s Eurocrypt’02 paper and of Patra-Shankar-Choudhary-Srinathan-Rangan’s CANS’07 paper), and propose a scheme defending against a general adversary structure. In addition, we also show how to achieve almost perfectly secure message transmission with feedbacks when perfect reliability or perfect privacy is not strictly required.

•Jan 1, 2009•0 citations

Efficient Secure Communication over Dynamic Incomplete Networks with Minimal Connectivity

Ivan Damgård, Divya Ravi, Lawrence Roy +2 more

Lecture notes in computer science•Dec 2, 2024•0 citations
Abstract. In this paper we give the minimal connectivity required in a synchronous directed network, which is under the influence of a computationally unbounded Byzantine adversary that can corrupt a subset of nodes, so that Secure Message Transmission is possible between sender S and receiver R. We also show that secure communication between a pair of nodes in a given synchronous directed network is possible in both directions if and only if reliable communication is possible between them. We assume that in a network, every node is capable of computation and we model the network along the lines of [14].
Abstract. In the context of secure point-to-point message transmission in networks with minimal connectivity, previous studies showed that feedbacks from the receiver to the sender can be used to reduce the requirements of network connectivity. We observe that the way how feedbacks were used in previous work does not guarantee perfect privacy to the transmitted message, when the adversary performs a Guessing Attack. In this paper, we shall describe our new Guessing Attack to some existing protocols (in fact, we are the first to point out a flaw in the protocols of Desmedt-Wang’s Eurocrypt’02 paper and of Patra-Shankar-Choudhary-Srinathan-Rangan’s CANS’07 paper), and propose a scheme defending against a general adversary structure. In addition, we also show how to achieve almost perfectly secure message transmission with feedbacks when perfect reliability or perfect privacy is not strictly required.