An RSA-Based (t,n) Threshold Proxy Signature Scheme without Any Trusted Combiner

  • Pei-yih Ting
  • Xiao-Wei Huang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5222)


In this paper we propose and analyze a new RSA-based proxy signature scheme and its corresponding (t,n) threshold scheme. Unlike numerous previous research works, the threshold proxy scheme does not require any trusted combiner and is thus a truly practical approach. The security of both schemes is based on a weaker version of the RSA assumption. Both schemes are unforgeable and especially the threshold proxy scheme inherits the merit of its predecessor - Shoup’s RSA threshold scheme - and thus is secure under a multi-party computation setup with active adversaries.


Cryptography Proxy signature Threshold proxy signature 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: Proceedings of the First ACM Conference on Computer and Communications Security (1993)Google Scholar
  2. 2.
    Chang, Y.F., Chang, C.C.: An RSA-based (t, n) Threshold Proxy Signature Scheme with Free-will Identities. International Journal of Information and Computer Security 1(1/2), 201–209 (2007)CrossRefGoogle Scholar
  3. 3.
    Chaum, D., Pedersen, T.: Wallet Databases with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)Google Scholar
  4. 4.
    Damgård, I., Jurik, M.: A generalisation, a simplification and some applications of paillier’s probabilistic public-key system. In: Proceedings of The International Workshop on Practice and Theory in Public Key Cryptography (PKC). LNCS, vol. 1992, pp. 119–136 (2001)Google Scholar
  5. 5.
    Damgård, I., Koprowski, M.: Practical Threshold RSA Signatures Without a Trusted Dealer. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 152–165. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Goldreich, O.: Foundations of cryptography - a primer. Foundations and Trends in Theoretical Computer Science 1(1), 1–116 (2005)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Hwang, M.S., Lu, J.L., Lin, I.C.: A practical (t, n) threshold proxy signature scheme based on the RSA cryptosystem. IEEE Transactions on Knowledge and Data Engineering 15(6) (2003)Google Scholar
  8. 8.
    Kuo, W.C., Chen, M.Y.: A Modified (t, n) Threshold Proxy Signature Scheme based on the RSA cryptosystem. In: Proceedings of the Third International Conference on Information Technology and Applications (ICITA) (2005)Google Scholar
  9. 9.
    Mambo, M., Usuda, K., Okmamoto, E.: Proxy Signatures for Delegating Signing Operation. In: Proceedings of 3rd ACM Conference Computer and Communication Security, pp. 48–57 (1996)Google Scholar
  10. 10.
    Mambo, M., Usuda, K., Okmamoto, E.: Proxy Signatures: Delegation of the Power to Sign Messages. IEICE Transactions on Fundamentals E79-A(9), 1338–1353 (1996)Google Scholar
  11. 11.
    Rivest, R.L., Kaliski, B.: RSA Problem (2003),
  12. 12.
    Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–220. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  14. 14.
    Wang, G., Bao, F., Zhou, J., Deng, R.H., Lin, I.C.: Comments on ”A practical (t, n) Threshold Proxy Signature Scheme based on the RSA cryptosystem. IEEE Transactions on Knowledge and Data Engineering, 16(10) (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Pei-yih Ting
    • 1
  • Xiao-Wei Huang
    • 1
    • 2
  1. 1.Department of Computer Science and EngineeringNational Taiwan Ocean UniversityTaiwan, R.O.C.
  2. 2.Institute of Information ScienceAcademia SinicaTaiwan, R.O.C.

Personalised recommendations