Abstract
In an order-specified multisignature scheme, one can verify not only a set of signers who have signed the message but also its signing order. Though we have seen several scheme with such properties proposed, none of them is given the security proof against active adversaries. In the scheme by [6], no polynomial-time active adversary can forge a signature for a new message, but it is possible for active adversaries to forge a signature changing its signing order. Furthermore, that scheme has the restriction that the possible signing orders are only ones of the type of serial signing. In this paper, we propose an order-specified multisignature scheme, which is shown to be secure against adaptive chosen-message insider attacks for bath a message and a signing order, and which allows the signing orders to form like any series-parallel graphs unlike the scheme [6]. The security is shown by using ID-reduction technique, which reduces the security of multisignature schemes to those of multi-round identification schemes. Furthermore, we discuss the efficiency of the proposed scheme and the upper bound of the possible number of participating signers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Bellare and P. Rogaway: “Random oracles are practical: a paradigm for designing efficient protocols”, Proceedings of the 1st ACM Conference on Computer and Communications Security (CCS), 1993.
H. L. Bodlaender and B. de Fluiter: “Parallel algorithm for series parallel graphs”, Europian Symposium on Algorithms, pp. 277–289, 1996.
M. Burmester, Y. Desmedt, H. Doi, M. Mambo, E. Okamoto, M. Tada and Y. Yoshifuji: “A structured ElGamal-type multisignature scheme”, Proceedings of PKC2000, Lecture Notes in Computer Science 1751, pp. 466–483, Springer-Verlag, 2000.
H. Doi, M. Mambo and E. Okamoto: “On the security of the RSA-based multisignature scheme for various group structure”, Proceedings of ACISP2000, Lecture Notes in Computer Science 1841, pp. 352–367, Springer-Verlag, 2000.
S. Mitomi and A. Miyaji: “A multisignature scheme with message flexibility, order flexibility and order verifiability”, Proceedings of ACISP2000, Lecture Notes in Computer Science 1841, pp. 298–312, Springer-Verlag, 2000.
K. Ohta and T. Okamoto: “Multi-signature schemes secure against active insider attacks”, IEICE transactions of fundamentals, vol. 82-A, no. 1, pp. 22–31, 1999.
K. Ohta and T. Okamoto: “Generic construction methods of multi-signature schemes”, Proceedings of The 2001 Symposium on Cryptography and Information Security (SCIS2001), vol. I, pp. 31–36, 2001.
D. Pointcheval and J. Stern: “Security arguments for digital signatures and blind signatures”, Journal of cryptology, vol. 13, no. 3, pp. 361–396, Springer-Verlag, 2000.
C. P. Schnorr: “Efficient signature generation by smart cards”, Journal of cryptology, vol. 4, pp. 161–174, Springer-Verlag, 1991.
A. Shimbo: “Design of a modified ElGamal signature scheme”, Workshop on Design and Evaluation of Cryptographic Algorithms, pp. 37–44, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tada, M. (2002). An Order-Specified Multisignature Scheme Secure against Active Insider Attacks. In: Batten, L., Seberry, J. (eds) Information Security and Privacy. ACISP 2002. Lecture Notes in Computer Science, vol 2384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45450-0_26
Download citation
DOI: https://doi.org/10.1007/3-540-45450-0_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43861-8
Online ISBN: 978-3-540-45450-2
eBook Packages: Springer Book Archive