Derandomization Security of Homomorphic Encryption
https://doi.org/10.15514/ISPRAS-2015-27(6)-24
Abstract
The paper considers the problems of developing and analysis of cloud database systems. We determine the requrments for encryption to be usable in practical applications. A new notion - a non-derandomizable encryption - allows to do this and we explain the practical value of this notion as well as links between it and classical notions of cryptosystem’s security, practical security of whole cloud computing system. We show the examples of simple algebraically homomorphic cryptosystems - both derandomizable and not non-derandomizable. The paper finally concludes about usability of considered cryptosystems for practical cloud systems.
References
1. Popa, R. A., Redfield, C., Zeldovich, N., & Balakrishnan, H. CryptDB: protecting confi-dentiality with encrypted query processing //Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles. – ACM, 2011. – С. 85-100.
2. A. Arasu, S. Blanas, K. Eguro, R. Kaushik, D. Kossmann, R. Ramamurthy, and R. Ven-katesan. Orthogonal security with cipherbase. In CIDR, 2013.
3. Google Encrytped Big Query. https://github.com/google/encrypted-bigquery-client.
4. Always Encrypted. https://msdn.microsoft.com/en-us/library/mt163865(v=sql.130).aspx.
5. Shatilov, K., Boiko, V., Krendelev, S., Anisutina, D., & Sumaneev, A. Solution for se-cure private data storage in a cloud //Computer Science and Information Systems (FedCSIS), 2014 Federated Conference on. – IEEE, 2014. – С. 885-889.
6. Agrawal, R., Kiernan, J., Srikant, R., & Xu, Y. Order preserving encryption for numeric data //Proceedings of the 2004 ACM SIGMOD international conference on Management of data. – ACM, 2004. – С. 563-574.
7. N. P. Varnovskij, A. V. Shokurov. Gomomorfnoe shifrovanie [Homomorphic Encryp-tion]. Trudy ISP RАN [The Proceedings of ISP RAS], 2007, vol. 12, pp. 27-36 (in Russian).
8. Barak B., Ong S. J., Vadhan S. Derandomization in cryptography //SIAM Journal on Computing. – 2007. – Т. 37. – №. 2. – С. 380-400.
9. Kipnis A., Hibshoosh E. Efficient Methods for Practical Fully Homomorphic Symmet-ric-key Encrypton, Randomization and Verification //IACR Cryptology ePrint Archive. – 2012. – №. 637.
10. Kipnis A., Hibshoosh E. Method and system for homomorphicly randomizing an input : заяв. пат. 14/417,184 США. – 2013. ().
11. Zjirov A.O., Zjirova O.V., Krendelev S.Ph. Bezopasnye oblachnye vychislenija s pomoshh'ju gomomorfnoj kriptografii [Secure cloud computing with homomorphic en-cryption]. Bezopasnost' informacionnyh tehnologij [Security of Information Technologies], 2013, v. 1, pp. 6–12 (in Russian).
12. R. L. Rivest, L. Adleman, M. L. Dertouzos. On data banks and privacy homomorphisms. Foundations of secure computation, 1978, vol. 4, no. 11. pp. 169-180.
13. C. Gentry. Fully homomorphic encryption using ideal lattices. Proceedings of the 41st annual ACM symposium on Symposium on theory of computing-STOC'09. – ACM Press, 2009, pp. 169-169.
14. Hemenway B., Ostrovsky R. Building lossy trapdoor functions from lossy encryption //Advances in Cryptology-ASIACRYPT 2013. – Springer Berlin Heidelberg, 2013. – С. 241-260.
15. Goldreich O. Foundations of cryptography: volume 2, basic applications. – Cambridge university press, 2004.
Review
For citations:
Trepacheva A. Derandomization Security of Homomorphic Encryption. Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS). 2015;27(6):381-394. (In Russ.) https://doi.org/10.15514/ISPRAS-2015-27(6)-24
Email this article 