Security of Blind Digital Signatures
Ari Juels, Michael Luby, Rafail Ostrovsky
Abstract: Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously defined and satisfied in the common reference string model, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the first complexity-based proof of security for blind signatures.
comment: Appeared In Proceedings of advances in cryptology, (CRYPTO-97) Springer-Verlag Lecture Notes in Computer Science. Revised in 2005.
Fetch PostScript file of the paper Fetch PDF file of the paper
| Back to Publications List |