Skip to main content
Springer Nature Link
Log in

Threshold Undeniable RSA Signature Scheme

  • Conference paper
  • First Online:
Information and Communications Security (ICICS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2229))

Included in the following conference series:

Abstract

Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almost all the existed schemes are based on discrete logarithm cryptosystems. In this paper, based on an improvement of the practical threshold RSA signature scheme proposed by Shoup at Eurocrypt’2000 and the first undeniable RSA signature scheme proposed by Gennaro, Krawczyk and Rabin at Crypto’97, we present the first, as we know, threshold undeniable RSA signature scheme. Our scheme is secure and robust since all the partial signatures are verifiable by adopting a discrete logarithm equality protocol proposed by Shoup.

Supported by the National Key Basic Research Program of China (No. G1999035810) and the National Natural Science Foundation of China (No. 60083007).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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.

Similar content being viewed by others

References

  1. J. Boyar, D. Chaum, I. Damgåard, and T. Pedersen. Convertible Undeniable Signatures. In Crypto’90, LNCS 537, pp. 189–205. Springer-Verlag, 1991.

    Google Scholar 

  2. D. Chaum. Zero-Knowledge Undeniable Signatures. In: Eurocrypt’90, LNCS 473, pp. 458–464. Springer-Verlag, 1991.

    Google Scholar 

  3. J. Camenisch, and M. Michels. Proving in Zero-knowledge that a Number Is the Product of Two Safe Primes. In Eurocrypt’99, LNCS 1592, pp.107–122. Springer-Verlag, 1999.

    Google Scholar 

  4. D. Chaum, and T.P. Pedersen. Transferred Cash Grows in Size. In Eurocrypt’92, LNCS 658, pp. 390–407. Springer-Verlag, 1993.

    Google Scholar 

  5. D. Chaum, and T.P. Pedersen. Wallet Databases With Observers. In Crypto’92, LNCS 740, pp. 89–105. Springer-Verlag, 1993.

    Google Scholar 

  6. D. Chaum, and H. Van Antwerpen. Undeniable Signatures. In Crypto’89, LNCS 435, pp. 212–216. Springer-Verlag, 1989.

    Google Scholar 

  7. Y. Desmedt. Society and Group Oriented Cryptography: A New Concept. In Crypto’87, LNCS 293, pp. 120–127. Springer-Verlag, 1988.

    Google Scholar 

  8. Y. Desmedt, and Y. Frankel. Threshold Cryptosystems. In Crypto’89, LNCS 435, pp. 307–315. Springer-Verlag, 1990.

    Google Scholar 

  9. I. Damgåard, and M. Koprowski. Practical Threshold RSA Signature Without a Trusted Dealer. In Eurocrypt 2001 (to appear). Available from http://www.daimi. au.dk/ ivan/papers.html

  10. I. Damgåard, and T. Pedersen. New Convertible Undeniable Signature Schemes. In Eurocrypt’96, LNCS 1070, pp. 372–386. Springer-Verlag, 1996.

    Google Scholar 

  11. Y. Frankel, P. D. MacKenzie, and M. Yung. Robust Efficient Distributed RSA-Key Generation. In 30th STOC, pp. 663–672. ACM, 1998.

    Google Scholar 

  12. R. Gennaro, H. Krawczyk, and T. Rabin. RSA-Based Undeniable Signature. In Crypto’97, pp. 132–148. Springer-Verlag, 1997.

    Google Scholar 

  13. L. Harn, and S. Yang. Group-Oriented Undeniable Signature Schemes without the Assistance of a Mutually Trusted Party. In Auscrypt’92, LNCS 718, pp. 133–142. Springer-Verlag, 1993.

    Google Scholar 

  14. S.K. Langford. Weakness in Some Threshold Cryptosystems. In Crypto’96, LNCS 1109, pp. 74–82. Springer-Verlag, 1996.

    Google Scholar 

  15. N.-Y. Lee, and T. Hwang. Group-Oriented Undeniable Signature Schemes with a Trusted Center. Computer Communications, 1999, 22: 730–734.

    Article  Google Scholar 

  16. C.-H. Lin, C.-T. Wang, and C.-C. Chang. A Group-Oriented (t, n) Undeniable Signature Scheme without Trusted Center. In: Information Security and Privacy, ACISP’96, LNCS 1172, pp. 266–274. Springer-Verlag, 1996.

    Chapter  Google Scholar 

  17. T.P. Pedersen. No-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Crypto’91, LNCS 576, pp. 129–140. Springer-Verlag, 1992.

    Google Scholar 

  18. B. Schoenmakers. A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting. In Crypto’99, LNCS 1666, pp. 148–164. Springer-Verlag, 1999.

    Google Scholar 

  19. A. Shamir. How to Share a Secret. Communications of the ACM, 1979, 22(11): 612–613.

    Article  MATH  MathSciNet  Google Scholar 

  20. V. Shoup. Practical Threshold Signatures. In Eurocrypt’2000, LNCS 1807, pp. 207–220. Springer-Verlag, 2000. Avalaible from http://www.shoup.net/papers/

    Google Scholar 

  21. M. Stadler. Publicly Verifiable Secret Sharing. In Eurocrypt’96, LNCS 1070, pp. 191–199. Springer-Verlag, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Engineering Research Center for Information Security Technology, State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, 100080, Beijing, P. R. China

    Guilin Wang, Sihan Qing & Mingsheng Wang

  2. Mathematics Department, College of Science and Technology, Nihon University, 101-8308, Tokyo, Japan

    Zhanfei Zhou

Authors
  1. Guilin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sihan Qing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mingsheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhanfei Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineering Research Center for Information Security Technology (ERCIST), Chinese Academy of Sciences, P.O. Box 8718, 100080, Beijing, China

    Sihan Qing

  2. NTT Labs, 1-1 Hikarinooka, 239-0847, Yokosuka-shi, Japan

    Tatsuaki Okamoto

  3. Oracle Corporation, 500 Oracle Parkway, 94065, Redwood Shores, CA, USA

    Jianying Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, G., Qing, S., Wang, M., Zhou, Z. (2001). Threshold Undeniable RSA Signature Scheme. In: Qing, S., Okamoto, T., Zhou, J. (eds) Information and Communications Security. ICICS 2001. Lecture Notes in Computer Science, vol 2229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45600-7_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45600-7_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42880-0

  • Online ISBN: 978-3-540-45600-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics