Threshold signature cryptography scheme in wireless ad-hoc computing

Abstract

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. © 2009 Springer Berlin Heidelberg.