Please use this identifier to cite or link to this item:
|Title:||A Novel Untraceable Blind Signature Based on Elliptic Curve Discrete Logarithm Problem|
Jena, S K
|Citation:||International Journal of Computer Science and Network Security, Vol 7, No 6, P 269-275|
|Abstract:||In this paper, a novel Blind Signature Scheme (BSS) has been proposed. The scheme is based on Elliptic Curve Discrete Logarithm Problem (ECDLP). It allows a requester to obtain signature from a signer on any document, in such a way that the signer learns nothing about the message that is being signed. The scheme utilizes the inherent advantage of Elliptic Curve Cryptosystem in terms of smaller key size and lower computational overhead to its counterpart public cryptosystems such as RSA and ElGamal. The scheme has been proved to be robust, untraceable and correct. The proposed scheme can be used in various applications like E-voting, digital cash etc where anonymity of requester is required.|
|Description:||Copyright for the paper belongs to the publisher|
|Appears in Collections:||Journal Articles|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.