Improved Fault Tolerance and Secure Computation on Sparse Networks

DOI10.1007/978-3-642-14162-1_21zbMath1288.68019OpenAlexW1770158118MaRDI QIDQ3587443

Nishanth Chandran, Rafail Ostrovsky, Juan A. Garay

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

Mathematics Subject Classification ID

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

Related Items (6)

Oblivious transfer in incomplete networks ⋮ Practical provably secure flooding for blockchains ⋮ Almost-everywhere secure computation with edge corruptions ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Efficient constructions for almost-everywhere secure computation

This page was built for publication: Improved Fault Tolerance and Secure Computation on Sparse Networks