Edge Fault Tolerance on Sparse Networks

DOI10.1007/978-3-642-31585-5_41zbMath1343.68034OpenAlexW35865300MaRDI QIDQ3167034

Juan A. Garay, Nishanth Chandran, Rafail Ostrovsky

Publication date: 1 November 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_41

zbMATH Keywords

fault tolerancesecure multiparty computationbounded-degree networkalmost-everywhere agreement

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

Oblivious transfer in incomplete networks ⋮ Is information-theoretic topology-hiding computation possible? ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Efficient constructions for almost-everywhere secure computation

This page was built for publication: Edge Fault Tolerance on Sparse Networks