Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission

DOI10.1016/j.tcs.2012.12.004zbMath1294.68041OpenAlexW2050091704MaRDI QIDQ391242

Shashank Agrawal, Kannan Srinathan, Abhinav Mehta

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.004

zbMATH Keywords

unconditional securitydirected graphsByzantine adversaryreliable message transmission

Mathematics Subject Classification ID

Distributed systems (68M14) Directed graphs (digraphs), tournaments (05C20) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Communication theory (94A05)

Cites Work

• Player simulation and general adversary structures in perfect multiparty computation
• Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
• 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
• Possibility and complexity of probabilistic reliable communication in directed networks
• Asynchronous secure computation
• Constant phase efficient protocols for secure message transmission in directed networks
• Unnamed Item
• Unnamed Item
• Unnamed Item