Simple and efficient two-server ORAM
type: Item
instance of: scholarly article
title: Simple and efficient two-server ORAM
zbMATH Open document ID: 1447.94040
DOI: 10.1007/978-3-030-03332-3_6
author: S. Dov Gordon
author: Xiao Wang
author: Jonathan Katz
publication date: 2019-01-23T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7005637
MaRDI profile type: Publication
full work available at URL: 978-3-030-03332-3 6
OpenAlex ID: W2794597202
cites work: Asymptotically Tight Bounds for Composing ORAM with PIR
cites work: Verifiable Oblivious Storage
cites work: Function Secret Sharing
cites work: Q4250776
cites work: Q4231909
cites work: Three-Party ORAM for Secure Computation
cites work: TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
cites work: Optimizing ORAM and Using It Efficiently for Secure Computation
cites work: Automata, Languages and Programming
cites work: Software protection and simulation on oblivious RAMs
cites work: Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
cites work: Q5743385
cites work: Distributed Oblivious RAM for Secure Two-Party Computation
cites work: Q4526994
cites work: Oblivious RAM Revisited
cites work: Oblivious RAM with O((logN)3) Worst-Case Cost
Recommended article: Two-server distributed ORAM with sublinear computation and constant rounds
Recommended article: Efficient 3-party distributed ORAM
Recommended article: Path ORAM
Recommended article: Efficient Implementation of the Orlandi Protocol
Recommended article: On fast algorithms for two servers
Recommended article: Q3361888
Recommended article: Q2951204
Recommended article: OptORAMa: optimal oblivious RAM
Recommended article: Q6168428
description: scientific article; zbMATH DE number 7005637