Asynchronous secure communication tolerating mixed adversaries
From MaRDI portal
Recommendations
- Asynchronous perfectly secure computation tolerating generalized adversaries
- Secure message transmission in asynchronous networks
- Asynchronous perfectly secure communication over one-time pads
- On the communication complexity of reliable and secure message transmission in asynchronous networks
- Private Interactive Communication Across an Adversarial Channel
- Private interactive communication across an adversarial channel
- Proactive secure message transmission in asynchronous networks
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
- Secure message transmission in the presence of a fully generalised adversary
- Security in Asynchronous Interactive Systems
Cited in
(10)- Ordered and delayed adversaries and how to work against them on a shared channel
- Proactive secure message transmission in asynchronous networks
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
- On perfectly secure communication over arbitrary networks
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
- Asynchronous perfectly secure communication over one-time pads
- Algorithms and Computation
- Secure message transmission in asynchronous networks
- Security in Asynchronous Interactive Systems
- Secure communication in dynamic incomplete networks
This page was built for publication: Asynchronous secure communication tolerating mixed adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412800)