AN EFFICIENT GROUP-ORIENTED (t,n) THRESHOLD SIGNATURE SCHEME WITH MESSAGE LINKAGE

摘要

In 1999, Chen (1999) proposed several signature schemes in his graduate thesis. One is a group-oriented (t,n) threshold signature scheme in which the (t,n) threshold signature is based on an RSA scheme. Although it has advantages, including message recovery, lower cost for transmission, and message linkage, it requires a great amount of time for the modulo exponentiation computation. In this article, we propose an improved scheme, which is more efficient than the one proposed by Chen both in the signature generation and the verification.