1. 1. R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky. Searchable symmetric encryption: improved definiti- ons and efficient constructions. In Proceedings of the 13th ACM conference on Computer and Communications Security,pages 7988. ACM, 2006.
   2. A. Popa and N. Zeldovich. Multi-key encryption. http://eprint.iacr.org/2013/508,2013.
   3. C. Bsch, Q. Tang, P. Hartel, and W. Jonker, Selective document retrieval from encrypted database, in Proc. 15th Inf. Security Conf. (ISC), vol. 7483. 2012, pp. 224241.
   4. M. Kuzu, M. S. Islam, and M. Kantarcioglu, Efficient similarity search over en-crypted data, in Proc. IEEE 28th Int. Conf. Data Eng. ,Apr. 2012, pp. 11561167.
   5. C. Dong, G. Russello, and N. Dulay. Shared and searchable encrypted data for untrusted servers. In V. Atluri, editor, Data and Applications Security XXII, 22nd Annual IFIP WG 11.3 Working Conference on Data and Applications Security, volume 5094 of LNCS, pages 127– 143. Springer, 2008.
   6. D. X. Song, D. Wagner, and A. Perrig. Practical Techniques for Searches on Encrypted Data. In IEEE Symposium on Security and Privacy, pages 44–55. IEEE Computer Society, 2000.
   7. Q. Tang. Privacy preserving mapping schemes supporting comparison. In Proceedings of the 2010 ACM 2010.
   8. Q. Tang. Theory and Practice of Cryptography Solutions for Secure Information Systems, chapter Search in Encrypted Data: Theoretical Models and Practical Applications, pages 84–108. IGI, 2013.