Path ORAM: an extremely simple oblivious RAM protocol

E Stefanov, M Dijk, E Shi, THH Chan… - Journal of the ACM …, 2018 - dl.acm.org
We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of
client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme …

Oblivistore: High performance oblivious cloud storage

E Stefanov, E Shi - 2013 IEEE Symposium on Security and …, 2013 - ieeexplore.ieee.org
We design and build ObliviStore, a high performance, distributed ORAM-based cloud data
store secure in the malicious model. To the best of our knowledge, ObliviStore is the fastest …

Secure nearest neighbor revisited

B Yao, F Li, X Xiao - … IEEE 29th international conference on data …, 2013 - ieeexplore.ieee.org
In this paper, we investigate the secure nearest neighbor (SNN) problem, in which a client
issues an encrypted query point E (q) to a cloud service provider and asks for an encrypted …

[PDF][PDF] A survey on private information retrieval

W Gasarch - Bulletin of the EATCS, 2004 - cs.umd.edu
Alice wants to query a database but she does not want the database to learn what she is
querying. She can ask for the entire database. Can she get her query answered with less …

Multi-cloud oblivious storage

E Stefanov, E Shi - Proceedings of the 2013 ACM SIGSAC conference …, 2013 - dl.acm.org
We present a 2-cloud oblivious storage (ORAM) system that achieves 2.6 X bandwidth cost
between the client and the cloud. Splitting an ORAM across 2 or more non-colluding clouds …

Scalable and private media consumption with Popcorn

T Gupta, N Crooks, W Mulhern, S Setty, L Alvisi… - … USENIX symposium on …, 2016 - usenix.org
We describe the design, implementation, and evaluation of Popcorn, a media delivery
system that hides clients' consumption (even from the content distributor). Popcorn relies on …

Revisiting the computational practicality of private information retrieval

F Olumofin, I Goldberg - … Conference on Financial Cryptography and Data …, 2011 - Springer
Remote servers need search terms from the user to complete retrieval requests. However,
keeping the search terms private or confidential without undermining the server's ability to …

[PDF][PDF] A survey of anonymous communication channels

G Danezis, C Diaz - 2008 - Citeseer
We present an overview of the field of anonymous communications, from its establishment in
1981 from David Chaum to today. Key systems are presented categorized according to their …

Location privacy: going beyond K-anonymity, cloaking and anonymizers

A Khoshgozaran, C Shahabi… - Knowledge and Information …, 2011 - Springer
With many location-based services, it is implicitly assumed that the location server receives
actual users locations to respond to their spatial queries. Consequently, information …

Dummy traffic against long term intersection attacks

O Berthold, H Langos - … : Second International Workshop, PET 2002 San …, 2003 - Springer
In this paper we propose a method to prevent so called “intersection attacks” on anonymity
services. Intersection attacks are possible if not all users of such a service are active all the …