Efficient identity-based signatures and blind signatures. (English) Zbl 1154.94460
Desmedt, Yvo G. (ed.) et al., Cryptology and network security. 4th international conference, CANS 2005, Xiamen, China, December 14–16, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30849-0/pbk). Lecture Notes in Computer Science 3810, 120-133 (2005).
Summary: In this paper, we first propose an efficient provably secure identity-based signature (IBS) scheme based on bilinear pairings, then propose an efficient identity-based blind signature (IBBS) scheme based on our IBS scheme. Assuming the intractability of the Computational Diffie-Hellman Problem, our IBS scheme is unforgeable under adaptive chosen-message and ID attack. Efficiency analyses show that our schemes can offer advantages in runtime over the schemes available. Furthermore, we show that, contrary to the authors claimed, Zhang and Kim’s scheme in ACISP 2003 is one-more forgeable, if the ROS-problem is solvable.
For the entire collection see [Zbl 1098.94002].
For the entire collection see [Zbl 1098.94002].
MSC:
| 94A62 | Authentication, digital signatures and secret sharing |
| 68P25 | Data encryption (aspects in computer science) |
