Threshold Signature Cryptography Scheme in Wireless Ad-Hoc Computing
Identity-based systems have the property that a user’s public key can be easily calculated from his identity by a publicly available function. The bilinear pairings, especially Tate pairings, have high performance in cryptography. With the foundation of above two properties, we have proposed a new ID-Based (t, n) threshold signature scheme from Tate pairings. The scheme is proved secure that it can resist attacks including plaintext attack, recovery equation attack, conspiracy attack and impersonation attack. Furthermore, performance analysis shows that the proposed scheme is simple, efficient so that it will be suitable for an environment of finite bandwidth and low capability equipment.
KeywordsThreshold signature identity-based Tate pairing
Unable to display preview. Download preview PDF.
- 5.Desmedt, Y., Frankel, Y.: Shared Generation of Authenticators and Signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457–469. Springer, Heidelberg (1992)Google Scholar
- 7.Baek, J., Zheng, Y.L.: Identity-Based Threshold Signature Scheme from the Bilinear Pairings. In: ITCC 2004, pp. 124–128. IEEE Computer Society, Los Alamitos (2004)Google Scholar
- 9.Cheng, X.G., Liu, J.M., Wang, X.M.: An Identity-Based Signature and Its Threshold Version. In: Advanced Information Networking and Applications-AINA 2005, pp. 973–977. IEEE Computer Society, Los Alamitos (2005)Google Scholar
- 12.Lee, N.Y.: The security of the improvement on the generalization of threshold signature and authenticated encryption. IEICE Transactions on Fundamentals E85-A(10), 2364–2367 (2002)Google Scholar