A Homomorphic Crypto System for Electronic Election Schemes
- 1 Computer Science and Engineering, Mepco Schlenk Engineering College, Sivakasi, India
- 2 Computer Science and Engineering, Mepco Schlenk Engineering College, Sivakasi, India
Abstract
This research investigates the applications of homomorphic encryption systems in electronic voting schemes. We make use of Paillier cryptosystem which exhibits additive homomorphic properties. The other homomorphic cryptosystems RSA and Elgamal are not considered, since they exhibit only multiplicative homomorphic property. Our proposed method increases the level of security when compared to Elgamal method. It is more flexible when compared to previous schemes. We also propose data packing for efficient storage of election data. Finally, we demonstrate the advantages of the homomorphic encryption in voting schemes by comparing with other electronic voting scheme.
- Fontaine and Galand (2009) A Survey of Homomorphic Encryption for Nonspecialists Journal of Information Security.
- Colin, A.R.B. (2004) Multiplicative Homomorphic E-Voting. Progress in Cryptology-INDOCRYPT 5th International Conference on Cryptology in India, 20-22.
- Bellare, M. and O’Neill, A. (2013) Semantically-Secure, Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition. Cryptology and Network Security, 218-234. http://dx.doi.org/10.1007/978-3-319-02937-5_12
- Boneh, D., Goh, E. and Nissim, K. (2005) Evaluating 2-DNF Formulas on Cipher Texts. Theory of Cryptography Conference, TCC’2005, Lecture Notes in Computer Science, 325-341.
- Boneh, D. and Lewi, K. (2015) Key Homomorphic PRFs and Their Applications. IACR Cryptology ePrint Archive, 220.
- Garg, S., Gentry, C., Halevi, S. and Zhandry, M. (2014) Fully Secure Attribute Based Encryption from Multilinear Maps. Cryptology ePrint Archive, Report. http://print.iacr.org/2014/622
- Hayes, B. (2012) Alice and Bob in Cipher Space American Scientist. http://www.americanscientist.org/issues/pub/2012/5/
- Katz, J. and Thiruvengadam, A. (2015) Feasibility& Infeasibility of Adaptively Secure Fully Homomorphic Encryption. IACR Cryptology ePrint Archive, 280.
- Aguilar, M.C., et al. (2011) Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst- Case Hardness Assumptions. IACR Cryptology ePrint Archive, 607.
- Schoenmaker, B. and Tuyls, P. (2006) Efficient Binary Conversion for Paillier Encrypted Values. Advances in Cryptology-EUROCRYPT’06, Springer, Berlin, 522-537.
- Qiong, S.M. and Zhang, M.W. (2015) Efficient Public Key Encryption with Equality Test Supporting Flexible Authorization. IEEE Transactions on Information Forensics and Security, 10.
- Martenvan Dijk, S.D. (2015) Onion ORAM: A Constant Bandwidth and Constant Client Storage ORAM (without FHE or SWHE) IACR Cryptology ePrint Archive.
- Ravindran, S. and Kalpana, P. (2013) Data Storage Security Using Partially Homomorphic Encryption in a Cloud. International Journal of Advanced Research in Computer Science and Software Engineering, 3, 603-606.
- Han, W.W. (2014) A Provably Secure Public Key Encryption Scheme Based on Isogeny Star. The International Arab Journal of Information Technology.