Abstract
Recently some efforts were made towards capturing the security requirements within the composable security framework. This modeling has some significant advantages in designing and analyzing complex systems. The threshold signature was discussed and a definition was given based on the universal composability framework, which is proved to be equivalent to the standard security definition. Furthermore, a simple, efficient and proactive threshold RSA signature protocol was presented. It is proved to be correct, consistent and unforgeable relative to the environment that at most t − 1 parties are corrupted in each proactive stage. It is also secure under the universal composability framework. It is a UC based security and is proved to be equivalent to the standard security.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Shoup V. Practical threshold signatures [C]// EUROCRYPT 2000. LNCS, Berlin: Springer-Verlag, 2000: 207–220.
Ostrovsky R, Yung M. How to withstand mobile virus attack [C]//Proceeding of the 10th ACM Symposium on Principles of Distributed Computing. [s.l.]: ACM, 1991: 51–59.
Frankel Y, Gemmell P, MacKenzie P D, et al. Practive RSA [C]//CRYPTO 97. Berlin: Springer-Verlag, 1997, 440–454.
Frankel Y, MacKenzie P D, Yung M. Adaptive security for the additive-sharing based proactive RSA [C]//PKC’ 01. LNCS, Berlin: Springer-Verlag, 2001: 240–263.
Almansa J, Damgard I, Nielsen J. Simplified threshold RSA with adaptive and proactive security [C]//EUROCRYPT 2006, LNCS. Berlin: Springer-Verlag, 2006: 593–611.
Canetti R. Universally composable security: A new paradigm for cryptographic protocols [C]//Proceedings of the 42th IEEE Symposium on Foundations of Computer Science, New York: IEEE Computer Society Press, 2001: 136–145.
Canetti R, Rabin T. Universal Composition with Joint State [C]//Crypto 2003, LNCS. Berlin: Springer-Verlag, 2003: 265–281.
Canetti R, Gennaro R, Jarecki S, et al. Adaptive security for threshold cryptosystems [C]// CRYPTO 1999, LNCS. Berlin: Springer-Verlag, 1999: 98–115.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: the National Natural Science Foundation of China (Nos. 60573030, 90704004); the National Basic Research Program (973) of China (No. 2007CB311201)
Rights and permissions
About this article
Cite this article
Hong, X., Chen, Kf. & Long, Y. Universally composable proactive threshold RSA signature. J. Shanghai Jiaotong Univ. (Sci.) 13, 659–663 (2008). https://doi.org/10.1007/s12204-008-0659-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12204-008-0659-6