Abstract
Blind signatures play a central role in e-business, anonymous credentials and other various promising applications. Most existing blinding signature schemes that are based on discrete logarithm problems over finite fields (DLP) admit sub-exponential time classical attacks and polynomial time quantum attacks. In this paper, based on the discrete logarithm problem over inner automorphism group (DLP-IAG), we propose a blind signature scheme which can be viewed as a non-commutative variant of the well-known Schnorr's blind signature scheme. By comparison, our construction is much more efficient in running time and storage space. In addition, at present there is no known subexponential time classical attacks and polynomial time quantum attacks against the DLP-IAG problems. Thus, our proposal has the long-term usability.
| Original language | English |
|---|---|
| Pages (from-to) | 538-545 |
| Number of pages | 8 |
| Journal | International Journal of Digital Content Technology and its Applications |
| Volume | 6 |
| Issue number | 19 |
| DOIs | |
| Publication status | Published - 2012 |
| Externally published | Yes |
Keywords
- Blind Signature
- Inner Automorphism Group
- Non-Commutative Cryptography