Edge Fault Tolerance on Sparse Networks

DOI10.1007/978-3-642-31585-5_41MaRDI QIDQ3167034zbMATH OpenOpenAlexFDO

Authors Nishanth Chandran, Juan Garay, 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)

Recommendations

• Edge-fault tolerance of hypercube-like networks
• Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
• Edge fault tolerance in graphs
• Edge fault tolerance analysis of a class of interconnection networks
• Fault tolerance of hypercube like networks: spanning laceability under edge faults
• Edge fault tolerance analysis of super \(k\)-restricted connected networks
• Fault Tolerance in Networks of Bounded Degree
• Sparse networks tolerating random faults.
• Building edge-failure resilient networks
• scientific article; zbMATH DE number 2086939

Cited in

(16)

• scientific article; zbMATH DE number 2086939 (Why is no real title available?)
• Adaptive security, erasures, and network assumptions in communication-local MPC
• Invited talk: Resilient distributed algorithms
• Distributed computing in asynchronous networks with byzantine edges
• Efficient constructions for almost-everywhere secure computation
• Oblivious transfer in incomplete networks
• Edge fault tolerance analysis of super \(k\)-restricted connected networks
• Distributed corruption detection in networks
• Fault Tolerance in Networks of Bounded Degree
• Tolerating linear number of faults in networks of bounded degree
• Edge fault tolerance analysis of a class of interconnection networks
• Conditional edge-fault-tolerant Hamiltonicity of the data center network
• Almost-everywhere secure computation with edge corruptions
• Is information-theoretic topology-hiding computation possible?
• Improved fault tolerance and secure computation on sparse networks
• Must the communication graph of MPC protocols be an expander?

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

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