Private Database Access With HE-over-ORAM Architecture

  title={Private Database Access With HE-over-ORAM Architecture},
  author={Craig Gentry and Shai Halevi and Charanjit S. Jutla and Mariana Raykova},
  booktitle={IACR Cryptology ePrint Archive},
Enabling private database queries is an important and challenging research problem with many real-world applications. The goal is for the client to obtain the results of its queries without learning anything else about the database, while the outsourced server learns nothing about the queries or data, including access patterns. The secure-computation-over-ORAM architecture offers a promising approach to this problem, permitting sub-linear time processing of the queries (after pre-processing… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 29 extracted citations

A Taxonomy of Secure Two-Party Comparison Protocols and Efficient Constructions

2017 15th Annual Conference on Privacy, Security and Trust (PST) • 2017
View 5 Excerpts
Highly Influenced

Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound

ACM Conference on Computer and Communications Security • 2014
View 6 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 25 references

Efficient, Oblivious Data Structures for MPC

View 8 Excerpts
Highly Influenced

Algorithms in HElib

CRYPTO • 2014
View 2 Excerpts

Automating Efficient RAM-Model Secure Computation

2014 IEEE Symposium on Security and Privacy • 2014
View 1 Excerpt

HElib - An Implementation of homomorphic encryption

Shai Halevi, Victor Shoup
https: //, • 2014
View 4 Excerpts

Optimizing ORAM and Using it Efficiently for Secure Computation

IACR Cryptology ePrint Archive • 2013
View 6 Excerpts

Similar Papers

Loading similar papers…