摘要：An aggregate signature provides a method for combining n signatures of n different messages from n different signers into one signature of unit length. The main benefit of such schemes is that they allow bandwidth and computational savings. There exist several trials for the construction of ID-based aggregate signature schemes so far. Unfortunately, the computational complexity and (or) signature length of these schemes grow linearly with the number of signers. This paper focuses on the solution of these problems and proposes a new ID-based sequential aggregate signature scheme based on IB-mRSA. It is compatible with RSA and has the fixed signature length. The security analysis shows that it is secure in the random oracle model with the assumption of classical RSA.
