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

Journal of Cryptology

Secure Communication in Minimal Connectivity Models

Matthew Franklin, Rebecca N. Wright

Published Jan 1, 2000• 126 citations
Publisher
DOI
10.1007/s001459910002

Related papers

Secure communication in minimal connectivity models

Matthew Franklin, Rebecca N. Wright

Lecture notes in computer science•Jan 1, 1998•40 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

On minimal connectivity requirements for secure message transmission in directed networks

Ravi Kishore, Chiranjeevi Vanarasa, Kannan Srinathan

Information Processing Letters•Nov 10, 2017•2 citations

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•18 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

Algorithmic Aspects of Secure Computation and Communication

Matt Franklin

Lecture notes in computer science•Jan 1, 2010•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].