System for Secure Computing Based on Homomorphism with Reduced Polynomial Power

  • Viacheslav DavydovEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11118)


A significant interest recently emerged in the field of secure computations. Many systems were developed aiming at executing the summation and multiplication operation in a hidden way. Importantly, the cryptosystems enabling the execution of all four arithmetic operations are not yet present. This paper proposes a system for achieving this goal. The main benefit of its utilization is the possibility to continuous computation with no need for repetitive encryption of data.


  1. 1.
    Bilakanti, A., et al.: Secure computation over cloud using fully homomorphic encryption. In: Proceedings of 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT), pp. 633–636. IEEE (2016)Google Scholar
  2. 2.
    Zhao, F., Li, C., Liu, C.F.: A cloud computing security solution based on fully homomorphic encryption. In: Proceedings of 16th International Conference on Advanced Communication Technology (ICACT), pp. 485–488. IEEE (2014)Google Scholar
  3. 3.
    Mäkitalo, N.: Safe, secure executions at the network edge. IEEE Softw. 35, 30–37 (2018)CrossRefGoogle Scholar
  4. 4.
    López-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 1219–1234. ACM (2012)Google Scholar
  5. 5.
    Olshannikova, E., et al.: Conceptualizing big social data. J. Big Data 4(1), 3 (2017)CrossRefGoogle Scholar
  6. 6.
    Ometov, A., et al.: Feasibility characterization of cryptographic primitives for constrained (wearable) IoT devices. In: Proceedings of International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops), pp. 1–6. IEEE (2016)Google Scholar
  7. 7.
    Florea, R., et al.: Networking solutions for integrated heterogeneous wireless ecosystem. In: CLOUD COMPUTING, p. 103 (2017)Google Scholar
  8. 8.
    Armbrust, M., et al.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)CrossRefGoogle Scholar
  9. 9.
    Hashem, I.A.T., Yaqoob, I., Anuar, N.B., Mokhtar, S., Gani, A., Khan, S.U.: The rise of “Big Data” on cloud computing: review and open research issues. Inf. Syst. 47, 98–115 (2015)CrossRefGoogle Scholar
  10. 10.
    Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169–180 (1978)MathSciNetGoogle Scholar
  11. 11.
    Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005). Scholar
  12. 12.
    Gentry, C., Halevi, S.: Implementing gentry’s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129–148. Springer, Heidelberg (2011). Scholar
  13. 13.
    Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505–524. Springer, Heidelberg (2011). Scholar
  14. 14.
    Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 13 (2014)MathSciNetzbMATHGoogle Scholar
  15. 15.
    Krendelev, S.: Homomorphic encryption (secure cloud computation). In: Proceedings of RusCrypto (2011)Google Scholar
  16. 16.
    Rosser, J.B., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Ill. J. Math. 6(1), 64–94 (1962)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.National Research University Higher School of EconomicsMoscowRussia

Personalised recommendations