Skip to main content
SpringerLink
Log in

An ID-Based Verifiable Encrypted Signature Scheme Based on Hess’s Scheme

  • Conference paper
Information Security and Cryptology (CISC 2005)

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

Included in the following conference series:

Abstract

This paper proposes an efficient ID-based verifiably encrypted signature scheme based on Hess’s ID-based signature scheme [3]. We provide some theoretical discussions for the security model of ID-based verifiably encrypted signature schemes, and show that our new scheme can be proven to be secure in the random oracle model. Our new scheme can be used as primitives to build efficient ID-based optimistic fair exchange protocols, which can be widely used in signing digital contracts, e-payment and other electronic commerce.

Research supported by Found 973 (No. G1999035804), NSFC (No. 90204015, 60473021) and Elitist Youth Foundation of Henan in China (No. 021201400).

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. 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 (1984)

    Chapter  Google Scholar 

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

  3. Hess, F.: Efficient identity based signature schemes based on pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 310–324. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Cha, J.C., Cheon, J.H.: An identity-based signature from gap diffie-hellman groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 18–30. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Yi, X.: An identity-based signature scheme from the Weil pairing. IEEE Communications Letters 7(2), 76–78 (2003)

    Article  Google Scholar 

  6. Paterson, K.G.: ID-Based Signatures from Pairings on Elliptic Curves. Electron. Lett. 38(18), 1025–1026 (2002)

    Article  Google Scholar 

  7. Zhang, F., Kim, K.: Efficient ID-based blind signature and proxy signature from bilinear pairings. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Gu, C., Zhu, Y.: Provable security of ID-based proxy signature schemes. In: Lu, X., Zhao, W. (eds.) ICCNMC 2005. LNCS, vol. 3619, pp. 1277–1286. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 591–606. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  10. Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126–144. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Poupard, G., Stern, J.: Fair encryption of RSA keys. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 172–189. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and Verifiably Encrypted Signature from Bilinear Maps. In: Eurocrypt 2003. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2003)

    Google Scholar 

  13. Li, M.D., Yang, Y.X., Ma, C.G., Cai, M.C.: A scheme of fair exchange of signatures based on bilinear aggregate signatures. Journal of China Institute of Communications 25(12), 59–64 (2005)

    MATH  Google Scholar 

  14. Dodis, Y., Reyzin, L.: Breaking and reparing optimistic fair exchange from PODC 2003. In: Proc. of the 2003 ACM Workshop on Digital Rights Management, pp. 47–54. ACM Press, New York (2003)

    Chapter  Google Scholar 

  15. Nenadic, A., Zhang, N., Cheetham, B., Goble, C.: An RSA-based Security Protocol for Certified E-goods Delivery. In: Proc. IEEE International Conference on Information Technology, ITCC 2004, Las Vegas, USA, pp. 22–28. IEEE Computer Society, Los Alamitos (2004)

    Chapter  Google Scholar 

  16. Ateniese, G.: Verifiable Encryption of Digital Signatures and Applications. ACM Transactions on Information and System Security 7(1), 1–C20 (2004)

    Article  Google Scholar 

  17. Sakai, Y., Sakurai, K.: Efficient Scalar Multiplications on Elliptic Curves without Repeated Doublings and Their Practical Performance. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 59–73. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Network Engineering Department, Information Engineering University, P.O. Box 1001-770, Zhengzhou, 450002, P.R. China

    Chunxiang Gu & Yuefei Zhu

Authors
  1. Chunxiang Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuefei Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. State Key Laboratory of Information Security, Institution of Software of Chinese Academy of Sciences, 100080, Beijing, China

    Dengguo Feng

  2. SKLOIS Lab, Institute of Software, Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Dongdai Lin

  3. Computer Science Department, Google Inc. and Columbia University, 1214 Amsterdam Avenue, NY 10027, New York, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gu, C., Zhu, Y. (2005). An ID-Based Verifiable Encrypted Signature Scheme Based on Hess’s Scheme. In: Feng, D., Lin, D., Yung, M. (eds) Information Security and Cryptology. CISC 2005. Lecture Notes in Computer Science, vol 3822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599548_4

Download citation

  • DOI: https://doi.org/10.1007/11599548_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30855-3

  • Online ISBN: 978-3-540-32424-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation