EDP Sciences logo
Web of Conferences logo
Search
Menu
All issues Volume 32 (2020) ITM Web Conf., 32 (2020) 03023 References
Open Access
Issue
ITM Web Conf.
Volume 32, 2020
International Conference on Automation, Computing and Communication 2020 (ICACC-2020)
Article Number 03023
Number of page(s) 5
Section Computing
DOI https://doi.org/10.1051/itmconf/20203203023
Published online 29 July 2020
  1. Salavi R.R., Math M.M., Kulkarni U.P. (2019) A Survey of Various Cryptographic Techniques: From Traditional Cryptography to Fully Homomorphic Encryption. In: Saini H., Sayal R., Govardhan A., Buyya R. (eds) Innovations in Computer Science and Engineering. Lecture Notes in Networks and Systems, vol 74. Springer, Singapore [Google Scholar]
  2. K.K. Chauhan, A.K.S. Sanger and** A. Verma, “Ho-momorphic Encryption for Data Security in Cloud Computing,” 2015 International Conference on Information Technology (ICIT), Bhubaneswar, 2015, pp. 206-209. [Google Scholar]
  3. M. Nassar, A. Erradi and** Q.M. Malluhi, “Paillier’s encryption: Implementation and cloud applications,” 2015 International Conference on Applied Research in Computer Science and Engineering (ICAR), Beirut, 2015, pp. 1-5. [Google Scholar]
  4. Shihab, T Liji, P. (2017). Simple and secure internet voting scheme using generalized paillier cryptosystem. 551-557. 10.1109/ICICICT1.2017.8342623. [Google Scholar]
  5. M. Togan and** C. Pleca, “Comparison-based computations over fully homomorphic encrypted data,”. in Proc. 10th International Conf. Communications, pp. 1-6, 2014 [Google Scholar]
  6. C. Gentry, “Fully homomorphic encryption using ideal lattices,”. in Proc. the 41st Annual ACM Symp. Theory of Computing, pp. 169-178, 2009. [Google Scholar]
  7. R.L. Rivest, L. Adleman, and** M.L. Dertouzos, nations where vote casting cooperation is low and it is too helpful for people living far o “On data banks and privacy. homomorphisms,” Foundations of secure computation, Vol. 4, no. 11, pp. 169-180, 1978. [Google Scholar]
  8. C. Gentry et al., “Fully homomorphic encryption using ideal lattices.”. in STOC, Vol. 9, 2009, pp. 169-178. [Google Scholar]
  9. Z. Brakerski, C. Gentry, and** V. Vaikuntanathan, “(leveled) fully homomorphic encryption without bootstrapping,”. in Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. ACM, 2012, pp. 309-325. [Google Scholar]
  10. A. Acar, H. Aksu, A.S. Uluagac, and** M. Conti, “A survey on homomorphic encryption schemes: Theory and implementation,”. ACM Comput. Surv., vol. 51, pp. 79:1-79:35, July 2018. [Google Scholar]
  11. P.Y. Ryan, S. Schneider, and** V. Teague, “End-to-end verifiability in voting systems, from theory to practice,” IEEE Security and Privacy, Vol. 13, no. 3, pp. 59-62, 2015. [Google Scholar]
  12. I. Damgard, M. Jurik, and** J.B. Nielsen, “A generalization of paillier’s public-key system with applications to electronic voting,” International Journal of Information Security, Vol. 9, no. 6, pp. 371-385, 2010. [Google Scholar]
  13. P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999, pp. 223-238. [Google Scholar]
  14. D. Hrestak and** S. Picek, “Homomorphic encryption in the cloud,” in Information and Communication Technology, Electronics and Microelectronics (MIPRO), 2014 37th International Convention on. IEEE, 2014, pp. 1400-1404. [Google Scholar]
  15. C. Ngo, “Secure voting system using paillier homo-morphic encryption,” Ph.D. dissertation, Texas AM University–Corpus Christi, 2014. [Google Scholar]
  16. Y. Yang, S. Zhang, J. Yang, J. Li, and** Z. Li, “Targeted fully homomorphic encryption based on a double decryption algorithm for polynomials,” Tsinghua science and technology, Vol. 19, no. 5, pp. 478-485, 2014. [Google Scholar]
  17. A. Snak, S. Ozkan, H. Yldrm, and** S. Kiraz, “End-2-end verifiable internet voting protocol based on homo-morphic encryption,” International Journel Of Information Security Science, Vol. 3, no. 2, pp. 165-181, 2014. [Google Scholar]
  18. A. Huszti, “A homomorphic encryption-based secure electronic voting scheme,” Faculty of Informatics. University of Debrecen. Hungary, 2011. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.