Secure Message Transmission in Asynchronous Directed Graphs
From MaRDI portal
Publication:3104754
DOI10.1007/978-3-642-25578-6_26zbMATH Open1291.94040OpenAlexW191359512MaRDI QIDQ3104754FDOQ3104754
Authors: Shashank Agrawal, Abhinav Mehta, Kannan Srinathan 
Publication date: 16 December 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25578-6_26
Recommendations
- Secure message transmission on directed networks
- Secure message transmission in asynchronous networks
- Secure communication in multicast graphs
- Absolutely secure message transmission using a key sharing graph
- Efficient perfectly secure message transmission in synchronous networks
- On the communication complexity of reliable and secure message transmission in asynchronous networks
- Proactive secure message transmission in asynchronous networks
- On minimal connectivity requirements for secure message transmission in directed networks
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
Cites Work
- How to share a secret
- Title not available (Why is that?)
- Player simulation and general adversary structures in perfect multiparty computation
- Impossibility of distributed consensus with one faulty process
- The Byzantine Generals Problem
- Perfectly secure message transmission
- Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
- Title not available (Why is that?)
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
- Title not available (Why is that?)
- Cryptanalysis of secure message transmission protocols with feedback
- Possibility and complexity of probabilistic reliable communication in directed networks
- Constant phase efficient protocols for secure message transmission in directed networks
- Efficient perfectly secure message transmission in synchronous networks
- Secure communication in minimal connectivity models
- Advances in Cryptology – CRYPTO 2004
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
- On perfectly secure communication over arbitrary networks
- Title not available (Why is that?)
- On Proactive Perfectly Secure Message Transmission
- Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme
- Minimal connectivity for unconditionally secure message transmission in synchronous directed networks
- Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
Cited In (7)
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission
- On the communication complexity of reliable and secure message transmission in asynchronous networks
- Secure Message Delivery Games for Device-to-Device Communications
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
- On minimal connectivity requirements for secure message transmission in directed networks
- Minimal connectivity for unconditionally secure message transmission in synchronous directed networks
- Bounds and constructions for \(1\)-round \((0,\delta )\)-secure message transmission against generalized adversary
This page was built for publication: Secure Message Transmission in Asynchronous Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104754)
