Two-server distributed ORAM with sublinear computation and constant rounds

DOI10.1007/978-3-030-75248-4_18MaRDI QIDQ2061970zbMATH OpenOpenAlexFDO

Authors Ariel Hamlin, Mayank Varia

Publication date 21 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-75248-4_18

zbMATH Keywords

distributed oblivious RAMdoubly efficient PIRfast Fourier transformsecure multi-party computationsquare root ORAM

Mathematics Subject Classification ID

Computer system organization (68Mxx) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Sub-logarithmic distributed oblivious RAM with small block size
• Efficient 3-party distributed ORAM
• Simple and efficient two-server ORAM
• 3-party distributed ORAM from oblivious set membership
• Distributed Oblivious RAM for Secure Two-Party Computation

Cites work

• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• Additive Fast Fourier Transforms Over Finite Fields
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Asymptotically tight bounds for composing ORAM with PIR
• Can we access a database both locally and privately?
• Distributed Oblivious RAM for Secure Two-Party Computation
• Efficient 3-party distributed ORAM
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Garbled RAM from one-way functions
• Garbled RAM revisited
• How to garble RAM programs?
• scientific article; zbMATH DE number 1559545 (Why is no real title available?)
• Is there an oblivious RAM lower bound for online reads?
• More is less: perfectly secure oblivious algorithms in the multi-server setting
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• OptORAMa: optimal oblivious RAM
• Permuted puzzles and cryptographic hardness
• Public Key Cryptography - PKC 2005
• 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
• Towards doubly efficient private information retrieval
• Two-sided malicious security for private intersection-sum with cardinality

Cited in

(9)

• Simple and efficient two-server ORAM
• Efficient 3-party distributed ORAM
• Sub-logarithmic distributed oblivious RAM with small block size
• CNF-FSS and its applications
• Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
• 3-party distributed ORAM from oblivious set membership
• scientific article; zbMATH DE number 7724191 (Why is no real title available?)
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Multi-server doubly efficient PIR in the classical model and beyond

This page was built for publication: Two-server distributed ORAM with sublinear computation and constant rounds

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