On Proactive Perfectly Secure Message Transmission
From MaRDI portal
Publication:3608939
DOI10.1007/978-3-540-73458-1_33zbMATH Open1213.68101OpenAlexW1505726608MaRDI QIDQ3608939FDOQ3608939
Authors: Prasad Raghavendra, C. Pandu Rangan, Kannan Srinathan
Publication date: 6 March 2009
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73458-1_33
Recommendations
- On perfectly secure communication over arbitrary networks
- Perfectly reliable and secure message transmission tolerating mobile adversary
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
- Advances in Cryptology – CRYPTO 2004
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Network protocols (68M12)
Cited In (9)
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
- Perfectly reliable and secure message transmission tolerating mobile adversary
- Human Perfectly Secure Message Transmission Protocols and Their Applications
- Secure Message Delivery Games for Device-to-Device Communications
- Secure message transmission in the presence of a fully generalised adversary
- Secure Message Transmission in Asynchronous Directed Graphs
- Distributed CONGEST Algorithms against Mobile Adversaries
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
- Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity
This page was built for publication: On Proactive Perfectly Secure Message Transmission
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608939)