Skip to main content
SpringerLink
Log in

Linkability of a Blind Signature Scheme and Its Improved Scheme

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3983))

Included in the following conference series:

Abstract

Blind signature allows a user to obtain signatures from an authority on any document, in such a way that the authority learns nothing about the message that is being signed. The blindness is an important property in blind signature scheme. In this work, we analyze security of the blind signature[1], and show that the scheme hasn’t blindness, in other words, the signer is able to link a valid message-signature pair obtained by some user. To overcome the above flaw, we propose an improved scheme and show that the security of the improved scheme is based on the Computational Diffie-Hellman problem.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Huang, Z.J., Chen, K.F., Wang, Y.M.: Efficient identity-based signatures and blind signatures. In: Desmedt, Y.G., Wang, H., Mu, Y., Li, Y. (eds.) CANS 2005. LNCS, vol. 3810, pp. 120–133. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

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

  4. Chaum, D.: Blind signature for untraceable payment. In: Advances in Cryptology-Crypto 1982, pp. 199–203. Springer, Heidelberg (1983)

    Google Scholar 

  5. Chow, S.S.M., Hui, L.C.K., Yiu, S.M., Chow, K.P.: Two improved partially blind signature schemes from bilinear pairings. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 316–328. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Kim, J.-H., Kim, K., Lee, C.S.: An efficient and provably secure threshold blind signature. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 318–327. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Pedersen, T.P.: Distributed provers with applications to undeniable signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 221–242. Springer, Heidelberg (1991)

    Google Scholar 

  8. Boldyreva, A.: Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman group signature. In: PKC 2003. LNCS, vol. 2139, pp. 31–46. Springer, Heidelberg (2003)

    Google Scholar 

  9. Wang, S., Bao, F., Deng, R.H.: Cryptanalysis of a forward secure blind signature scheme with provable security. In: Qing, S., Mao, W., López, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 53–60. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Camenisch, J., Koprowski, M., Warinschi, B.: Efficient Blind Signatures Without Random Oracles. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 134–146. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Dwork, C., Naor, M.: An efficient existentially unforgeable signature scheme and its applications. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 234–246. Springer, Heidelberg (1994)

    Google Scholar 

  12. Even, S., Goldreich, O., Micali, S.: On-line/off-line digital signatures. Journal of Cryptology (9), 35–67 (1996)

    Google Scholar 

  13. Perrig, A.: The BiBa one-time signature and broadcast authentication. In: The 8th ACM Conference on Computer and Communication security, pp. 28–37. ACM, New York (2001)

    Chapter  Google Scholar 

  14. Okamoto, T., Inomata, A., Okamoto, E.: A proposal of short proxy signature using pairing. In: The proceedings of the International Conference on Information Technology: Coding and Computing, pp. 631–635 (2005)

    Google Scholar 

  15. Pointcheval, D.: Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology 13(3), 361–396

    Google Scholar 

  16. Zhang, F., Kim, K.: ID-based blind signature and ring signature from pairings. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 533–547. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. 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, pp. 312–323. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Schnorr, C.: Security of blind discrete log signatures against interactive attacks. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 1–12. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Yi, X.: An Identity-Based Signature Scheme From the Weil Pairing. IEEE Communications Letter 7(2), 76–78 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science & Technology, Peking University, Beijing, 100871, P.R.China

    Jianhong Zhang, Tao Wei, JianYu Zhang & Wei Zou

  2. College of Science, North China University of Technology, Shijingshan District, Beijing, 100041, P.R.China

    Jianhong Zhang

Authors
  1. Jianhong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tao Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. JianYu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wei Zou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd.,, Cathedral House 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, J., Wei, T., Zhang, J., Zou, W. (2006). Linkability of a Blind Signature Scheme and Its Improved Scheme. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751632_28

Download citation

  • DOI: https://doi.org/10.1007/11751632_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34077-5

  • Online ISBN: 978-3-540-34078-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation