Abstract
The basic theories for designing digital signatures are factorization or discrete logarithm. Generally, when building an information system, the defense ability of the system will be relatively weak if using either discrete logarithm or factorization theories alone. A blind signature scheme allows a person to sign an unknown message from others without knowing the disclosure of the content. It can be widely applied to secret electronic voting, anonymous digital cash systems, database security...etc. In view of the high security and efficiency and the need of a mechanism of Blind Signature in the future informationalized society, it is definitely essential to work out a way to eliminate the negative factors developed while building the system. This paper is following the main idea mentioned above and provides a novel blind signature scheme.
Original language | English |
---|---|
Pages | 123-127 |
Number of pages | 5 |
DOIs | |
State | Published - 14 Oct 2003 |
Event | Proceedings: 37th Annual 2003 International Carnahan Conference on Security Technology - Taipei, Taiwan Duration: 14 Oct 2003 → 16 Oct 2003 |
Conference
Conference | Proceedings: 37th Annual 2003 International Carnahan Conference on Security Technology |
---|---|
Country/Territory | Taiwan |
City | Taipei |
Period | 14/10/03 → 16/10/03 |
Keywords
- Blind Signature
- Discrete Logarithm
- Dual-Complexities
- Factorization