ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1007.1259
  4. Cited By
Privacy-Preserving Access of Outsourced Data via Oblivious RAM
  Simulation
v1v2 (latest)

Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation

7 July 2010
M. Goodrich
Michael Mitzenmacher
ArXiv (abs)PDFHTML

Papers citing "Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation"

29 / 29 papers shown
Over-Threshold Multiparty Private Set Intersection for Collaborative Network Intrusion Detection
Over-Threshold Multiparty Private Set Intersection for Collaborative Network Intrusion Detection
Onur Eren Arpaci
Raouf Boutaba
Florian Kerschbaum
65
0
0
14 Oct 2025
Bandwidth-Efficient Two-Server ORAMs with O(1) Client Storage
Bandwidth-Efficient Two-Server ORAMs with O(1) Client Storage
Wei Wang
Xianglong Zhang
Peng Xu
Rongmao Chen
Laurence T. Yang
262
0
0
27 Mar 2025
TimeClave: Oblivious In-enclave Time series Processing System
TimeClave: Oblivious In-enclave Time series Processing SystemInternational Conference on Information, Communications and Signal Processing (ICICS), 2023
K. Bagher
S. Cui
X. Yuan
Carsten Rudolph
X. Yi
AI4TS
175
0
0
29 Jun 2023
Cuckoo Hashing in Cryptography: Optimal Parameters, Robustness and
  Applications
Cuckoo Hashing in Cryptography: Optimal Parameters, Robustness and ApplicationsIACR Cryptology ePrint Archive (IACR ePrint), 2023
Kevin Yeo
217
24
0
20 Jun 2023
Single Round-trip Hierarchical ORAM via Succinct Indices
Single Round-trip Hierarchical ORAM via Succinct IndicesACM Asia Conference on Computer and Communications Security (AsiaCCS), 2022
William L. Holland
O. Ohrimenko
Anthony Wirth
239
1
0
16 Aug 2022
Dynamic Local Searchable Symmetric Encryption
Dynamic Local Searchable Symmetric EncryptionIACR Cryptology ePrint Archive (IACR ePrint), 2022
Brice Minaud
Michael Reichle
171
26
0
13 Jan 2022
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort
Gilad Asharov
T-H. Hubert Chan
Kartik Nayak
R. Pass
Ling Ren
E. Shi
362
42
0
04 Aug 2020
What Storage Access Privacy is Achievable with Small Overhead?
What Storage Access Privacy is Achievable with Small Overhead?
Sarvar Patel
G. Persiano
Kevin Yeo
161
16
0
10 Apr 2019
Lower Bounds for Oblivious Near-Neighbor Search
Lower Bounds for Oblivious Near-Neighbor Search
Kasper Green Larsen
T. Malkin
Omri Weinstein
Kevin Yeo
210
21
0
09 Apr 2019
A Double-Edged Sword: Security Threats and Opportunities in One-Sided
  Network Communication
A Double-Edged Sword: Security Threats and Opportunities in One-Sided Network CommunicationUSENIX Workshop on Hot Topics in Cloud Computing (HotCloud), 2019
Shin-Yeh Tsai
Yiying Zhang
203
9
0
22 Mar 2019
Stronger Lower Bounds for Online ORAM
Stronger Lower Bounds for Online ORAM
Pavel Hubácek
M. Koucký
Karel Král
Veronika Slívová
223
15
0
08 Mar 2019
Lower Bounds for Oblivious Data Structures
Lower Bounds for Oblivious Data Structures
R. Jacob
Kasper Green Larsen
J. Nielsen
213
38
0
24 Oct 2018
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server
  Setting
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting
T-H. Hubert Chan
Jonathan Katz
Kartik Nayak
Antigoni Polychroniadou
E. Shi
124
27
0
04 Sep 2018
Deterministic oblivious distribution (and tight compaction) in linear
  time
Deterministic oblivious distribution (and tight compaction) in linear time
E. Peserico
210
7
0
18 Jul 2018
An Algorithmic Framework For Differentially Private Data Analysis on
  Trusted Processors
An Algorithmic Framework For Differentially Private Data Analysis on Trusted ProcessorsNeural Information Processing Systems (NeurIPS), 2018
Joshua Allen
Bolin Ding
Janardhan Kulkarni
Harsha Nori
O. Ohrimenko
Sergey Yekhanin
SyDaFedML
364
34
0
02 Jul 2018
Sub-logarithmic Distributed Oblivious RAM with Small Block Size
Sub-logarithmic Distributed Oblivious RAM with Small Block Size
E. Kushilevitz
Tamer Mour
330
28
0
14 Feb 2018
The Pyramid Scheme: Oblivious RAM for Trusted Processors
The Pyramid Scheme: Oblivious RAM for Trusted Processors
Manuel Costa
Lawrence Esswood
O. Ohrimenko
Felix Schuster
Sameer Wagh
160
14
0
21 Dec 2017
Cloud Data Auditing Using Proofs of Retrievability
Cloud Data Auditing Using Proofs of Retrievability
Binanda Sengupta
Sushmita Ruj
91
1
0
16 Nov 2017
SOPE: A Spatial Order Preserving Encryption Model for Multi-dimensional
  Data
SOPE: A Spatial Order Preserving Encryption Model for Multi-dimensional Data
Eirini Molla
T. Tzouramanis
S. Gritzalis
130
3
0
09 Oct 2017
Efficient Dynamic Searchable Encryption with Forward Privacy
Efficient Dynamic Searchable Encryption with Forward Privacy
Mohammad Etemad
Alptekin Küpçü
Charalampos Papamanthou
David Evans
FedML
226
133
0
30 Sep 2017
Forward Private Searchable Symmetric Encryption with Optimized I/O
  Efficiency
Forward Private Searchable Symmetric Encryption with Optimized I/O Efficiency
Xiangfu Song
Changyu Dong
Dandan Yuan
Qiuliang Xu
M. Zhao
204
147
0
30 Sep 2017
BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized
  Outsourced Storage
BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage
M. Goodrich
174
5
0
19 Sep 2017
Optimizing Path ORAM for Cloud Storage Applications
Optimizing Path ORAM for Cloud Storage Applications
Nathan Wolfe
E. Zou
Ling Ren
Xiangyao Yu
135
2
0
08 Jan 2015
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud
The Melbourne Shuffle: Improving Oblivious Storage in the CloudInternational Colloquium on Automata, Languages and Programming (ICALP), 2014
O. Ohrimenko
M. Goodrich
R. Tamassia
E. Upfal
344
75
0
22 Feb 2014
Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
Statistically-secure ORAM with O~(log⁡2n)\tilde{O}(\log^2 n)O~(log2n) OverheadInternational Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), 2013
Kai-Min Chung
Zhenming Liu
R. Pass
140
87
0
14 Jul 2013
Oblivious Storage with Low I/O Overhead
Oblivious Storage with Low I/O Overhead
M. Goodrich
Michael Mitzenmacher
O. Ohrimenko
R. Tamassia
308
6
0
09 Oct 2011
Oblivious RAM Simulation with Efficient Worst-Case Access Overhead
Oblivious RAM Simulation with Efficient Worst-Case Access OverheadCloud Computing Security Workshop (CCS), 2011
M. Goodrich
Michael Mitzenmacher
O. Ohrimenko
R. Tamassia
345
159
0
25 Jul 2011
Towards Practical Oblivious RAM
Towards Practical Oblivious RAMNetwork and Distributed System Security Symposium (NDSS), 2011
Emil Stefanov
E. Shi
Basel Alomair
532
368
0
18 Jun 2011
Privacy-Preserving Group Data Access via Stateless Oblivious RAM
  Simulation
Privacy-Preserving Group Data Access via Stateless Oblivious RAM SimulationACM-SIAM Symposium on Discrete Algorithms (SODA), 2011
M. Goodrich
Michael Mitzenmacher
O. Ohrimenko
R. Tamassia
FedML
343
250
0
20 May 2011
1
Page 1 of 1