Efficient reliable communication over partially authenticated networks

DOI10.1007/s00446-004-0119-yzbMath1264.94107OpenAlexW2027982631MaRDI QIDQ5917936

Lior Malka, Amos Beimel

Publication date: 7 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-004-0119-y

zbMATH Keywords

fault toleranceauthenticationreliable communicationincomplete networks

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items

Is information-theoretic topology-hiding computation possible?, 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
• Reliable communication over partially authenticated networks
• Tolerating a linear number of faults in networks of bounded degree
• Efficient perfectly secure message transmission in synchronous networks
• Secure communication in minimal connectivity models
• Fault Tolerance in Networks of Bounded Degree
• The Byzantine generals strike again
• Perfectly secure message transmission
• Fault-tolerant Computation in the Full Information Model
• On perfectly secure communication over arbitrary networks
• Efficient reliable communication over partially authenticated networks
• Secure communication in multicast channels: The answer to Franklin and Wright's question