The Journal of Supercomputing

, Volume 70, Issue 1, pp 177–199 | Cite as

Detection and analysis of secure intelligent universal designated verifier signature scheme for electronic voting system

  • Liming Zuo
  • Neeraj Kumar
  • Hang Tu
  • Ankit Singh
  • Naveen Chilamkurti
  • Seungmin Rho


Security is a paramount concern for various applications, such as electronic voting system as sensitive data is to be transmitted among the nodes during transmission. Recently, Wu and Lin (Inf Technol Control 42:231–237, 2013) proposed a new probabilistic signature scheme and used it to construct two universal designated verifier signature schemes. They demonstrated that their scheme was secure under the bilinear inverse Diffie–Hellman assumption. However, in this paper, we will show that their scheme cannot provide unforgeability, i.e., the adversary could forge a legal signature of any message. The analysis shows that their schemes are not suitable for practical applications. To overcome these weaknesses, we proposed three improved schemes which are provably secure in the random oracles. In summary, our contributions in this paper was listed in following three folds: (1) we have shown that Wu et al. schemes cannot provide unforgeability, i.e., the adversary could forge a legal signature of any message. (2) We have proposed three improved schemes which overcomes the drawbacks of Wu et al. scheme and finally, (3) we have implemented the real-time packet analyzer for detection of invalid signature in electronic voting system using Snort. The analysis shows that the existing scheme is not suitable for practical applications and our implemented scheme is able to detect the vulnerability in the electronic voting system. The designed scheme generated alerts at regular intervals so that administrator takes adequate measures to mitigate the intrusion presented in the system.


Probabilistic signature Universal designated verifier signature  Bilinear inverse Diffie–Hellman problem Privacy-preserving Random oracle 



The authors would like to thank all the anonymous reviewers for their valuable suggestions and comments which improve the overall quality and presentation of the paper. This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) and funded by the Ministry of Education (2013R1A1A2061978).


  1. 1.
    He D, Chen Y, Chen J (2013) An efficient secure certificateless proxy signature scheme without pairings. Math Comput Model 57(9–10):2510–2518MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    He D, Huang B, Chen J (2013) New certificateless short signature scheme. IET Inf Secur 7(2):113–117CrossRefGoogle Scholar
  3. 3.
    He D, Chen J (2013) An efficient certificateless designated verifier signature scheme. Int Arab J Inf Technol 10(4):317–324Google Scholar
  4. 4.
    He D, Chen J, Zhang R (2011) An efficient identity-based blind signature scheme without bilinear pairings. Comput Electr Eng 37(4):444–450MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    He D, Chen J, Hu J (2011) An ID-based proxy signature schemes without bilinear pairings. Ann Telecommun 66(11–12):657–662Google Scholar
  6. 6.
    Ray I, Narasimhamurthi N (2001) An anonymous electro-nic voting protocol for voting over the Internet. In: Proceedings of the 3rd international workshop on advanced issues of E-commerce and web-based information systems (WECWIS’01), California, pp 188–190Google Scholar
  7. 7.
    Schoenmakers B (1999) A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Advances in cryptology-CRYPTO’99, Springer, pp 148–164Google Scholar
  8. 8.
    Chaum D, van Antwerpen H (1990) Undeniable signature. In: Advances in cryptology-CRYPTO’89, Springer, pp 212–216Google Scholar
  9. 9.
    Jakobsson M, Sako K, Impagliazzo R (1996) Designated verifier proofs and their applications. In: Maurer UM (ed) Advances in cryptology-EUROCRYPT’96, Lecture Notes in Computer Science, vol 1070. Springer, pp 143–154Google Scholar
  10. 10.
    Wang G (2003) An attack on not-interactive designated verifier proofs for undeniable signatures. Cryptology ePrint archive, report 2003/243.
  11. 11.
    Saeednia S, Kremer S, Markowitch O (2003) An efficient strong designated verifier signature scheme. In: Proceedings of the 6th international conference on information security and cryptology (ICISC 2003), Seoul, pp 40–54Google Scholar
  12. 12.
    Steinfeld R, Bull L, Wang H, Pieprzyk J (2003) Universal designated-verifier signatures. In: Advances in cryptology-ASIACRYPT’03, Springer, pp 523–542Google Scholar
  13. 13.
    Steinfeld R, Wang H, Pieprzyk J (2004) Efficient exten-sion of standard Schnorr/RSA signatures into universal designated-verifier signatures. In: Proceedings of the public key cryptography (PKC 2004), Springer, pp 86–100Google Scholar
  14. 14.
    Zhang R, Furukawa J, Imai H (2005) Short signature and universal designated verifier signature without random oracles. In: Applied cryptography and network security (ACNS), vol 3531. Springer, pp 483–498Google Scholar
  15. 15.
    Huang X, Susilo W, Mu Y, Wu W (2008) Secure univer-sal designated verifier signature without random oracles. Int J Inf Secur, Springer 7(3):171–183Google Scholar
  16. 16.
    Tang F, Lin C, Ke P (2012) Universal designated verifier signcryption. Netw Syst Secur LNCS 7645:126–134CrossRefGoogle Scholar
  17. 17.
    Yoneyama K, Ushida M, Ohta K (2011) Rigorous security requirements for designated verifier signatures. Inf Secur Cryptol LNCS 6584:318–335MathSciNetCrossRefGoogle Scholar
  18. 18.
    Wu T, Lin H (2013) Secure universal designated verifier signature and its variant for privacy protection. Inf Technol Control 42(3):231–237Google Scholar
  19. 19.
    Yoon EJ (2011) An efficient and secure identity-based strong designated verifier signature scheme. Inf Technol Control 40(4):323–329Google Scholar
  20. 20.
    Pointcheval D, Stern J (2000) Security arguments for digital signatures and blind signatures. J Cryptol 13(3):361–396CrossRefMATHGoogle Scholar
  21. 21.
    Zhou Z, Chen Z, Zhou T, Guan X (2010) The Study on network intrusion detection system of Snort, 2010 international conference on networking and digital societyGoogle Scholar
  22. 22.
    Kurundkar GD, Naik NA, Khamitkar SD (2012) Network intrusion detection using Snort. Int J Eng Res Appl (IJERA) 2(2):1288–1296Google Scholar
  23. 23.
    Cha J, Cheon J (2003) An identity-based signature from gap Diffie–Hellman groups. In: Proceedings of the PKC’03, Miami, pp 18–30Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Liming Zuo
    • 1
  • Neeraj Kumar
    • 2
  • Hang Tu
    • 3
  • Ankit Singh
    • 2
  • Naveen Chilamkurti
    • 4
  • Seungmin Rho
    • 5
  1. 1.School of Natural ScienceEast China Jiaotong UniversityNanchangChina
  2. 2.Department of Computer Science and EngineeringThapar UniversityPatialaIndia
  3. 3.School of ComputerWuhan UniversityWuhanChina
  4. 4.Department of Computer Science and Computer EngineeringLaTrobe UniversityMelbourneAustralia
  5. 5.Department of MultimediaSangkyul UniversityAnyang-siKorea

Personalised recommendations