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

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

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)

Cites Work

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

Cited In (6)

• 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

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)