R. Cramer, R. Gennaro, and B. Schoenmakers, “A secure and optimally efficient multi-authority election scheme”, in Advances in Cryptology (EUROCRYPT ’97), vol. 1233 of Lecture Notes in Computer Science, pp. 103–118, Springer, New York, NY, USA, 1997.CramerR.GennaroR.SchoenmakersB.“A secure and optimally efficient multi-authority election scheme”vol. 1233 of Lecture Notes in Computer Science103118SpringerNew York, NY, USA199710.1007/3-540-69053-0_9Search in Google Scholar
Y. Gahi, M. Guennoun, and K. El-Khatib. “A secure database system using homomorphic encryption schemes”. CoRR, abs/1512.03498, 2015.GahiY.GuennounM.El-KhatibK.CoRR, abs/1512.034982015Search in Google Scholar
Maya Mohan, M K Kavitha, Jeevan Prakash, “Homomorphic Encryption-State of the Art”, International Conference on Intelligent Computing and Control (I2C2), 2017MohanMayaKavithaM KPrakashJeevanInternational Conference on Intelligent Computing and Control (I2C2)201710.1109/I2C2.2017.8321774Search in Google Scholar
Keke Gai, Meikang Qiu “An Optimal Fully Homomorphic Encryption Scheme”, IEEE 3rd International Conference on Big Data Security on Cloud.GaiKekeQiuMeikangIEEE 3rd International Conference on Big Data Security on CloudSearch in Google Scholar
Craig Gentry, “a fully homomorphic encryption scheme”, STANFORD UNIVERSITY, 2009.CraigGentrySTANFORD UNIVERSITY2009Search in Google Scholar
Jing Yang, Mingyu Fan, Guangwei Wang, Zhiyin Kong “Simulation Study Based on Somewhat Homomorphic Encryption”, China, 2014.JingYangFanMingyuWangGuangweiKongZhiyinChina201410.4236/jcc.2014.22019Search in Google Scholar