Improved building blocks for secure multi-party computation based on secret sharing with honest majority
From MaRDI portal
Publication:2229285
DOI10.1007/978-3-030-57808-4_19OpenAlexW3081957293MaRDI QIDQ2229285FDOQ2229285
Authors: Marina Blanton, Ahreum Kang, Chen Yuan
Publication date: 23 February 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57808-4_19
Recommendations
Cites Work
- Estimating the dimension of a model
- How to share a secret
- Title not available (Why is that?)
- Scalable and Unconditionally Secure Multiparty Computation
- Theory of Cryptography
- Software protection and simulation on oblivious RAMs
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Improved primitives for secure multiparty integer computation
- Three-party ORAM for secure computation
- Parent Assignment Is Hard for the MDL, AIC, and NML Costs
- Efficient maliciously secure multiparty computation for RAM
- 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
- Efficient, oblivious data structures for MPC
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority
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)