Two-server distributed ORAM with sublinear computation and constant rounds
type: Item
instance of: scholarly article
title: Two-server distributed ORAM with sublinear computation and constant rounds
DOI: 10.1007/978-3-030-75248-4_18
author: Ariel Hamlin
author: Mayank Varia
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68Mxx
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7450216
zbMATH Keywords: distributed oblivious RAM
zbMATH Keywords: square root ORAM
zbMATH Keywords: doubly efficient PIR
zbMATH Keywords: secure multi-party computation
zbMATH Keywords: fast Fourier transform
MaRDI profile type: Publication
full work available at URL: 978-3-030-75248-4 18
OpenAlex ID: W3165771813
cites work: Asymptotically Tight Bounds for Composing ORAM with PIR
cites work: OptORAMa: optimal oblivious RAM
cites work: Permuted puzzles and cryptographic hardness
cites work: Can we access a database both locally and privately?
cites work: Efficient 3-party distributed ORAM
cites work: Towards doubly efficient private information retrieval
cites work: More is less: perfectly secure oblivious algorithms in the multi-server setting
cites work: An Algorithm for the Machine Calculation of Complex Fourier Series
cites work: Theory of Cryptography
cites work: Public Key Cryptography - PKC 2005
cites work: Additive Fast Fourier Transforms Over Finite Fields
cites work: Garbled RAM From One-Way Functions
cites work: Garbled RAM Revisited
cites work: Software protection and simulation on oblivious RAMs
cites work: Simple and efficient two-server ORAM
cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
cites work: 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
cites work: Sub-logarithmic distributed oblivious RAM with small block size
cites work: Distributed Oblivious RAM for Secure Two-Party Computation
cites work: How to Garble RAM Programs?
cites work: Two-sided malicious security for private intersection-sum with cardinality
cites work: Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
cites work: Q4526994
cites work: Is there an oblivious RAM lower bound for online reads?
description: scientific article; zbMATH DE number 7450216