A Pairing Free Secure Identity-based Aggregate Signature Scheme Under Random Oracle
Abstract
The signature aggregation is efficient for the communication links as the time complexity is independent of n different users. The bilinear pairing requires super-singular elliptic curve groups that have a spacious range of elements. Also, the point multiplication over elliptic curve is less computational cost than the pairings, therefore, the pairing-based schemes expose more computational complexity than schemes that without pairings. This paper introduces a new efficient and secure pairing free signature scheme based on the idea of aggregation. Also, the proposed scheme without pairings offers lower computational cost than other schemes from pairings as it saves 68.69% from computations.
Downloads
Published
06/08/2017
How to Cite
Abouelkheir, E., & Tromp, J. G. (2017). A Pairing Free Secure Identity-based Aggregate Signature Scheme Under Random Oracle. Informatica, 42(2). Retrieved from https://www.informatica.si/index.php/informatica/article/view/1668
Issue
Section
Regular papers
License
Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.
All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.
Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.
