A Novel Blind Signature Scheme Based On Discrete Logarithm Problem With Un-traceability

Biswal, Biswa Bhusan and Mangal, Sukanta Kumar (2012) A Novel Blind Signature Scheme Based On Discrete Logarithm Problem With Un-traceability. BTech thesis.



Blind Signatures are a special type of digital signatures which possess two special properties of blindness and untraceability, which are important for today’s real world applications that require authentication , integrity , security , anonymity and privacy.
David Chaum[2] was the first to propose the concept of blind signatures. The scheme's security was based on the difficulty of solving the factoring problem [3, 4]. Two properties that are important for a blind signature scheme in order to be used in various modern applications are blindness and untraceability[2, 5, 6] . Blindness means that the signer is not able to know the contents of the message while signing it, which is achieved by disguising (or blinding) the message through various methods. Untraceability refers to preventing the signer from linking the blinded message it signs to a later unblinded version that it may be called upon to verify.
Blind signatures based on discrete logarithm problem are still an area with much scope for research. We aim to propose a novel blind signature scheme with untraceability , based on the discrete logarithm problem .

Item Type:Thesis (BTech)
Uncontrolled Keywords:discrete logarithm, untraceability, blind signature, hash function, cryptography
Subjects:Engineering and Technology > Computer and Information Science > Information Security
Divisions: Engineering and Technology > Department of Computer Science
ID Code:3481
Deposited By:Mr. Biswa Bhusan Biswal
Deposited On:24 May 2012 11:28
Last Modified:20 Dec 2013 14:25
Supervisor(s):Mohanty, S

Repository Staff Only: item control page