Skip to main content

Efficient and Provably Secure Self-certified Signature Scheme

  • Conference paper
Active Media Technology (AMT 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5820))

Included in the following conference series:

Abstract

Self-certified signature scheme is a better choice than that in traditional public key system, since it omits key escrow problem of ID-based crypto-system and avoids complex certificate management of traditional PKI. In the work, we first formalized the security models of self-certified signature by classifying its adversary types. Then based on Okamoto’s signature idea, we proposed a concrete instance. And we also show that the proposed scheme is provably secure in the random oracle models and the security of the scheme is closely related to a extended security assumption: q −SDH+CDH assumption which is provided by us. Finally, by comparing the proposed scheme with Shao’s scheme, we show that the proposed scheme is very efficient in terms of computational costs of generation and verification of a signature. No pairing operator is required to sign a message in our scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. Journal of Cryptology 17(4), 297–319

    Google Scholar 

  2. Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)

    Google Scholar 

  3. Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)

    Google Scholar 

  4. Chang, Y., Chang, C., Huang, H.: Digital signature with message recovery using self-certificated public keys without trustworthy system authority. Applied Mathematics and Computation 161, 211–227 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Maurer, U.M.: Towards the equivalence of breaking the diffie-hellman protocol and computing discrete logarithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 271–281. Springer, Heidelberg (1994)

    Google Scholar 

  6. Girault, M.: Self-certified public keys. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 490–497. Springer, Heidelberg (1991)

    Google Scholar 

  7. Goldwasser, S., Micali, S., Rivest, R.: A digital signature secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281–308

    Google Scholar 

  8. Okamoto, T.: Efficient blind and partially blind signatures without random oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 80–99. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Peterson, H., Horster, P.: Self-certified keys- concepts and application. In: 3rd int. conference on communciation and multimedia security, pp. 102–116. Chapman & Hall, Sydney (1997)

    Google Scholar 

  10. Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387–398. Springer, Heidelberg (1996)

    Google Scholar 

  11. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  12. Saeednia, S.: A note on Girault’s self-certified mode. Information Prcessing Letters 86(6), 323–327 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Saeednia, S.: Identity-based and self-certificated key-exchange protocols. In: Mu, Y., Pieprzyk, J.P., Varadharajan, V. (eds.) ACISP 1997. LNCS, vol. 1270, pp. 47–53. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  14. Sadeghi, A.-R., Steiner, M.: Assumptions related to discrete logarithms: Why subtleties make a real difference. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 243–260. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Shao, Z.: Self-certified signature scheme from pairings. The Journal of Systems and Software 80, 388–395 (2007)

    Article  Google Scholar 

  16. Tseng, Y., Jan, J., Chien, H.: Digital signature with message recovery using self-ceritified public keys and its variants. Applied Mathematics and Computation 136, 203–214 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Zhang, J., Zou, W., Chen, D., Wang, Y.: On the Security of a Digital Signature with Message Recovery Using Self-certified Public Key. Informatica 29(3), 343–346

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, J., Chen, H., Geng, Q. (2009). Efficient and Provably Secure Self-certified Signature Scheme. In: Liu, J., Wu, J., Yao, Y., Nishida, T. (eds) Active Media Technology. AMT 2009. Lecture Notes in Computer Science, vol 5820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04875-3_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04875-3_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04874-6

  • Online ISBN: 978-3-642-04875-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics