Improved building blocks for secure multi-party computation based on secret sharing with honest majority
From MaRDI portal
(Redirected from Publication:2229285)
Recommendations
Cites work
- scientific article; zbMATH DE number 2087596 (Why is no real title available?)
- 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
- Efficient maliciously secure multiparty computation for RAM
- Efficient, oblivious data structures for MPC
- Estimating the dimension of a model
- How to share a secret
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority
- Improved primitives for secure multiparty integer computation
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Parent Assignment Is Hard for the MDL, AIC, and NML Costs
- Scalable and Unconditionally Secure Multiparty Computation
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Software protection and simulation on oblivious RAMs
- Theory of Cryptography
- Three-party ORAM for secure computation
Cited in
(3)
This page was built for publication: Improved building blocks for secure multi-party computation based on secret sharing with honest majority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229285)