Efficient, oblivious data structures for MPC
From MaRDI portal
Publication:2936626
Recommendations
Cited in
(22)- Privacy-preserving \(k\)-nearest neighbour query on outsourced database
- The oblivious machine. Or: how to put the C into MPC
- Practically efficient secure single-commodity multi-market auctions
- Data-oblivious graph algorithms in outsourced external memory
- Practically efficient multi-party sorting protocols from comparison sort algorithms
- Privacy-preserving Dijkstra
- Oblivious parallel tight compaction
- Is there an oblivious RAM lower bound for online reads?
- Going beyond dual execution: MPC for functions with efficient verification
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Constant-round maliciously secure two-party computation in the RAM model
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority
- Private liquidity matching using MPC
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
- Is there an oblivious RAM lower bound for online reads?
- Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory
- Private database access with HE-over-ORAM architecture
- Reducing the Overhead of MPC over a Large Population
- Asymptotically tight bounds for composing ORAM with PIR
- Constant-round maliciously secure two-party computation in the RAM model
- Secret-shared shuffle
This page was built for publication: Efficient, oblivious data structures for MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936626)