International Journal of Computer Theory and Engineering

Abstract

With the phenomenal growth of internet and electronic transactions, security services, such as non repudiation, become crucial to many applications, e.g. electronic voting, electronic commerce, digital contract signing, and so on. The basic purpose of this research paper in to provide the quantitative analysis of a proposed non repudiable scheme in the published research paper named “Non Repudiation for Remote Voting”. Non-repudiation provides the proof of the casted vote and ensures the authenticity of voter using digital signatures. In remote voting system the use of digital signature scheme is relatively low due to the complexity and insecurity of existing digital signatures algorithms, therefore, for authentication, usually keys, tokens or IDs are used. The proposed scheme has introduced the simplified way of digital signature generation using simple built in functions. Also, the complexity of RSA key generation for the signatures has also been reduced. The quantitative analysis has been done by calculating the time and complexity level of different signature generation functions, which concluded that the approach of digital signatures functions is quite simple as compare to other lengthy techniques of digital signatures, as their execution time and complexity is less as compare to existing signature generation techniques.