DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead

DOI10.1007/978-3-031-48615-9_16MaRDI QIDQ6581801zbMATH OpenFDO

Authors Brett Hemenway Falk, Daniel Noble, Rafail M. Ostrovsky, Matan Shtepel, Jacob Zhang

Publication date 1 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48615-9_16

zbMATH Keywords

asymptotic communication complexitydistributed oblivious random access memory

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• 3-party secure computation for RAMs: optimal and concretely efficient
• 3-party distributed ORAM from oblivious set membership
• Efficient 3-party distributed ORAM
• Two-server distributed ORAM with sublinear computation and constant rounds
• Multi-client Oblivious RAM Secure Against Malicious Servers

Cites work

• 3-party distributed ORAM from oblivious set membership
• 3-party secure computation for RAMs: optimal and concretely efficient
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• A precise analysis of cuckoo hashing
• Advances in Cryptology - CRYPTO 2003
• Algebraic manipulation detection codes
• Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
• Ciphers for MPC and FHE
• Cryptanalysis of full LowMC and LowMC-M with algebraic techniques
• Data-oblivious data structures
• Distributed Oblivious RAM for Secure Two-Party Computation
• Distributed Point Functions and Their Applications
• Efficient 3-party distributed ORAM
• Efficient, oblivious data structures for MPC
• Fast large-scale honest-majority MPC for malicious adversaries
• Function secret sharing
• Garbled RAM revisited
• High-throughput secure three-party computation for malicious adversaries and an honest majority
• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• scientific article; zbMATH DE number 1161568 (Why is no real title available?)
• scientific article; zbMATH DE number 1559545 (Why is no real title available?)
• scientific article; zbMATH DE number 1875412 (Why is no real title available?)
• More robust hashing: cuckoo hashing with a stash
• Multiparty Computation from Somewhat Homomorphic Encryption
• New attacks on LowMC instances with a single plaintext/ciphertext pair
• Oblivious RAM Revisited
• Oblivious RAM with \textit{worst-case} logarithmic overhead
• Oblivious tight compaction in \(O(n)\) time with smaller constant
• On achieving the ``best of both worlds in secure multiparty computation
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• Optimized interpolation attacks on lowMC
• OptORAMa: optimal oblivious RAM
• Path ORAM
• Privacy-preserving group data access via stateless oblivious RAM simulation
• Simple and efficient two-server ORAM
• Software protection and simulation on oblivious RAMs
• Some Open Questions Related to Cuckoo Hashing
• Sub-logarithmic distributed oblivious RAM with small block size
• Theory of Cryptography
• Theory of Cryptography
• Three-party ORAM for secure computation
• Two-server distributed ORAM with sublinear computation and constant rounds
• Verifiable oblivious storage
• Yes, there is an oblivious RAM lower bound!

Cited in

(4)

• 3-party secure computation for RAMs: optimal and concretely efficient
• Privacy-preserving Dijkstra
• Multiparty distributed point functions
• Multi-server doubly efficient PIR in the classical model and beyond

This page was built for publication: DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581801)