1. Chai, Q., and Gong, G. (2012, January 10–15). Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. Proceedings of the 2012 IEEE International Conference on Communications (ICC), Ottawa, ON, Canada.
2. Paverd, A., Martin, A., and Brown, I. (2014). Modelling and automatically analysing privacy properties for honest-but-curious adversaries. Tech. Rep., 1–14.
3. Song, D.X., Wagner, D., and Perrig, A. (2000, January 14–17). Practical techniques for searches on encrypted data. Proceedings of the Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000, Berkeley, CA, USA.
4. Curtmola, R., Garay, J., Kamara, S., and Ostrovsky, R. (2006, January 3). Searchable symmetric encryption: Improved definitions and efficient constructions. Proceedings of the 13th ACM Conference on Computer and Communications Security, Alexandria, VA, USA.
5. Chase, M., and Kamara, S. (2010). Advances in Cryptology-ASIACRYPT 2010: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, 5–9 December 2010, Springer. Proceedings 16.