Skip to main content

Short and Efficient Identity-Based Undeniable Signature Scheme

  • Conference paper
Trust, Privacy and Security in Digital Business (TrustBus 2012)

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

  • 1271 Accesses

Abstract

The first provably secure identity-based undeniable signature schemes was proposed by Libert and Quisquater, where they formulated the security model of undeniable signature schemes in an identity-based setting for the first time. Later, Wu et al. proposed a convertible identity-based undeniable signature scheme. Both of the proposed schemes require pairing evaluations in their signing algorithm. In this paper, we propose an efficient identity-based undeniable signature scheme and prove its security in the random oracle model. Due to its efficient signing algorithm and short signature length, our scheme can be applied to systems with low-computation power which are operating in low-bandwidth communication channels (e.g. mobile phones, PDAs, etc.).

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.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., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Boyd, C., Foo, E.: Off-Line Fair Payment Protocols Using Convertible Signatures. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 271–285. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Chaum, D., van Antwerpen, H.: Undeniable Signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 212–216. Springer, Heidelberg (1990)

    Google Scholar 

  4. Galbraith, S.D., Mao, W.: Invisibility and Anonymity of Undeniable and Confirmer Signatures. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 80–97. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Jakobsson, M., Sako, K., Impagliazzo, R.: Designated Verifier Proofs and Their Applications. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 143–154. Springer, Heidelberg (1996)

    Google Scholar 

  6. Libert, B., Quisquater, J.-J.: Identity Based Undeniable Signatures. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 112–125. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

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

  8. Wu, W., Mu, Y., Susilo, W., Huang, X.: Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds.) Inscrypt 2007. LNCS, vol. 4990, pp. 25–39. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Behnia, R., Heng, SH., Gan, CS. (2012). Short and Efficient Identity-Based Undeniable Signature Scheme. In: Fischer-Hübner, S., Katsikas, S., Quirchmayr, G. (eds) Trust, Privacy and Security in Digital Business. TrustBus 2012. Lecture Notes in Computer Science, vol 7449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32287-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32287-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32286-0

  • Online ISBN: 978-3-642-32287-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics