Survey on Security of Blind Signature and Impossibility of Blind Signature from Lossy-Trapdoor-Permutations.

Date of Submission

December 2011

Date of Award

Winter 12-12-2012

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Cryptology and Security Research Unit (CSRU-Kolkata)


Barua, Rana (TSMU-Kolkata; ISI)

Abstract (Summary of the Work)

Blind Signature is a special form of digital signature, where the signer remains oblivious about the message, he signs and at the same time, the user can not generate any signature without the help of the signer. A seminal result in Cryptography is that signature schemes can be constructed (in a black-box way fashion) using Lossy-Trapdoor Permutations (LTDPs). In this thesis, we survey on the security of blind signature schemes in various models like in Random Oracle Model, Common Reference String Model and in Standard Model. We also survey on the security of special types of Blind Signature schemes like Partial Blind Signature scheme and Universally Composable blind Signature schemes and consider techniques like Blind Signature under Abort. Then we considered Lossy Trapdoor Permutations and it’s importance in Cryptology and then proved that, there can not be any black-box constructions of Blind Signature schemes from Lossy Trapdoor Permutations (LTDPs).


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.