Almost-everywhere secure computation with edge corruptions

DOI10.1007/S00145-013-9176-3zbMath1332.94062OpenAlexW1995324556MaRDI QIDQ901366

Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky

Publication date: 11 January 2016

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-013-9176-3

zbMATH Keywords

Byzantine agreementsecure message transmissionbounded-degree networkalmost-everywhere secure computation

Mathematics Subject Classification ID

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

Related Items (3)

Practical provably secure flooding for blockchains ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Network-Hiding Communication and Applications to Multi-party Protocols

Cites Work

• Reliable communication over partially authenticated networks
• Authenticated broadcast with a partially compromised public-key infrastructure
• Reliable Broadcasting in Hypercubes with Random Link and Node Failures
• Efficient player-optimal protocols for strong and differential consensus
• Secure Message Transmission by Public Discussion: A Brief Survey
• Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
• Improved Fault Tolerance and Secure Computation on Sparse Networks
• Realistic Failures in Secure Multi-party Computation
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Reliable communication in networks with Byzantine link failures
• Perfectly secure message transmission
• Tolerating linear number of faults in networks of bounded degree
• Secure Computation Without Authentication
• Almost-Everywhere Secure Computation

This page was built for publication: Almost-everywhere secure computation with edge corruptions