Movatterモバイル変換

[0]ホーム
URL:

Skip to main content

Advertisement

Springer Nature Link
Log in

Improved Online/Offline Signature Schemes

  • Conference paper
  • First Online:

Part of the book series:Lecture Notes in Computer Science ((LNCS,volume 2139))

Included in the following conference series:

Abstract

The notion of on-line/off-line signature schemes was introduced in 1990 by Even, Goldreich and Micali. They presented a general method for converting any signature scheme into an on-line/off-line signature scheme, but their method is not very practical as it increases the length of each signature by a quadratic factor. In this paper we use the recently introduced notion of a trapdoor hash function to develop a new paradigm calledhash-sign-switch, which can convert any signature scheme into a highly efficient on-line/off-line signature scheme: In its recommended implementation, the on-line complexity is equivalent to about 0.1 modular multiplications, and the size of each signature increases only by a factor of two. In addition, the new paradigm enhances the security of the original signature scheme since it is only used to sign random strings chosen off-line by the signer. This makes the converted scheme secure against adaptive chosen message attacks even if the original scheme is secure only against generic chosen message attacks or against random message attacks.

Similar content being viewed by others

Keywords

References

  1. Shimon Even, Oded Goldreich, and Silvio Micali,On-line/off-line Digital Signatures. InAdvances in Cryptology: Crypto’ 89, pp 263–277. August 1990. Springer.

    Google Scholar 

  2. Shafi Goldwasser, Silvio Micali, and Ron Rivest,A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM J. on Computing,17, pp 281–308, 1988.

    MATH MathSciNet  Google Scholar 

  3. Hugo Krawczyk and Tal Rabin,Chameleon Signatures. InSymposium on Network and Distributed Systems Security (NDSS’ 00), pp 143–154, February 2000, Internet Society.

    Google Scholar 

  4. Gary Miller,Riemann’s Hypothesis and Tests for Primality, J. Comp. Sys. Sci., 13:300–317, 1976.

    MATH  Google Scholar 

  5. Michael Rabin,Digitized Signatures as Intractable as Factorization, Technical Report MIT/LCS TR-212, January 1979.

    Google Scholar 

  6. Ron Rivest, Adi Shamir, and Len Adleman,A Method of Obtaining Digital Signatures and Public-Key Cryptosystems, CACM, 21(2), pp 120–126, February 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Applied Math. Dept., The Weizmann Institute of Science, Rehovot, 76100, Israel

    Adi Shamir & Yael Tauman

Authors
  1. Adi Shamir

    You can also search for this author inPubMed Google Scholar

  2. Yael Tauman

    You can also search for this author inPubMed Google Scholar

Editor information

Editors and Affiliations

  1. Yianilos Labs., 707 State Rd., Rt. 206, Suite 212, Princeton, NJ, 08540, USA

    Joe Kilian

Rights and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shamir, A., Tauman, Y. (2001). Improved Online/Offline Signature Schemes. In: Kilian, J. (eds) Advances in Cryptology — CRYPTO 2001. CRYPTO 2001. Lecture Notes in Computer Science, vol 2139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44647-8_21

Download citation

Publish with us

[8]ページ先頭
©2009-2025 Movatter.jp