Skip to main content
SpringerLink
Log in

Untraceability of Partial Blind and Blind Signature Schemes

  • Conference paper
  • First Online:
Information Security and Cryptology (Inscrypt 2019)

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

Included in the following conference series:

  • 945 Accesses

Abstract

Blind Signature is employed in privacy related protocols, where signer signs on a blinded message. It provides anonymity in various cryptographic applications such as electronic voting, digital cash system etc. Concerning the need for quantum resistant scheme, Ruckert and Tian et al. proposed the lattice based blind signature and partial blind signature schemes respectively. But, both the schemes left out one of the security requirement of a blind i.e. Untraceability, where the signer can’t link the blinded signature with a valid message-signature pair even when it is revealed in public. In this article, we propose an attack on the untracebility property of both the schemes. The proposed attack opens the door for researchers to work on quantum resistant untraceable blind signature.

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 EPUB and 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

References

  1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of STOC 1996, pp. 99–108. ACM, New York (1996)

    Google Scholar 

  2. Ajtai, M.: Generating hard instances of the short basis problem. Proc. ICALP 1999, 1–9 (1999)

    MathSciNet  MATH  Google Scholar 

  3. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: STOC 2001, pp. 601–610. ACM, New York (2001)

    Google Scholar 

  4. Abe, M., Okamoto, T.: Provably secure partially blind signatures. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 271–286. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44598-6_17

    Chapter  Google Scholar 

  5. Abe, M., Fujisaki, E.: How to date blind signatures. In: Kim, K., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 244–251. Springer, Heidelberg (1996). https://doi.org/10.1007/BFb0034851

    Chapter  Google Scholar 

  6. Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R., Sherman, A. (eds.) Proceedings of Advances in Cryptology, Crypto 1982. LNCS, pp. 199–203. Springer, New York (1982). https://doi.org/10.1007/978-3-540-72540-4_33

  7. Camenisch, J., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 573–590. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72540-4_33

    Chapter  Google Scholar 

  8. Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-47721-7_12

    Chapter  Google Scholar 

  9. Lyubashevsky, V.: Lattice-based identification schemes secure under active attacks. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 162–179. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78440-1_10

    Chapter  Google Scholar 

  10. Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738–755. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29011-4_43

    Chapter  Google Scholar 

  11. Hwang, M.-S., Lee, C.-C., Lai, Y.-C.: An untraceable blind signature scheme based on the RSA cryptosystem. Technical report CYUT-IM-TR-2001-012, CYUT, September 2001

    Google Scholar 

  12. Rodrguez-Henrquez, F., Ortiz-Arroyo, D., Garca-Zamora, C.: Yet another improvement over the Mu–Varadharajan e-voting protocol. Comput. Stand. Interfaces 29(4), 471–480 (2007)

    Article  Google Scholar 

  13. Rückert, M.: Lattice-based blind signatures. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 413–430. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17373-8_24

    Chapter  Google Scholar 

  14. Tian, H., Zhang, F., Wei, B.: A lattice based partially blind signature. Secur. Priv. 9(12), 1820–1828 (2016)

    Google Scholar 

  15. Hwang, M.-S., Lee, C.-C., Lai, Y.-C.: Traceability on low-computation partially blind signatures for electronic cash. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E85-A, 1181–1182 (2002)

    Google Scholar 

  16. Hwang, M.-S., Lee, C.-C., Lai, Y.-C.: Traceability on RSA-based partially signature with low computation. Appl. Math. Comput. 145, 465–468 (2002)

    MathSciNet  Google Scholar 

  17. Hwang, M.-S., Lee, C.-C., Lai, Y.-C.: Traceability of Fan-Chen-Yeh blind signature scheme. Technical report CYUT-IM-TR-2001-009, CYUT, August 2001

    Google Scholar 

  18. Zuhua, S.: Improved user efficient blind signatures. Electron. Lett. 36(16), 1372–1374 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Motilal Nehru National Institute of Technology Allahabad, Prayagraj, 211004, India

    Swati Rawal & Sahadeo Padhye

Authors
  1. Swati Rawal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sahadeo Padhye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sahadeo Padhye .

Editor information

Editors and Affiliations

  1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China

    Zhe Liu

  2. Computer Science Department, Columbia University, New York, NY, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rawal, S., Padhye, S. (2020). Untraceability of Partial Blind and Blind Signature Schemes. In: Liu, Z., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2019. Lecture Notes in Computer Science(), vol 12020. Springer, Cham. https://doi.org/10.1007/978-3-030-42921-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-42921-8_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-42920-1

  • Online ISBN: 978-3-030-42921-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation