Abstract
In this paper, we propose two efficient RSA multisignature schemes, one is an improved version of Okamoto's scheme [6] and the other is that of Kiesler-Harn's scheme [3]. The first one causes bit expansion in block size of a multisignature, but the bit length of the expansion is no more greater than the number of signers regardless of their RSA modulus. The second one has no bit expansion, in which all signers have a RSA modulus with the same bit size and the same most significant 1 bits pattern. An average number of the required exponentiations to obtain a multisignature is about \((1 + \tfrac{1}{{2^{l - 1} }})\), where m denotes the number of signers. Futhermore, our schemes have no restriction in signing order and are claimed to be more efficient than Okamoto's scheme and Kiesler-Harn's scheme respectively.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Harn, L. and Kiesler, T., “New scheme for digital signatures”, Electronics Letters, 1989, 25, (22), pp.1527–1528
Itakura, K., and Kakamura, K., “A public-key cryptosystem suitable for digital signatures”, NEC J. Res. Dev. 71 (Oct. 1983).
Kiesler, T. and Harn, L., “RSA blocking and multisignature schemes with no bit expansion”, Electronics Letters, 1990, 26, (18), pp.1490–1491
Kohnfelder, L. M., “On the signature reblocking problem in public-key cryptography”, Commun. ACM, 1978, 21, (2) pp.179
Levine, J. and Brawley, J. V., “Some cryptographic applications of permutation polynomials”, Cryptologia, 1977, 1, pp. 76–92
Okamoto, T., “A digital multisignature scheme using bijective public-key cryptosystems”, ACM Trans. Computer Systems, 1988, 6, (8), pp.432–441
Rivest, R. L., “Remarks on a proposed cryptanalytic attack on the M.I.T. publickey cryptosystem”, Cryptologia, 1978, Vol.2, No. 1,pp. 62–65
Rivest, R. L., Shamir, A., and Adleman, L., “A method for obtaining digital signatures and public-key cryptosystem”, Commun. ACM, 1978, 21, (2), pp. 120–126
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Park, S., Park, S., Kim, K., Won, D. (1997). Two efficient RSA multisignature schemes. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028477
Download citation
DOI: https://doi.org/10.1007/BFb0028477
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63696-0
Online ISBN: 978-3-540-69628-5
eBook Packages: Springer Book Archive