Abstract
In this paper, we propose a fast signature scheme which realizes short transmissions and minimal on-line computation. Our scheme would require a modular exponentiation as preprocessing (i.e., off-line computation). However, there exist the following remarkable properties: neither multiplication and modular reduction is used in the actual signature generation (i.e., on-line computation). This means that in the on-line phase, our scheme requires only two operations: hashing and addition. So far, some fast signature schemes with small on-line computation are proposed. However, those schemes require multiplication or modular reduction in the on-line phase. This leads to a large amount of work compared to that of addition. As far as we know, this is the first approach to obtain the fast signature without those two calculus methods.
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
Barrett, P.: Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311–323. Springer, Heidelberg (1987)
Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proc. of 1st ACM Conference on Computer and Communications Security, pp. 62–73. Springer, Heidelberg (1993)
Damgård, I.B.: Collision free hash functions and public key signature schemes. In: Chaum, D., Price, W.L. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 203–216. Springer, Heidelberg (1988)
Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. Journal of Cryptology 1, 77–95 (1988)
Fiat, A., Shamir, A.: How to prove yourself: practical solutions of identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)
Giraut, M.: Self-certified public keys. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 490–497. Springer, Heidelberg (1992)
Guillou, L.C., Quisquater, J.J.: A “paradoxal” identity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 216–231. Springer, Heidelberg (1989)
Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Doklady Akademii Nauk SSSR 145(2), 293–294 (1962)
Knuth, D.E.: Seminumerical Algorithms, 3rd edn. The Art of Computer Programming, vol. 2. Addison-Wesley, Reading (1998)
Knuth, D.E.: Sorting and Searching, 2nd edn. The Art of Computer Programming, vol. 3. Addison-Wesley, Reading (1998)
Montgomery, P.: Modular multiplication without trial division. Mathematics of Computation 44, 519–521 (1985)
National Institute of Standards and Technology (NIST). Secure hash standard(SHS). In: Federal Information Processing Standards (April 1995)
Okamoto, T., Tada, M., Miyaji, A.: Proposal of efficient signature schemes based on factoring. Trans. IPSJ 42(8), 2123–2133 (2001) (in Japanese)
Okamoto, T., Tada, M., Miyaji, A.: An improved fast signature scheme without on-line multiplication. In: Financial Cryptography 2002. Springer, Heidelberg (2002)
Poincheval, D.: The composite discrete logarithm and secure authentication. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 113–128. Springer, Heidelberg (2000)
Poincheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology (2000)
Pollard, J.: Monte carlo methods for index computation ( mod p). Mathematics of Computation 32, 918–924 (1978)
Poupard, G., Stern, J.: Security analysis of a practical “on the fly” authentication and signature generation. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 422–436. Springer, Heidelberg (1998)
Poupard, G., Stern, J.: On the fly signatures based on factoring. In: Proc. of the 6th CCS, pp. 48–57. ACM Press, New York (1999)
Rivest, R.L.: The MD5 message-digest algorithm. Internet Request for Comments, RFC 1321 (April 1992)
Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, Heidelberg (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okamoto, T., Katsuno, H., Okamoto, E. (2003). A Fast Signature Scheme Based on New On-line Computation. In: Boyd, C., Mao, W. (eds) Information Security. ISC 2003. Lecture Notes in Computer Science, vol 2851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10958513_9
Download citation
DOI: https://doi.org/10.1007/10958513_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20176-2
Online ISBN: 978-3-540-39981-0
eBook Packages: Springer Book Archive