, The clusion library

I. Abraham, C. W. Fletcher, K. Nayak, B. Pinkas, and L. Ren, Asymptotically tight bounds for composing oram with pir, IACR Public Key Cryptography, pp.91-120, 2017.
DOI : 10.1007/978-3-662-54365-8_5

E. Blass, T. Mayberry, G. Noubir, and K. Onarlioglu, Toward robust hidden volumes using write-only oblivious ram, Proceedings of the 2014 ACM CCS, pp.203-214, 2014.
DOI : 10.1145/2660267.2660313

URL : https://eprint.iacr.org/2014/344.pdf

C. Bösch, P. Hartel, W. Jonker, and A. Peter, A survey of provably secure searchable encryption, ACM Computing Surveys (CSUR), vol.47, issue.2, p.18, 2015.

C. Bosch, A. Peter, B. Leenders, H. W. Lim, Q. Tang et al., Distributed searchable symmetric encryption, Privacy, Security and Trust (PST), 12th International Conference on, pp.330-337, 2014.
DOI : 10.1109/pst.2014.6890956

URL : http://orbilu.uni.lu/bitstream/10993/18832/1/Distributed%20Searchable%20Symmetric%20Encryption.pdf

R. Bost, B. Minaud, and O. Ohrimenko, Forward and backward private searchable encryption from constrained cryptographic primitives, IACR Cryptology ePrint Archive, 2017.
DOI : 10.1145/3133956.3133980

N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, Privacy-preserving multi-keyword ranked search over encrypted cloud data, IEEE Transactions on parallel and distributed systems, vol.25, pp.222-233, 2014.
DOI : 10.1109/infcom.2011.5935306

D. Cash, P. Grubbs, J. Perry, and T. Ristenpart, Leakage-abuse attacks against searchable encryption, Proceedings of the 22nd ACM CCS, pp.668-679, 2015.
DOI : 10.1145/2810103.2813700

D. Cash, J. Jaeger, S. Jarecki, C. S. Jutla, H. Krawczyk et al., Dynamic searchable encryption in very-large databases: Data structures and implementation, IACR Cryptology ePrint Archive, p.853, 2014.

B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, Private information retrieval, Journal of the ACM (JACM), 1998.

R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, Searchable symmetric encryption: improved definitions and efficient constructions, Proceedings of the 13th ACM CCS, pp.79-88, 2006.
DOI : 10.3233/jcs-2011-0426

URL : http://web.njit.edu/~crix/publications/jcs11.pdf

S. Garg, P. Mohassel, and C. Papamanthou, Tworam: Round-optimal oblivious ram with applications to searchable encryption, IACR Cryptology ePrint Archive, p.1010, 2015.
DOI : 10.1007/978-3-662-53015-3_20

I. Goldberg, Improving the robustness of private information retrieval, IEEE Symposium on Security and Privacy, pp.131-148, 2007.

F. Hahn and F. Kerschbaum, Searchable encryption with secure and efficient updates, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp.310-320, 2014.
DOI : 10.1145/2660267.2660297

T. Hoang, A. Yavuz, and J. Guajardo, Practical and secure dynamic searchable encryption via oblivious access on distributed data structure, Proceedings of the 32nd Annual Computer Security Applications Conference (ACSAC), 2016.
DOI : 10.1145/2991079.2991088

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

S. Kamara, C. Papamanthou, and T. Roeder, Dynamic searchable symmetric encryption, Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp.965-976, 2012.
DOI : 10.1145/2382196.2382298

C. Liu, L. Zhu, M. Wang, and Y. Tan, Search pattern leakage in searchable encryption: Attacks and new construction, Information Sciences, 2014.
DOI : 10.1016/j.ins.2013.11.021

URL : http://eprint.iacr.org/2013/163.pdf

T. Moataz, E. Blass, and T. Mayberry, Chf-oram: a constant communication oram without homomorphic encryption, Cryptology ePrint Archive, 1116.

T. Moataz, I. Ray, I. Ray, A. Shikfa, F. Cuppens et al., Substring search over encrypted data, Journal of Computer Security, pp.1-30, 2018.
DOI : 10.3233/jcs-14652

M. Naveed, The fallacy of composition of oblivious ram and searchable encryption, Cryptology ePrint Archive, 2015.

L. Ren, C. W. Fletcher, A. Kwon, E. Stefanov, E. Shi et al., Ring oram: Closing the gap between small and large client storage oblivious ram, 2014.

A. Shamir, How to share a secret, Communications of the ACM, 1979.

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

E. Stefanov, M. Van-dijk, E. Shi, C. Fletcher, L. Ren et al., Path oram: an extremely simple oblivious ram protocol, Proceedings of the 2013 ACM CCS, pp.299-310, 2013.

W. Sun, B. Wang, N. Cao, M. Li, W. Lou et al., Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking, ACM SIGSAC AsiaCCS, pp.71-82, 2013.
DOI : 10.1145/2484313.2484322

C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, Secure ranked keyword search over encrypted cloud data, IEEE 30th International Conference on Distributed Computing Systems, pp.253-262, 2010.
DOI : 10.1109/icdcs.2010.34

A. A. Yavuz and J. Guajardo, Dynamic searchable symmetric encryption with minimal leakage and efficient updates on commodity hardware, Selected Areas in Cryptography-SAC 2015, 2015.
DOI : 10.1007/978-3-319-31301-6_15

R. Zhang, R. Xue, T. Yu, and L. Liu, Dynamic and efficient private keyword search over inverted index-based encrypted data, ACM Transactions on Internet Technology (TOIT), vol.16, issue.3, p.21, 2016.

Y. Zhang, J. Katz, and C. Papamanthou, All your queries are belong to us: The power of file-injection attacks on searchable encryption, 25th USENIX Security Symposium (USENIX Security 16), pp.707-720, 2016.

F. Zhou, Y. Li, A. X. Liu, M. Lin, and Z. Xu, Integrity preserving multi-keyword searchable encryption for cloud computing, International Conference on Provable Security, pp.153-172, 2016.