D. Boneh, G. Di-crescenzo, R. Ostrovsky, and G. Persiano, Public Key Encryption with Keyword Search, EUROCRYPT, pp.506-522, 2004.
DOI : 10.1007/978-3-540-24676-3_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.1462

B. Chor, N. Gilboa, and M. Naor, Private information retrieval by keywords, IACR Cryptology ePrint Archive, 1998.

B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, Private information retrieval, Journal of the ACM, vol.45, issue.6, pp.965-981, 1998.
DOI : 10.1145/293347.293350

G. Di-crescenzo, J. Feigenbaum, D. Gupta, E. Panagos, J. Perry et al., Practical and Privacy-Preserving Policy Compliance for Outsourced Data, WAHC, 2014.
DOI : 10.1007/978-3-662-44774-1_15

G. , D. Crescenzo, Y. Ishai, and R. Ostrovsky, Universal service-providers for private information retrieval, J. Cryptology, vol.14, issue.1, pp.37-74, 2001.

G. , D. Crescenzo, and D. Shallcross, On minimizing the size of encrypted databases, DBSec, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01284872

M. J. Freedman, Y. Ishai, B. Pinkas, and O. Reingold, Keyword Search and Oblivious Pseudorandom Functions, TCC, pp.303-324, 2005.
DOI : 10.1007/978-3-540-30576-7_17

O. Goldreich, S. Goldwasser, and S. Micali, How to construct random functions, Journal of the ACM, vol.33, issue.4, pp.792-807, 1986.
DOI : 10.1145/6490.6503

O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, STOC, pp.218-229, 1987.

O. Goldreich and R. Ostrovsky, Software protection and simulation on oblivious RAMs, Journal of the ACM, vol.43, issue.3, pp.431-473, 1996.
DOI : 10.1145/233551.233553

H. Hacigümüs, B. R. Iyer, C. Li, and S. Mehrotra, Executing SQL over encrypted data in the database-service-provider model, SIGMOD Conference, pp.216-227, 2002.

M. S. Islam, M. Kuzu, and M. Kantarcioglu, Access pattern disclosure on searchable encryption: Ramification, attack and mitigation, NDSS, 2012.

S. Jarecki, C. S. Jutla, H. Krawczyk, M. Rosu, and M. Steiner, Outsourced symmetric private information retrieval, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.875-888, 2013.
DOI : 10.1145/2508859.2516730

S. Jarecki and X. Liu, Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection, TCC, pp.577-594, 2009.
DOI : 10.1007/978-3-642-00457-5_34

E. Kushilevitz and R. Ostrovsky, Replication is not needed: single database, computationally-private information retrieval, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.364-373, 1997.
DOI : 10.1109/SFCS.1997.646125

R. Ostrovsky and W. Skeith, A Survey of Single-Database Private Information Retrieval: Techniques and Applications, Public Key Cryptography, pp.393-411, 2007.
DOI : 10.1007/978-3-540-71677-8_26

D. X. Song, D. Wagner, and A. Perrig, Practical techniques for searches on encrypted data, IEEE Symposium on Security and Privacy, pp.44-55, 2000.

S. Wang, X. Ding, R. H. Deng, and F. Bao, Private Information Retrieval Using Trusted Hardware, ESORICS, pp.49-64, 2006.
DOI : 10.1007/11863908_4