Efficient constructions for almost-everywhere secure computation
From MaRDI portal
Publication:2119011
DOI10.1007/978-3-030-45724-2_6OpenAlexW2970212503MaRDI QIDQ2119011
Srinivasan Raghuraman, Nikhil Vyas, Siddhartha Jayanti
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_6
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)
Related Items (1)
Cites Work
- Agreement in the presence of faults, on networks of bounded degree
- Edge Fault Tolerance on Sparse Networks
- Scalable leader election
- Improved Fault Tolerance and Secure Computation on Sparse Networks
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- Bounds on information exchange for Byzantine agreement
- Fault Tolerance in Networks of Bounded Degree
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- An efficient algorithm for byzantine agreement without authentication
- Tolerating linear number of faults in networks of bounded degree
- Secure Computation Without Authentication
- Almost-Everywhere Secure Computation
This page was built for publication: Efficient constructions for almost-everywhere secure computation
