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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Chaum, D., Pedersen, T.: Wallet Databases with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)
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)
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)
Goldreich, O.: Foundations of cryptography - a primer. Foundations and Trends in Theoretical Computer Science 1(1), 1–116 (2005)
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)
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)
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)
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)
Rivest, R.L., Kaliski, B.: RSA Problem (2003), theory.lcs.mit.edu/~rivest/RivestKaliski-RSAProblem.pdf
Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)
Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–220. Springer, Heidelberg (2000)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ting, Py., Huang, XW. (2008). An RSA-Based (t,n) Threshold Proxy Signature Scheme without Any Trusted Combiner. In: Wu, TC., Lei, CL., Rijmen, V., Lee, DT. (eds) Information Security. ISC 2008. Lecture Notes in Computer Science, vol 5222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85886-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-85886-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85884-3
Online ISBN: 978-3-540-85886-7
eBook Packages: Computer ScienceComputer Science (R0)