Converting normal DLP-based signatures into blind

摘要

Since the concept of blind signature was first introduced by Chaum, there are many applications of blind signatures. Especially, blind signatures have been applied widely in anonymous E-Cash systems. The most used blind signatures in E-Cash systems are based on discrete logarithm problem (DLP in short).This paper investigates the method to construct DLP-based blind signatures and tries to generalize how can these blind signatures be utilized to build double-spending resistant anonymous E-Cash systems.