ID-based aggregate signatures from bilinear pairings. (English) Zbl 1154.94477
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, 110-119 (2005).
Summary: Aggregate signature scheme was recently proposed by D. Boneh, C. Gentry, B. Lynn and H. Shacham [Lect. Notes Comput. Sci. 2656, 416–432 (2003; Zbl 1038.94553)], which presented a method for combining \(n\) signatures from \(n\) different signers on \(n\) different messages into one signature. In this paper, we propose an identity-based aggregate signature scheme based on the bilinear pairings. This enhances the efficiency of communication and signature verification process. We show that the security of our scheme is tightly related to the computational Diffie-Hellman assumption in the random oracle model.
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) |
