Improved fault tolerance and secure computation on sparse networks

DOI10.1007/978-3-642-14162-1_21zbMATH Open1288.68019OpenAlexW1770158118MaRDI QIDQ3587443FDOQ3587443

Authors: Nishanth Chandran, Juan Garay, Rafail Ostrovsky 

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_21

Recommendations

• Edge Fault Tolerance on Sparse Networks
• Almost-everywhere secure computation with edge corruptions
• Almost-Everywhere Secure Computation
• Tolerating linear number of faults in networks of bounded degree
• Fault Tolerance in Networks of Bounded Degree

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10) Network protocols (68M12)

Cited In (9)

• Efficient constructions for almost-everywhere secure computation
• Oblivious transfer in incomplete networks
• Fault Tolerance in Networks of Bounded Degree
• Tolerating linear number of faults in networks of bounded degree
• Practical provably secure flooding for blockchains
• Almost-everywhere secure computation with edge corruptions
• Almost-Everywhere Secure Computation
• Must the communication graph of MPC protocols be an expander?
• Secure message transmission by public discussion: a brief survey

This page was built for publication: Improved fault tolerance and secure computation on sparse networks

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