Two-server distributed ORAM with sublinear computation and constant rounds
From MaRDI portal
Publication:2061970
DOI10.1007/978-3-030-75248-4_18OpenAlexW3165771813MaRDI QIDQ2061970
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_18
fast Fourier transformsecure multi-party computationdistributed oblivious RAMdoubly efficient PIRsquare root ORAM
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)
Related Items (3)
CNF-FSS and Its Applications ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ 3-party distributed ORAM from oblivious set membership
Cites Work
- Unnamed Item
- 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Simple and efficient two-server ORAM
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Two-sided malicious security for private intersection-sum with cardinality
- Efficient 3-party distributed ORAM
- OptORAMa: optimal oblivious RAM
- Permuted puzzles and cryptographic hardness
- Sub-logarithmic distributed oblivious RAM with small block size
- Garbled RAM From One-Way Functions
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Software protection and simulation on oblivious RAMs
- Distributed Oblivious RAM for Secure Two-Party Computation
- How to Garble RAM Programs?
- Additive Fast Fourier Transforms Over Finite Fields
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Garbled RAM Revisited
- Public Key Cryptography - PKC 2005
- Asymptotically Tight Bounds for Composing ORAM with PIR
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Theory of Cryptography
- Is there an oblivious RAM lower bound for online reads?
This page was built for publication: Two-server distributed ORAM with sublinear computation and constant rounds
