Reliable communication over partially authenticated networks

DOI10.1016/S0304-3975(98)00241-2zbMath0916.68008OpenAlexW1999268372MaRDI QIDQ1292432

Matthew Franklin, Amos Beimel

Publication date: 21 June 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00241-2

zbMATH Keywords

graph connectivityprivate communicationByzantine failuresreliable communicationauthentication keys

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (8)

Learning the state of nature in repeated games with incomplete information and signals ⋮ Is information-theoretic topology-hiding computation possible? ⋮ Mechanism design and communication networks ⋮ Probabilistic reliability and privacy of communication using multicast in general neighbor networks ⋮ Almost-everywhere secure computation with edge corruptions ⋮ On private computation in incomplete networks ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Efficient reliable communication over partially authenticated networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Easy impossibility proofs for distributed consensus problems
• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• Tolerating a linear number of faults in networks of bounded degree
• Fault Tolerance in Networks of Bounded Degree
• Reaching Agreement in the Presence of Faults
• The Byzantine generals strike again
• Perfectly secure message transmission

This page was built for publication: Reliable communication over partially authenticated networks