Efficient, oblivious data structures for MPC

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

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

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

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 (22)

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

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)