Secure Message Transmission in Asynchronous Directed Graphs
From MaRDI portal
Publication:3104754
DOI10.1007/978-3-642-25578-6_26zbMath1291.94040OpenAlexW191359512MaRDI QIDQ3104754
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient perfectly secure message transmission in synchronous networks
- Secure communication in minimal connectivity models
- Player simulation and general adversary structures in perfect multiparty computation
- Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks
- How to share a secret
- Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
- Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
- On Proactive Perfectly Secure Message Transmission
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
- Impossibility of distributed consensus with one faulty process
- The Byzantine Generals Problem
- Perfectly secure message transmission
- Cryptanalysis of Secure Message Transmission Protocols with Feedback
- Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme
- On perfectly secure communication over arbitrary networks
- Possibility and complexity of probabilistic reliable communication in directed networks
- Advances in Cryptology – CRYPTO 2004
- Constant phase efficient protocols for secure message transmission in directed networks
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
This page was built for publication: Secure Message Transmission in Asynchronous Directed Graphs
