Almost-everywhere secure computation with edge corruptions
DOI10.1007/S00145-013-9176-3zbMATH Open1332.94062OpenAlexW1995324556MaRDI QIDQ901366FDOQ901366
Nishanth Chandran, Juan 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
Byzantine agreementsecure message transmissionbounded-degree networkalmost-everywhere secure computation
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Perfectly secure message transmission
- Reliable broadcasting in hypercubes with random link and node failures
- Authenticated broadcast with a partially compromised public-key infrastructure
- Secure Computation Without Authentication
- Almost-Everywhere Secure Computation
- Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
- Reliable communication over partially authenticated networks
- Efficient player-optimal protocols for strong and differential consensus
- Secure Message Transmission by Public Discussion: A Brief Survey
- Improved Fault Tolerance and Secure Computation on Sparse Networks
- Realistic Failures in Secure Multi-party Computation
- Reliable communication in networks with Byzantine link failures
- Tolerating linear number of faults in networks of bounded degree
Cited In (4)
This page was built for publication: Almost-everywhere secure computation with edge corruptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901366)
