Efficient, Oblivious Data Structures for MPC

DOI10.1007/978-3-662-45608-8_27zbMATH Open1317.94116OpenAlexW2181401201MaRDI QIDQ2936626FDOQ2936626

Marcel Keller, Peter Scholl

Publication date: 6 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45608-8_27

zbMATH Keywords

data structuresshortest path algorithmmultiparty computationoblivious RAM

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Data structures (68P05)

Cited In (19)

• 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
• Asymptotically Tight Bounds for Composing ORAM with PIR
• Improved building blocks for secure multi-party computation based on secret sharing with honest majority
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Constant-round maliciously secure two-party computation in the RAM model
• Reducing the Overhead of MPC over a Large Population
• Is there an oblivious RAM lower bound for online reads?
• Private Database Access with HE-over-ORAM Architecture
• Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
• Private liquidity matching using MPC
• PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
• Oblivious parallel tight compaction
• Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database
• Going beyond dual execution: MPC for functions with efficient verification
• Privacy-preserving Dijkstra
• Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
• Secret-shared shuffle
• Practically Efficient Secure Single-Commodity Multi-market Auctions

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)