3-party distributed ORAM from oblivious set membership

DOI10.1007/978-3-031-14791-3_19zbMATH Open1518.94059OpenAlexW3214571166MaRDI QIDQ6134831FDOQ6134831

Authors

Publication date 25 July 2023

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

Full work available at URL https://doi.org/10.1007/978-3-031-14791-3_19

zbMATH Keywords

secure multiparty computationobliviously accesssecret-shared arraysecret-shared index

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Data structures (68P05) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient 3-party distributed ORAM
• Sub-logarithmic distributed oblivious RAM with small block size
• Three-party ORAM for secure computation
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• Two-server distributed ORAM with sublinear computation and constant rounds

Cites Work

• scientific article; zbMATH DE number 1559545 (Why is no real title available?)
• scientific article; zbMATH DE number 3793997 (Why is no real title available?)
• 3-party distributed ORAM from oblivious set membership
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
• Ciphers for MPC and FHE
• Data-oblivious data structures
• Distributed Oblivious RAM for Secure Two-Party Computation
• Distributed Point Functions and Their Applications
• Efficient 3-party distributed ORAM
• Efficient cache attacks on AES, and countermeasures
• Function secret sharing
• Large message homomorphic secret sharing from DCR and applications
• More is less: perfectly secure oblivious algorithms in the multi-server setting
• More robust hashing: cuckoo hashing with a stash
• Oblivious RAM Revisited
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• OptORAMa: optimal oblivious RAM
• Path ORAM
• Privacy-preserving group data access via stateless oblivious RAM simulation
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Relations Among Complexity Measures
• Simple and efficient two-server ORAM
• Software protection and simulation on oblivious RAMs
• Sub-logarithmic distributed oblivious RAM with small block size
• Theory of Cryptography
• Three-party ORAM for secure computation
• Time bounded random access machines
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• Two-server distributed ORAM with sublinear computation and constant rounds
• Verifiable oblivious storage
• Yes, there is an oblivious RAM lower bound!

Cited In (8)

• Two-server distributed ORAM with sublinear computation and constant rounds
• Efficient 3-party distributed ORAM
• 3-party distributed ORAM from oblivious set membership
• Efficient, oblivious data structures for MPC
• 3-party secure computation for RAMs: optimal and concretely efficient
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Three-party ORAM for secure computation
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval

This page was built for publication: 3-party distributed ORAM from oblivious set membership

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