Reliable communication over partially authenticated networks

DOI10.1016/S0304-3975(98)00241-2MaRDI QIDQ1292432zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Efficient reliable communication over partially authenticated networks
• Efficient reliable communication over partially authenticated networks
• Publication:4502506
• On perfectly secure communication over arbitrary networks
• Secure computation without authentication

Cites work

• scientific article; zbMATH DE number 1676651 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 54007 (Why is no real title available?)
• scientific article; zbMATH DE number 1406775 (Why is no real title available?)
• Easy impossibility proofs for distributed consensus problems
• Fault Tolerance in Networks of Bounded Degree
• New hash functions and their use in authentication and set equality
• Perfectly secure message transmission
• Reaching Agreement in the Presence of Faults
• The Byzantine generals strike again
• Tolerating a linear number of faults in networks of bounded degree
• Universal classes of hash functions

Cited in

(17)

• Mechanism design and communication networks
• Efficient reliable communication over partially authenticated networks
• The impossibility of implementing reliable communication in the face of crashes
• Learning the state of nature in repeated games with incomplete information and signals
• scientific article; zbMATH DE number 1504555 (Why is no real title available?)
• Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
• Almost-everywhere secure computation with edge corruptions
• On private computation in incomplete networks
• Secure communication over radio channels
• Boosting the Efficiency of Byzantine-Tolerant Reliable Communication
• Probabilistic reliability and privacy of communication using multicast in general neighbor networks
• Secure computation without authentication
• Must the communication graph of MPC protocols be an expander?
• On exponential lower bound for protocols for reliable communication in networks
• Communication on networks and strong reliability
• Is information-theoretic topology-hiding computation possible?
• Efficient reliable communication over partially authenticated networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292432)