On minimal connectivity requirements for secure message transmission in directed networks

DOI10.1016/J.IPL.2017.11.001zbMath1423.68074OpenAlexW2767857593MaRDI QIDQ1685018

Chiranjeevi Vanarasa, Ravi Kishore, Srinathan Kannan

Publication date: 13 December 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.11.001

zbMATH Keywords

fault tolerancedistributed computingsecure communicationinformation theoretic security

Mathematics Subject Classification ID

Information theory (general) (94A15) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Cites Work

• Unnamed Item
• Secure communication in minimal connectivity models
• Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity
• 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
• Perfectly Secure Message Transmission Revisited
• Perfectly secure message transmission
• On perfectly secure communication over arbitrary networks
• Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality

This page was built for publication: On minimal connectivity requirements for secure message transmission in directed networks