ID-based series-parallel multisignature schemes for multi-messages from bilinear maps

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper series-parallel multisignature schemes for multi-messages are investigated. We propose an ID-based series-parallel multisignature scheme (ID-SP-M4M scheme) based on pairings in which signers in the same subgroup sign the same message, and those in different subgroups sign different messages. Our new scheme is an improvement over the series-parallel multisignature schemes introduced by Doi, Mambo and Okamoto [5] and subsequent results such as the schemes proposed by Burmester et al. [4] and the original protocols proposed by Tada [17, 18], in which only one message is to be signed. Our ID-SP-M4M scheme is secure against forgery signature attack from parallel insiders under the BDH assumption. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Wang, L., Okamoto, E., Miao, Y., Okamoto, T., & Doi, H. (2006). ID-based series-parallel multisignature schemes for multi-messages from bilinear maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3969 LNCS, pp. 291–303). Springer Verlag. https://doi.org/10.1007/11779360_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free