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

  • Authors:
  • Pei-Yih Ting;Xiao-Wei Huang

  • Affiliations:
  • Department of Computer Science and Engineering, National Taiwan Ocean University, Taiwan, R.O.C.;Department of Computer Science and Engineering, National Taiwan Ocean University, Taiwan, R.O.C. and Institute of Information Science, Academia Sinica, Taiwan, R.O.C.

  • Venue:
  • ISC '08 Proceedings of the 11th international conference on Information Security
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.