Multiparty garbling from OT with linear scaling and RAM support
From MaRDI portal
Cites work
- \textsc{EpiGRAM}: practical garbled RAM
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- Adaptive succinct garbled RAM or: how to delegate your database
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Black-box garbled RAM
- Black-box parallel garbled RAM
- Dishonest majority constant-round MPC with linear communication from DDH
- Efficient constant round multi-party computation combining BMR and SPDZ
- Efficient pseudorandom correlation generators from ring-LPN
- Foundations of Cryptography
- Fully succinct garbled RAM
- Garbled RAM from one-way functions
- Garbled RAM revisited
- How to garble RAM programs?
- Improved Garbled Circuit: Free XOR Gates and Applications
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- Le Mans: dynamic and fluid MPC for dishonest majority
- Low cost constant round MPC combining BMR and oblivious transfer
- More efficient constant-round multi-party computation from BMR and SHE
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Multiparty garbling from OT with linear scaling and RAM support
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- Overdrive: making SPDZ great again
- Robust Multiparty Computation with Linear Communication Complexity
- Secure multiparty RAM computation in constant rounds
- Semi-homomorphic encryption and multiparty computation
- Sharing transformation and dishonest majority MPC with packed secret sharing
- Tri-state circuits. A circuit model that captures RAM
Cited in
(3)
This page was built for publication: Multiparty garbling from OT with linear scaling and RAM support
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863892)
