## CryptoDB

### Paper: Efficient and Provably Secure Identity Based Aggregate Signature Schemes With Partial and Full Aggregation

Authors: S.Sharmila Deva Selvi S.Sree Vivek J.Shriram C.Pandu Rangan URL: http://eprint.iacr.org/2010/461 Search ePrint Search Google An identity based signature allows users to sign their documents using their private keys and the signature can be verified by any user by using the identity of the signer and public parameters of the system. This allows secure communication between the users without any exchange of certificates. An aggregate signature scheme is a digital signature scheme which allows aggregation of different signatures by different users on different messages. An aggregate signature on $n$ messages $m_{i}$ by $n$ users $U_{i}$ convinces the verifier that each user $U_{i}$ has signed the corresponding message $m_{i}$. The primary objective of the aggregate signature scheme is to achieve both computational and communication efficiency. Here we discuss two identity based aggregate signature schemes. The first aggregate scheme IBAS-1 uses a variation of light weight Schnorr based signature. IBAS-1 does not involve any pairing operations in signature verification. IBAS-1 is computationally efficient since it avoids the costlier operation in elliptic curve groups(pairings). Also because of the light weight property of IBAS-1, it is much suitable for practice. The second aggregate signature scheme IBAS-2, which also has Schnorr type key construct, achieves full aggregation of signatures without agreeing on common randomness and without having any kind of interaction among all the signers. IBAS-2 achieves communication efficiency. But the computational complexity of IBAS-2 is higher than the IBAS-1 because it involves bilinear pairing.
##### BibTeX
@misc{eprint-2010-23362,
title={Efficient and Provably Secure Identity Based Aggregate Signature Schemes With Partial and Full Aggregation},
booktitle={IACR Eprint archive},
keywords={Identity Based Signature, Aggregate Signature, Random Oracle Model, Provable Security.},
url={http://eprint.iacr.org/2010/461},
note={ sharmioshin@gmail.com,ssreevivek@gmail.com 14848 received 27 Aug 2010, last revised 27 Aug 2010},
author={S.Sharmila Deva Selvi and S.Sree Vivek and J.Shriram and C.Pandu Rangan},
year=2010
}