Attribute Based Sequential Aggregate Signature

Abstract

Attribute based signature (ABS) scheme is an important cryptographic primitive which provides a powerful way for user to control their privacy. However, the computational and storage cost of ABS is reasonable when the number of users involved in the system is huge. In order to reduce the bandwidth needed to transmit attribute based signatures and the time needed to verify them, we propose attribute based sequential aggregate signature (ABSAS) scheme. The ABSAS scheme allows a set of players to sign the different messages compress into a short signature which can greatly decrease the store space. In this paper, we also formalize ABSAS scheme and prove the security of this scheme in the standard model. The analysis shows that our ABSAS scheme has less signature length and need less verify computation than the traditional ABS which is more appropriate for the actual situation, especially where bandwidth is a bottleneck.

Certificateless Ordered Sequential Aggregate Signature Scheme

“…Aggregate signature scheme by Boneh et al [4] is a suitable tool for such a situation. Especially, an aggregate signature scheme which verifies both of the validity of the document and the signing order for a group of signers is called ordered sequential aggregate signature scheme [15] and many such schemes have been proposed so far [3], [6], [7], [11], [12], [13], [15], [16], [17], [18], [20], [22], [23], [25], [26]. On the other hand, certificateless public key cryptosystems, which was firstly introduced by Al-Riyami and Paterson [1] in 2003, have come into limelight in recent years.…”

“…Among them, the schemes achieving the full aggregation are in [3], [7], [12], [13], [15], [17], [19] and [25]. However, the schemes in [12], [15] and [17] has no order flexibility, and the scheme in [13] is based on M-LRSW problem [3] which has been shown to be false in [10]. In addition, the schemes in [3], [7] and [25] are PKI-based scheme and the scheme in [20] is ID-based scheme.…”