[1]

Huang R.W., Gui X.L., Yu S., et al., Privacy-preserving computable encryption scheme of cloud computing, CJC., 2011, 34, 2391-2402. Google Scholar

[2]

Gao W., Zali M.R., Degree-based indices computation for special chemical molecular structures using edge dividing method, AMNS., 2016, 1, 94-117. Google Scholar

[3]

Rivest R.L., Adleman L., Dertouzos M.L., On data banks and privacy homomorphisms, J. FDN SECURE COMPUTATI., 1978, 169-179. Google Scholar

[4]

Rivest R., Shamir A., Adleman L., A method for obtaining digital signatures and public-key cryptosystems, COMMUM ACM., 1978, 21, 120-126. CrossrefGoogle Scholar

[5]

Elgamal T., A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inf. Theory., 1985, 31, 469-472. CrossrefGoogle Scholar

[6]

Paillier P., Public-key cryptosystems based on composite degree residuosity classes, EUROCRYPT'99 (2-6 May 1999,Prague, Czech republic), Springer, Berlin, Heidelberg, 1999, 223-238. Google Scholar

[7]

Boneh D., Goh E.J., Nissim K., Evaluating 2-DNF formulas on ciphertexts, Second Theory of Cryptography Conference (10-12, February 2005, Cambridge, MA, United states), Springer, Berlin, Heidelberg, 2005, 325-341. Google Scholar

[8]

Gentry C., Fully homomorphic encryption using ideal lattices, ACM symposium on Theory of Computing (May 31-June 2, 2009, Bethesda, MD, United states), Association for Computing Machinery, New York, 2009, 169-178. Google Scholar

[9]

Dijk M., Gentry C., Halevi S., et al., Full homomorphic encryption over the integers, Advances in Cryptology EUROCRYPT 2010, Springer, Berlin Heidelberg, 2009, 24-43. Google Scholar

[10]

Brakerski Z., Gentry C., Vaikuntanathan V., (Leveled) Full homomorphic encryption without bootstrapping, the 3th Innovations in Theoretical Computer Science Conference (8-10, January, 2012, Cambridge, Massachusetts, UK), ACM, New York, 2012, 309-325. Google Scholar

[11]

Gentry C., Sahai A., Waters B., Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based, 33rd Annual International Cryptology Conference (18-22, August, 2013, Santa Barbara, CA, United states), Springer, Heidelberg, 2013, 75-92. Google Scholar

[12]

López-Alt A., Tromer E., On-the-fly multiparty computation on the cloud via multikey full homomorphic encryption, 44rd annual ACM symposium on Theory of computing (19-22, May, 2012, New York, NY, United states), ACM, New York, 2012, 1219-1234. Google Scholar

[13]

Tembhurne J.V., Sathe S.R., RSA Public Key Acceleration on CUDA GPU, Proceedings of ICAIECES 2015 (22-23, April, 2015, Chennai, India), Springer Verlag, 2016, 365-375. Google Scholar

[14]

Victor M., Pérez G., Susan F., et al., Applied mathematics and nonlinear sciences in the war on cancer, AMNS., 2016, 1, 423-436.CrossrefGoogle Scholar

[15]

Lin C.H., Liu J.C.,Li C.C., Parallel modulus operations in RSA encryption by CPU/GPU hybrid computation, 9th Asia Joint Conference on Information Security (January 26, 2014, Wuchang, Wuhan, China), Institute of Electrical and Electronics Engineers Inc, 2014, 71-75.Google Scholar

[16]

Ithnin M.D.N., Parallel RSA encryption based on tree architecture, J. CHIN INST ENG., 2013, 36, 658-666. CrossrefGoogle Scholar

[17]

Wang X.Y., Min Z., Parallel algorithm for Hill Cipher on MapReduce, 2nd IEEE International Conference on Progress in Informatics and Computing (16-18, May, 2014, Shanghai, China), Institute of Electrical and Electronics Engineers Inc, 2014, 493-497. Google Scholar

[18]

Gu C.S., Fully homomorphic encryption from approximate ideal lattices, JSW, 2015, 26, 2696-2719. Google Scholar

[19]

Cheon J.H., Coron J.S., Kim J., et al., Batch full homomorphic encryption over the integer, INFORM SCIENCES, 2015, 310, 315-335. Google Scholar

[20]

Hiromasa R., Abe M., Okamoto T., Packing messages and optimizing bootstrapping in GSW-FHE, IEICE Trans Fund Electron Commun Comput Sci, 2016, E99A, 73-82. Google Scholar

## Comments (0)

General note:By using the comment function on degruyter.com you agree to our Privacy Statement. A respectful treatment of one another is important to us. Therefore we would like to draw your attention to our House Rules.