Skip to main content

Advertisement

Log in

A secure threshold Paillier proxy signature scheme

  • Published:
Journal of Zhejiang University SCIENCE C Aims and scope Submit manuscript

Abstract

As e-commerce applications and the underlying public key infrastructure have become more popular over time, many digital mechanisms emulating traditional business activities have been developed and deployed. To build a full-fledged secure digital world, secure implementations of more commercial activity primitives are required. In this paper, we present a secure proxy signature scheme and its threshold version based on the homomorphic Paillier cryptosystem, which can be used in many e-commerce applications such as e-voting, e-bidding/auction, and privacy-preserving data mining. These two schemes are existentially unforgeable against chosen-message attacks and chosen-warrant attacks in the random oracle model. Although it is based on factoring, the threshold Paillier proxy scheme operates without requiring any trusted dealer or combiner. Thus, these two schemes are practical for integration in modularized secure multi-party protocols.

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

Access this article

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Abe, M., Suzuki, K., 2002. M+1-st price auction using homomorphic encryption. LNCS, 2274:115–124. [doi:10.1007/3-540-45664-3_8]

    Google Scholar 

  • Baudron, O., Fouque, P., Pointcheval, D., Stern, J., Poupard, G., 2001. Practical Multi-Candidate Election System. ACM 20th Symp. on Principle of Distributed Computing, p.274–283. [doi:10.1145/383962.384044]

  • Bellare, M., Rogaway, P., 1996. The exact security of digital signatures—how to sign with RSA and Rabin. LNCS, 1070:399–416. [doi:10.1007/3-540-68339-9_34]

    Google Scholar 

  • Boldyreva, A., Palacio, A., Warinschi, B., 2003. Secure Proxy Signature Schemes for Delegation of Signing Rights. Available from http://eprint.iacr.org/2003/096 [Accessed on Jan. 18, 2010].

  • Chang, Y.C., 2004. Single private information retrieval with logarithmic communication. LNCS, 3108:50–61. [doi:10.1007/b98755]

    Google Scholar 

  • Chang, Y.F., Chang, C.C., 2007. An RSA-Based (t, n)threshold proxy signature scheme with free-will identities. Int. J. Inf. Comput. Secur., 1(1/2):201–209. [doi:10.1504/IJICS.2007.012250]

    Article  Google Scholar 

  • ElGamal, T., 1985. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory, IT-31 (4):469–472. [doi:10.1109/TIT.1985.1057074]

    Article  MathSciNet  Google Scholar 

  • Guillou, L.C., Quisquater, J.J., 1988. A ‘paradoxical’ identitybased signature scheme resulting from zero-knowledge. LNCS, 403:216–231. [doi:10.1007/0-387-34799-2]

    MathSciNet  Google Scholar 

  • Hwang, M.S., Lu, J.L., Lin, I.C., 2003. A practical (t, n) threshold proxy signature scheme based on the RSA cryptosystem. IEEE Trans. Knowl. Data Eng., 15(6):1552–1560. [doi:10.1109/TKDE.2003.1245292]

    Article  Google Scholar 

  • Javier, H., German, S., 2004. Revisiting fully distributed proxy signature schemes. LNCS, 3348:356–370. [doi:10.1007/b104579]

    Google Scholar 

  • Jiang, Z.T., Liu, J.W., Wang, Y.M., 2008. Improvement on Paillier-Pointcheval probabilistic public-key encryption scheme. Comput. Eng., 34(3):38–39.

    Google Scholar 

  • Li, F., Ma, J., Li, J.H., 2009. Distributed anonymous data perturbation method for privacy-preserving data mining. J. Zhejiang Univ.-Sci. A, 10(7):952–963. [doi:10.1631/jzus.A0820320]

    Article  MATH  MathSciNet  Google Scholar 

  • Lu, R., Cao, Z., 2004. A Proxy-Protected Signature Scheme Based on Conic. ACM 3rd Int. Conf. on Information Security, p.22–26. [doi:10.1145/1046290.1046296]

  • Lu, R.X., Cao, Z.F., Zhu, H.J., 2005. A robust (k,n)+1 threshold proxy signature scheme based on factoring. Appl. Math. Comput., 166(1):35–45. [doi:10.1016/j.amc.2004.04.104]

    Article  MATH  MathSciNet  Google Scholar 

  • Magkos, E., Maragoudakis, M., Chrissikopoulos, V., Gridzalis, S., 2008. Accuracy in privacy-preserving data mining using the paradigm of cryptographic elections. LNCS, 5262:284–299. [doi:10.1007/978-3-540-87471-3_24]

    Google Scholar 

  • Mambo, M., Usuda, K., Okmamoto, E., 1996. Proxy Signatures for Delegating Signing Operation. Proc. 3rd ACM Conf. on Computer and Communication Security, p.48–57. [doi:10.1145/238168.238185]

  • Paillier, P., 1999. Public-key cryptosystems based on composite degree residuosity classes. LNCS, 1592:223–238. [doi:10.1007/3-540-48910-X_16]

    MathSciNet  Google Scholar 

  • Pointcheval, D., Stern, J., 2000. Security arguments for digital signatures and blind signatures. J. Cryptol., 13(3):361–396. [doi:10.1007/s001450010003]

    Article  MATH  Google Scholar 

  • Rivest, R.L., Shamir, A., Adleman, L.M., 1978. A method for obtaining digital signatures and publickey cryptosystems. Commun. ACM, 21(2):120–126. [doi:10.1145/359340.359342]

    Article  MATH  MathSciNet  Google Scholar 

  • Schdult, J.C.N., Matsuura, K., Paterson, K.G., 2008. Proxy signatures secure against proxy key exposure. LNCS, 4939:344–359. [doi:10.1007/978-3-540-78440-1_9]

    Google Scholar 

  • Schnorr, C.P., 1991. Efficient signature generation by smart card. J. Cryptol., 4(3):161–174. [doi:10.1007/BF00196725]

    Article  MATH  MathSciNet  Google Scholar 

  • Shamir, A., 1979. How to share a secret. Commun. ACM, 22(11):612–613. [doi:10.1145/359168.359176]

    Article  MATH  MathSciNet  Google Scholar 

  • Shoup, V., 2000. Practical threshold signatures. LNCS, 1807:207–220. [doi:10.1007/3-540-45539-6]

    Google Scholar 

  • Shum, K., Wei, V.K., 2002. A Strong Proxy Signature Scheme with Proxy Signer Privacy Protection. 11th IEEE Int. Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, p.55–56. [doi:10.1109/ENABL.2002.1029988]

  • Sun, H.M., Lee, N.Y., Hwang, T., 1999. Threshold proxy signatures. IEE Proc.-Comput. Dig. Techn., 146(5):259–263. [doi:10.1049/ip-cdt:19990647]

    Article  Google Scholar 

  • Sun, X., Li, J.H., Yang, S.T., Chen, G.L., 2008. Non-interactive identity-based threshold signature scheme without random oracles. J. Zhejiang Univ.-Sci. A, 9(6):727–736. [doi:10.1631/jzus.A0720028]

    Article  MATH  Google Scholar 

  • Ting, P.Y., Huang, X.W., 2008. An RSA-based (t;n) threshold proxy signature scheme without any trusted combiner. LNCS, 5222:277–284. [doi:10.1007/978-3-540-85886-7_19]

    Google Scholar 

  • Wang, G., Bao, F., Zhou, J., Deng, R.H., Lin, I.C., 2004. Comments on “A practical (t;n) threshold proxy signature scheme based on the RSA cryptosystem”. IEEE Trans. Knowl. Data Eng., 16(10):1309–1311. [doi:10.1109/TKDE.2004.52]

    Article  Google Scholar 

  • Wang, H.X., Pieprzyk, J., 2003. Efficient one-time proxy signatures. LNCS, 2894:507–522. [doi:10.1007/b94617]

    MathSciNet  Google Scholar 

  • Yi, L., Bai, G., Xiao, G., 2000. Proxy multi-signature scheme: a new type of proxy signature scheme. Electron. Lett., 36(6):527–528. [doi:10.1049/el:20000422]

    Article  Google Scholar 

  • Zhang, N., Wang, S., Zhao, W., 2005. A New Scheme on Privacy-Preserving Data Classification. Proc. ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, p.374–383. [doi:10.1145/1081870.1081913]

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pei-yih Ting.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ting, Py., Huang, Xw., Wu, Jh. et al. A secure threshold Paillier proxy signature scheme. J. Zhejiang Univ. - Sci. C 11, 206–213 (2010). https://doi.org/10.1631/jzus.C0910493

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/jzus.C0910493

Key words

CLC number

Navigation