Abstract
We study certain simple models of confidential databases in cloud computing systems. In the framework of these models we introduce a concept of deductive security for queries to such databases, find necessary and sufficient conditions of deductive security, and describe some classes of queries which satisfy these requirements.
References
C. Gentry, “Fully homomorphic encryption using ideal lattices”, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (ACM, New York, 2009), P. 169–178.
M. Van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, “Fully homomorphic encryption over the integers”, in Proceedings of the 29th International Conference “Advances in Cryptology—EUROCRYPT 2010” (Springer, Berlin, 2010), pp. 24–43.
Z. Brakerski and V. Vaikuntanathan, “Efficient fully homomorphic encryption from (standard) LWE”, in Proceedings of the 52nd Symposium on Foundations of Computer Science (IEEE Computing Society, Washington, 2011), pp. 97–106.
C. Gentry, A. Sahai, and B. Waters, “Homomorphic encryption from learning with errors: conceptuallysimpler, asymptotically-faster, attribute-based”, in Proceedings of the 32nd International Conference “Advances in Cryptology—EUROCRYPT 2013” (Springer, Berlin, 2013), pp. 75–92.
C. Gentry and S. Halevi, “Implementing Gentry’s fully-homomorphic encryption scheme”, in Proceedings of the 30th International Conference “Advances in Cryptology—EUROCRYPT 2011” (Springer, Berlin, 2011), pp. 129–148.
C. Gentry, S. Halevi, and N. Smart, “Fully homomorphic encryption with polylog overhead”, in Proceedings of the 31st International Conference “Advances in Cryptology—EUROCRYPT 2012” (Springer, Berlin, 2012), pp. 465–482.
A. Lopez-Alt, E. Tromer, and V. Vaikuntanathan, “On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption”, in Proceedings of the 44th Annual ACM Symposium on Theory of Computing (ACM, New York, 2012), pp. 1219–1234.
Y. Gahi, M. Guennoun, and K. El-Khatib, “A secure database system using homomorphic encryption schemes”, in Proceedings of the 3rd International Conference on Advances in Databases, Knowledge, and Data Applications (IARIA, Red Hook, 2011), pp. 54–58.
D. Boneh, C. Gentry, S. Halevi, F. Wang, and D. J. Wu, “Private database queries using somewhat homomorphic encryption”, in Proceedings of ACNS (Springer, Berlin, 2013), pp. 129–148.
M. Van Dijk and A. Juels, “On the impossibility of cryptography alone for privacy-preserving cloud computing”, in Proceedings of the 5th USENIX Conference on Hot Topics in Security (USENIX Association, Berkeley, 2010), pp. 1–8.
N. P. Varnovskiy, S. A. Martishin, M. V. Khrapchenko, and A.V. Shokurov, “Secure cloud computing based threshold homomorphic encryption,” Programming and Computer Software 41 (4), 215–218 (2015).
N. P. Varnovskiy, V. A. Zakharov, and A.V. Shokurov, “On the existence of provably secure cloud computing systems,” Moscow Univ. Comput. Math. and Cybern. 36 (2), 83–88 (2016).
S. Barker, “Deductive database security”, Research Directions in Data and Applications Security. IFIP (Springer, New York, 2003), pp. 103–114.
R. Sandhu, E. J. Coyne, H. L. Feinstein, and C. E. Youman, “Role-based access control models,” IEEE Computer 29 (2), 38–47 (1996).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © N.P. Varnovsky, V.A. Zakharov, A.V. Shokurov, 2017, published in Vestnik Moskovskogo Universiteta, Seriya 15: Vychislitel’naya Matematika i Kibernetika, 2017, No. 1, pp. 38–43.
About this article
Cite this article
Varnovsky, N.P., Zakharov, V.A. & Shokurov, A.V. On the deductive security of queries to confidential databases in cloud computing systems. MoscowUniv.Comput.Math.Cybern. 41, 38–43 (2017). https://doi.org/10.3103/S0278641917010095
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0278641917010095