1. 1. P. Mell and T. Grance, “The nist definition of cloud computing (draft),” NIST special publication, vol. 800, p. 145, 2011
   2. S. De Capitani di Vimercati, S. Foresti, and P. Samarati, “Managing and accessing data in the cloud: Privacy risks and approaches,” in CRiSIS, pp. 1 –9, 2012.
   3. P. Williams, R. Sion, and B. Carbunar, “Building castles out of mud: practical access pattern privacy and correctness on untrusted storage,” in ACM CCS, pp. 139–148, 2008.
   4. P. Paillier, “Public key cryptosystems based on compositedegree residuosity classes,” in Eurocrypt, pp. 223–238, 1999.
   5. B. K. Samanthula, Y. Elmehdwi, and W. Jiang, “k-nearest neighbor classification over semantically secure encrypted relational data.” eprint arXiv:1403.5001, 2014.
   6. C. Gentry, “Fully homomorphic encryption using ideal lattices,” in ACM STOC, pp. 169–178, 2009
   7. C. Gentry and S. Halevi, “Implementing gentry’s fullyhomomorphic encryption scheme,” in EUROCRYPT, pp. 129– 148, Springer, 2011.
   8. A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, pp. 612–613, Nov. 1979
   9. D. Bogdanov, S. Laur, and J. Willemson, “Sharemind: A framework for fast privacypreserving computations,” in ESORICS, pp. 192– 206, Springer, 2008.
   10. R. Agrawal and R. Srikant, “Privacypreserving data mining,” in ACM Sigmod Record, vol. 29, pp. 439–450, ACM, 2000
   11. Y. Lindell and B. Pinkas, “Privacy preserving data mining,” in Advances in Cryptology (CRYPTO), pp. 36–54, Springer, 2000.
   12. P. Zhang, Y. Tong, S. Tang, and D. Yang, “Privacy preserving naive bayes classification,” ADMA, pp. 744–752, 2005.
   13. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke, “Privacy preserving mining of association rules,” Information Systems, vol. 29, no. 4, pp. 343–364, 2004
   14. R. J. Bayardo and R. Agrawal, “Data privacy through optimal k-anonymization,” in IEEE ICDE, pp. 217–228, 2005.