A comparison between traceable and untraceable blind signature schemes through simulation

This paper presents a comparison between two blind signature (BS) schemes to conduct the simulation of a traditional BS based electronic voting system (EVS). A BS scheme is a cryptographic protocol that plays a vital role to conduct the electronic transactions of privacy-related applications securely but anonymously. It ensures the confidentiality of the private information of a user while she involves in an electronic transaction over the internet. Intuitively, existing BS schemes can be categorized as traceable and untraceable. RSA cryptosystem based two popular schemes from two categories: the scheme of Chaum [1] from traceable schemes and the scheme of Hwang et al. [2] from untraceable schemes have been chosen here for simulation. The upshot of the simulation model is the comparison of computation time requirement of blinding, singing, unblinding and verification operations of the chosen BS schemes involved in different steps of a traditional BS based EVS.