Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation

20 May 2011

Papers citing "Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation"

10 / 10 papers shown

Title
Lower Bounds for Oblivious Near-Neighbor Search Kasper Green Larsen T. Malkin Omri Weinstein Kevin Yeo 27 20 0 09 Apr 2019
Lower Bounds for Oblivious Data Structures R. Jacob Kasper Green Larsen J. Nielsen 34 37 0 24 Oct 2018
An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors Joshua Allen Bolin Ding Janardhan Kulkarni Harsha Nori O. Ohrimenko Sergey Yekhanin SyDa FedML 27 32 0 02 Jul 2018
DR.SGX: Hardening SGX Enclaves against Cache Attacks with Data Location Randomization Ferdinand Brasser Srdjan Capkun Alexandra Dmitrienko Tommaso Frassetto Kari Kostiainen A. Sadeghi AAML 19 102 0 28 Sep 2017
Revisiting Definitional Foundations of Oblivious RAM for Secure Processor Implementations Syed Kamran Haider Omer Khan Marten van Dijk 15 9 0 12 Jun 2017
CacheShuffle: An Oblivious Shuffle Algorithm Using Caches Sarvar Patel G. Persiano Kevin Yeo 31 9 0 19 May 2017
A Practical Oblivious Map Data Structure with Secure Deletion and History Independence Daniel S. Roche Adam J. Aviv Seung Geol Choi 18 4 0 27 May 2015
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud O. Ohrimenko M. Goodrich R. Tamassia E. Upfal 76 72 0 22 Feb 2014
Oblivious RAM Simulation with Efficient Worst-Case Access Overhead M. Goodrich Michael Mitzenmacher O. Ohrimenko R. Tamassia 95 159 0 25 Jul 2011
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation M. Goodrich Michael Mitzenmacher 71 269 0 07 Jul 2010