Efficient, oblivious data structures for MPC

DOI10.1007/978-3-662-45608-8_27MaRDI QIDQ2936626zbMATH OpenOpenAlexFDO

Authors 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 structuresmultiparty computationoblivious RAMshortest path algorithm

Mathematics Subject Classification ID

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

Recommendations

• A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
• Data-oblivious data structures
• The oblivious machine. Or: how to put the C into MPC
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• 3-party distributed ORAM from oblivious set membership

Cited in

(23)

• Constant-round maliciously secure two-party computation in the RAM model
• Going beyond dual execution: MPC for functions with efficient verification
• Private liquidity matching using MPC
• Improved building blocks for secure multi-party computation based on secret sharing with honest majority
• The oblivious machine. Or: how to put the C into MPC
• Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory
• PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
• Secret-shared shuffle
• Private database access with HE-over-ORAM architecture
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• Privacy-preserving k-nearest neighbour query on outsourced database
• Reducing the Overhead of MPC over a Large Population
• Data-oblivious graph algorithms in outsourced external memory
• Constant-round maliciously secure two-party computation in the RAM model
• Practically efficient multi-party sorting protocols from comparison sort algorithms
• Asymptotically tight bounds for composing ORAM with PIR
• Practically efficient secure single-commodity multi-market auctions
• Is there an oblivious RAM lower bound for online reads?
• Is there an oblivious RAM lower bound for online reads?
• Oblivious parallel tight compaction
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Privacy-preserving Dijkstra
• Optimal offline ORAM with perfect security via simple oblivious priority queues

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)