Constant phase efficient protocols for secure message transmission in directed networks
DOI10.1145/1281100.1281153zbMATH Open1283.94080OpenAlexW2012366430MaRDI QIDQ5401437FDOQ5401437
Authors: Arpita Patra, Ashish Choudhury, C. Pandu Rangan 
Publication date: 13 March 2014
Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1281100.1281153
Recommendations
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
- Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
- Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
Information theory (general) (94A15) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network design and communication in computer systems (68M10)
Cited In (5)
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
- Secure Message Transmission in Asynchronous Directed Graphs
- Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
- On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
This page was built for publication: Constant phase efficient protocols for secure message transmission in directed networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401437)
