Leila Zahhafi
ABSTRACT
In this work we present an anonymous secure e-voting scheme over a network for multiple elections. We applied a variant of ElGamal signature to construct an electronic voting for t elections. The method is based on the RSA blind signature that ensures the anonymity of all transactions in the voting process. We also analyze the security of the proposed protocol.
- Acquisti, A.: Receipt-Free Homomorphic Elections and Write-in Ballots. International as sociation for cryptologic research, May 2, 2004, and Carnegie Mellon institute for software (2004)Google Scholar
- Benaloh, J. & Young, M.:Distributing the Power of a Government to Enhance the Privacy of Voters. Proc. of the 5th ACM Symposium on Principles of Distributed Computing, 52--62 (1986) Google ScholarDigital Library
- Boyd,C.: A New Multiple Key Cipher and an Improved Voting Scheme. in Advances in Cryptology-EUROCRYPT '89, Berlin:Springer-Verlag, 617--625 (1989) Google ScholarDigital Library
- Chaum, D.: Blind signatures for untraceable payments, Advances in Cryptology, CryptoâĂŹ82, 199--203 (1982)Google Scholar
- Chaum, D.: Blind signature systems, Advances in Cryptology, Crypto'83, 153--156 (1983)Google Scholar
- Cramer, R., Franklin, M., Schoenmakers, B. & Yung, M.: Multi-authority secret ballot elections with linear work. Advances in Cryptology EUROCRYPT âĂŹ96, volume 1070 of Lecture Notes in Computer Science,pages 72 83, Berlin (1996) Google ScholarDigital Library
- Cramer, R., Gennaro, R. and Borrell, R.: A secure and optimally efficient multi-authority election scheme, Lecture Notes in Computer Science 1233, (EUROCRYPT'97), 103--117, Springer, Berlin (1997) Google ScholarDigital Library
- ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithm problem. IEEE Trans. Info. Theory, IT-31 (1985) Google ScholarDigital Library
- Ezziri, S. & khadir, O.: A blind signature based on the DLP and RSA cryptosystem. Gulf Journal of Mathematics, Vol 6, Issue 4, 44--50 (2018)Google ScholarCross Ref
- Ezziri, S., Khadir, O.: Variant of Guillou-Quisquater zero-knowledge scheme. Int. J. Open Problems Compt. Math., June 2018 ISSN 1998-6262; Copyright c ICSRS Publication, Vol. 10, No. 2 (2018)Google ScholarCross Ref
- Fiat, A. and Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. Springer-Verlag, Lecture notes in computer science, No 263, Advances in cryptology, Proceedings of Crypto '86, 186--194 (1987) Google ScholarDigital Library
- Guillou, L. and Quisquater, J.: A Practical Zero-Knowledge Protocol fitted to Security Micro-processor Minimizing both Transmission and Memory. Proc. of EuroCrypt 88, Springer VerlagLNCS series (1988) Google ScholarDigital Library
- Khadir, O.: New variant of ElGamal signature scheme, Int. J. Contemp. Math. Sciences, Vol. 5, no. 34, 1653--1662 (2010)Google Scholar
- Koblitz N.: Elliptic curve cryptosystem, Math. Comp. 48, 203--209 (1987)Google ScholarCross Ref
- Kremer S., Ryan M.: Analysis of an Electronic Voting Protocol in the Applied Pi Calculus. In: Sagiv M. (eds) Programming Languages and Systems. Lecture Notes in Computer Science, vol 3444. Springer, Berlin, Heidelberg (2005) Google ScholarDigital Library
- Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A.: Handbook of applied cryptography, 72 (1996) Google ScholarDigital Library
- National institute of standard and technology (NIST). FIPS Publication 186, DSA, Department of commerce (1994)Google Scholar
- Okamoto, T. Provably secure and practical identification schemes and corresponding signature schemes. Brickell E.F. (eds) Advances in Cryptology Crypto '92. Crypto 1992. Lecture Notes in Computer Science, v.740. Springer, Berlin, Heidelberg (1992) Google ScholarDigital Library
- Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Eurocrypt, 223--238 (1999) Google ScholarDigital Library
- Rabin, M.O.: Digital signatures and public-key functions as intractable as factorization. Technical Report MIT/LCS/TR--212 (1978) Google Scholar
- Rivest, R., Shamir, A., & Adeleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communication of the ACM Vol. no 21 (1978) Google ScholarDigital Library
- Schnorr, C.P.: Efficient Signature Generation by Smart Cards. Journal of Cryptology, 161--174 (1991) Google ScholarDigital Library
- Shamir, A.: Identity-based cryptosystems and signatures schemes. Springer-Verlag, Lecture notes in computer science, No 196, Advances in cryptology, Proceedings of Crypto '84, 47--53 (1985) Google ScholarDigital Library
- Mu, Y., Varadharajan, V.: IEEE Computer Society, 293--299 (1998)Google Scholar
- Ray, I., Ray, I. & Narasimhamurthi, N.: An anonymous electronic voting protocol for voting over the Internet. Proceedings Third International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems, 188--190 (2001) Google ScholarDigital Library
- Sako, K. & Kilian, j.: Secure voting using partially compatible homomorphisms. CRYPTO '94: 14th International Cryptology Conference, volume 839 of LNCS, 411--424 (1994) Google ScholarDigital Library
- Shor & Peter: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing, 1484--1509. (1997) Google ScholarDigital Library
- Sako, K. & Kilian, j.: Secure voting using partially compatible homomorphisms. CRYPTO '94: 14th International Cryptology Conference, volume 839 of LNCS, 411--424 (1994) Google ScholarDigital Library
- Zahhafi, L. & khadir, O.: A fast cryptographic protocol for anonymous voting. MathLAB Journal. vol 1, issue 1, 89--99 (2018)Google Scholar
- Zahhafi, L. & khadir, O.: A digital signature scheme based simultaneously on the DSA and RSA protocols. Gulf Journal of Mathematics, Vol 6, Issue 4, 37--43 (2018)Google Scholar
- Zahhafi, L. & khadir, O.: A secure variant of Schnorr signature using the RSA algorithm. Vol 1, issue 2, 104--109 (2018)Google Scholar
Index Terms
- Anonymous Secure E-voting over a Network for Multiple Elections
Recommendations
A Secure Multi Authority Electronic Voting Protocol Based on Blind Signature
ACE '10: Proceedings of the 2010 International Conference on Advances in Computer EngineeringElectronic voting is an emerging application of cryptographic protocols. In this paper we propose a simple multi-authority electronic voting protocol based on blind signature, which meets security requirements such as privacy, accuracy, verifiability, ...
Signer-admissible strong designated verifier signature from bilinear pairings
In the designated verifier signature, the validity of signature can be proved by the specific verifier although the verifier has no ability to prove this to others. On the other hand, strong designated verifier signature SDVS can only be verified by the ...
Design of provably secure and efficient certificateless blind signature scheme using bilinear pairing
In the literature, several pairing-based blind signature schemes have been put forwarded using identity-based cryptography. However, the private key escrow problem of these schemes makes them unsuitable in practical environments because the private key ...
Comments