Skip to main content
SpringerLink
Log in

Signcryption Scheme in Multi-user Setting without Random Oracles

  • Conference paper
Advances in Information and Computer Security (IWSEC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5312))

Included in the following conference series:

Abstract

Since the notion of signcryption scheme was introduced by Zheng in 1997, many signcryption schemes were proposed. In 2002, An et al. introduced an insider and outsider security of signcryption scheme. Their insider security model was based on the so-called g-CCA2 security which was a relaxation of CCA2 security (adaptive chosen ciphertext attacks security). The g-CCA2 security means that an attacker is not allowed to query the ”equivalent” challenged ciphertext (which is produced by the same challenged plaintext). Recently, many insider-secure signcryption schemes were proposed and provably insider-secure in the random oracles model based on the usual CCA2 security (not the g-CCA2 security), for example, Libert-Quisquater’s signcryption schemes at PKC’2004 and SCN’2004 respectively, Yang et al.’s signcryption scheme at ISC’2005 and Ma’s signcryption scheme at Inscrypt’2006. But, Tan showed that these signcryption schemes were not insider-secure against either adaptive chosen ciphertext attacks or forgery in two-user setting. In this paper, we proposed an insider-secure signcryption scheme based on encrypt-then-sign structure and it is provably insider-secure in a multi-user setting without random oracles based on the usual CCA2 security. The other advantage of the proposed signcryption scheme is that the ciphertext is publicly verifiable and corresponds to the unique plaintext.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 83–107. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Baek, J., Steinfeld, R., Zheng, Y.: Formal proofs for the security of signcryption. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 80–98. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Baek, J., Steinfeld, R., Zheng, Y.: Formal proofs for the security of signcryption. J. Cryptology 20(2), 203–235 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Boneh, D., Boyen, X.: Efficient selective-ID secure identity based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223–238. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Boneh, D., Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. SIAM J. Comput. 36(5), 1301–1328 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dent, A.W.: Hybrid signcryption schemes with insider security. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 253–266. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Dent, A.W.: Hybrid signcryption schemes with outsider security. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 203–217. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Dodis, Y., An, J.-H.: Concealment and its applications to authenticated encryption. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 312–329. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Dodis, Y., Freedman, M.J., Jarecki, S., Walfish, S.: A versatile padding schemes for joint signature and encryption. In: The 11th ACM Conference on Computer and Communications Security, pp. 344–353. ACM press, New York (2004)

    Google Scholar 

  11. Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing 17(2), 281–308 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  12. Jeong, I.-R., Jeong, H.-J., Rhee, H.-S., Jong, I.-L.: Provably secure encrypt-then-sign composition in hybrid signcryption. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 16–34. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Libert, B., Quisquater, J.J.: Efficient signcryption with key privacy from gap Diffie-Hellman groups. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 187–200. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Libert, B., Quisquater, J.J.: Improved signcryption from q-Diffie-Hellman problems. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 220–234. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Ma, C.: Efficient short signcryption scheme with public verifiability. In: Lipmaa, H., Yung, M., Lin, D. (eds.) Inscrypt 2006. LNCS, vol. 4318, pp. 118–129. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Malone-Lee, J.: Signcryption with non-interactive non-repudiation. Designs, Codes and Cryptography 37(1), 81–109 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Malone-Lee, J., Mao, W.: Two birds one stone: Signcryption using RSA. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 211–225. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Shoup, V.: Sequences of games: a tool for taming complexity in security proofs (manuscript, 2004), http://eprint.iacr.org/2004/332

  19. Tan, C.H.: On the security of signcryption scheme with key privacy. IEICE Trans. on Fundamentals E88-A(4), 1093–1095 (2005)

    Article  Google Scholar 

  20. Tan, C.H.: Security analysis of signcryption scheme from q-Diffie-Hellman problems. IEICE Trans. on Fundamentals E89-A(1), 206–208 (2006)

    Article  Google Scholar 

  21. Tan, C.H.: Analysis of improved signcryption scheme with key privacy. Information Processing Letters 99(4), 135–138 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Tan, C.H.: Insider-secure hybrid signcryption scheme without random oracles. In: The 2nd International Conference on Availability, Reliability and Security 2007 (ARES 2007), pp. 1148–1154. The IEEE Computer Press, Los Alamitos (2007)

    Chapter  Google Scholar 

  23. Tan, C.H.: Forgery of provable secure short signcryption scheme. IEICE Trans. on Fundamentals E90-A(9), 1879–1880 (2007)

    Article  Google Scholar 

  24. Yang, G., Wong, D.S., Deng, X.: Analysis and improvement of a signcryption scheme with key privacy. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 218–232. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  25. Zheng, Y.: Digital signcryption or how to achieve cost(signature & encryption) ≪ cost(signature) + cost(encryption). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 165–179. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NISlab, Department of Computer Science and Media Technology, Gjøvik University College, Norway

    Chik How Tan

Authors
  1. Chik How Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Industrial Science, University of Tokyo, 4-6-1 Komaba, Meguro-ku, 153-8505, Tokyo, Japan

    Kanta Matsuura

  2. NTT Information Sharing Platform Laboratories, NTT Corporation, Japan

    Eiichiro Fujisaki

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, C.H. (2008). Signcryption Scheme in Multi-user Setting without Random Oracles. In: Matsuura, K., Fujisaki, E. (eds) Advances in Information and Computer Security. IWSEC 2008. Lecture Notes in Computer Science, vol 5312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89598-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89598-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89597-8

  • Online ISBN: 978-3-540-89598-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation