Abstract
In this paper, we propose a fast signature scheme which is derived from three-pass identification scheme. Our signature scheme would require a modular exponentiation as preprocessing. However, no multiplication is used in the actual (i.e. on-line) signature generation. This means that the phase involves only a hashing operation, addition and a modular reduction. So far, some fast signature schemes called on the fly signatures were proposed. In those schemes the modular reduction is eliminated in the on-line phase. Therefore, our approach to obtain the fast on-line signature is different from theirs. This paper is the first approach for the fast signature scheme without on-line modular multiplication.
This work has been supported by the Telecommunications Advancement Organization of Japan under the grant for international joint research related to information-communications.
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
P. Barrett: “Implementing of the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor”, Advances in cryptology-Crypto’86, Lecture Notes in Computer Science 263, Springer-Verlag, pp. 311–323, 1987.
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.
I. Damgård: “Collision free hash functions and public key signature schemes”, Advances in cryptology-Eurocrypt’87, Lecture Notes in Computer Science 304, Springer-Verlag, pp. 203–216, 1988.
A. Fiat and A. Shamir: “How to Prove Yourself: practical solutions of identification and signature problems”, Advances in cryptology-Crypto’86, Lecture Notes in Computer Science 263, Springer-Verlag, pp. 186–194, 1987.
U. Feige, A. Fiat and A. Shamir: “Zero-knowledge proofs of identity”, Journal of cryptology, vol.1, pp. 77–95, 1988.
M. Girault: “Self-certified public keys”, Advances in cryptology-Eurocrypt’91, Lecture Notes in Computer Science 547, Springer-Verlag, pp. 490–497, 1992.
L. C. Guillou and J. J. Quisquater: “A’ paradoxal’ identity-based signature scheme resulting from zero-knowledge”, Advances in cryptology-Crypto’88, Lecture Notes in Computer Science 403, Springer-Verlag, pp. 216–231, 1989.
A. Karatsuba and Yu. Ofman: “Multiplication of multidigit numbers on automata”, Soviet Physics-Koklady, vol.7, pp. 595–596, 1963.
D. E. Knuth: “Seminumerical Algorithms”, The art of computer programming, vol.2, Second edition, Addison-Wesley, 1981.
D. E. Knuth: “Sorting and Searching”, The art of computer programming, vol.3, Second edition, Addison-Wesley, 1998.
P. Montgomery: “Modular multiplication without trial division”, Mathematics of computation, vol.44, pp. 519–521, 1985.
D. Naccache, D. M’raihi, S. Vaudenay and D. Raphaeli: “Can DSA be improved?”, Advances in cryptology-Eurocrypt’94, Lecture Notes in Computer Science 950, 1995.
National Institute of Standards and Technology (NIST): “Secure hash standards (SHS)”, Federal Information Processing Standards, 1995.
K. Ohta and T. Okamoto: “On Concrete Security Treatment of Signatures Derived from Identification”, Advances in cryptology-Crypto’ 98, Lecture Notes in Computer Science 1462, pp. 354–369, 1998.
T. Okamoto, M. Tada and A. Miyaji “Proposal of Efficient Signature Schemes based on Factoring”, Trans. IPSJ, Vol.42 No. 8, pp. 2123–2133, 2001.
D. Pointcheval: “The Composite Discrete Logarithm and Secure Authentication”, Advances in cryptology-PKC’00, Lecture Notes in Computer Science 1751, 2000.
D. Pointcheval and J. Stern: “Security arguments for digital signatures and blind signatures”, Journal of cryptology, vol.13, no.3, Springer-Verlag, pp. 361–396, 2000.
J. Pollard: “Monte Carlo methods for index computation mod p”, Mathematics of Computation, vol 32, pp. 918–924, 1978.
G. Poupard and J. Stern: “Security analysis of a practical’ on the fly’ authentication and signature generation”, Advances in cryptology-Eurocrypt’98, Lecture Notes in Computer Science 1403, Springer-Verlag, pp. 422–436, 1998.
G. Poupard and J. Stern: “On the fly signatures based on factoring”, Proceedings of the 6th ACM Conference on Computer and Communications Security (CCS), pp. 48–57, 1999.
R. L. Rivest: “The MD5 message-digest algorithm”, Internet Request for Comments, RFC 1321, 1992.
C. P. Schnorr: “Efficient signature generation by smart cards”, Journal of cryptology, vol.4, Springer-Verlag, pp. 161–174, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFCA/Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okamoto, T., Tada, M., Miyaji, A. (2003). An Improved Fast Signature Scheme without Online Multiplication. In: Blaze, M. (eds) Financial Cryptography. FC 2002. Lecture Notes in Computer Science, vol 2357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36504-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-36504-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00646-6
Online ISBN: 978-3-540-36504-4
eBook Packages: Springer Book Archive