zbMATH — the first resource for mathematics

A universal composability framework for analysis of proxy threshold signature. (English) Zbl 1214.94065
Summary: The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols. In this framework, the security of protocols is maintained under a general protocol composition operation. In this paper, we propose the universal composability framework for the analysis of proxy threshold signature and present a universally composable secure proxy threshold signature scheme which is the first one in this area. The proposed scheme is suitable for the mobile agents which should migrate across different environment through the network. Furthermore, we give the concrete analysis of the reduction to prove the security of the proposed scheme.
94A62 Authentication, digital signatures and secret sharing
Full Text: DOI
[1] Zhang K. Threshold proxy signature schemes [C]//Proceeding of the 1997 information security workshop. Heidelberg: Springer, 1998: 191–197.
[2] Kim S, Park S, Won D. Proxy signatures, revisited [C]// ICICS’97, LNCS. Heidelberg: Springer, 1997: 223–232. · Zbl 0890.68049
[3] Sun H, Lee N, Hwang T. Threshold proxy signatures [C]//IEE Proceeding of Computers and Digital technique/ New York: IEEE Computer Society Press, 1999: 259–263.
[4] Hsu C, Wu T, Wong D. New nonrepudiable threshold proxy signature scheme with known signers [J]. Journal of Systems and Software, 2001, 58(1): 119–124. · Zbl 05433024 · doi:10.1016/S0164-1212(01)00032-2
[5] Hwang M, Lu J, Lin L. A practical (t, n) threshold proxy signature scheme based on the RSA Cryptosystem [C]//ACISP 2004, LNCS. Heidelberg: Springer, 2004: 348–357.
[6] Wang G, Bao G, Zhou J, et al. Comments on a practical threshold proxy signature scheme based on the RSA cryptosystem [J]. IEEE Transaction on Knowledge and Data Engineering, 2004: 16(10): 1309–1311. · Zbl 05110034 · doi:10.1109/TKDE.2004.52
[7] Kuo W, Chen M. A modified (t, n) threshold proxy signature scheme based on the RSA cryptosystem [C]//ICITA’05. New York: IEEE Computer Society Press, 2005: 576–579.
[8] Farmer W, Gutmann J, Swarup V. Security for mobile agents: Authentication and state appraisal [C]//ESoRICS 1996, LNCS. Heidelberg: Springer, 1996: 118–130.
[9] 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.
[10] Canetti R, Rabin T. Universal composition with joint state [C]//Crypto 2003, LNCS. Heidelberg: Springer, 2003: 265–281. · Zbl 1122.94360
[11] Canetti R. Universally composable signature, certification, and authentication [C]//Proceedings of the 17th IEEE workshop on Computer Security Foundations. New York: IEEE Computer Society Press, 2004: 112–116
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.