Efficient constructions for almost-everywhere secure computation
From MaRDI portal
Recommendations
- Almost-Everywhere Secure Computation
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Efficient non-interactive secure computation
- An Architecture for Provably Secure Computation
- scientific article; zbMATH DE number 1583776
- Efficient fully secure computation via distributed zero-knowledge proofs
- An efficient construction of non-interactive secure multiparty computation
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Cites work
- Agreement in the presence of faults, on networks of bounded degree
- Almost-Everywhere Secure Computation
- An efficient algorithm for byzantine agreement without authentication
- Bounds on information exchange for Byzantine agreement
- Edge Fault Tolerance on Sparse Networks
- Fault Tolerance in Networks of Bounded Degree
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- Improved fault tolerance and secure computation on sparse networks
- Reaching Agreement in the Presence of Faults
- Scalable leader election
- Secure Computation Without Authentication
- The Byzantine Generals Problem
- Tolerating linear number of faults in networks of bounded degree
Cited in
(4)
This page was built for publication: Efficient constructions for almost-everywhere secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2119011)
