Article (Scientific journals)
Efficient Algorithms for Secure Outsourcing of Bilinear Pairings
Chen, Xiaofeng; Susilo, Willy; Li, Jin et al.
2014In Theoretical Computer Science
Peer reviewed


Full Text
Efficient algorithms for secure outsourcing of bilinear pairings.pdf
Publisher postprint (672.93 kB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to


Keywords :
bilinear pairing; outsourcing; provable security
Abstract :
[en] The computation of bilinear pairings has been considered the most expensive operation in pairing-based cryptographic protocols. In this paper, we first propose an efficient and secure outsourcing algorithm for bilinear pairings in the two untrusted program model. Compared with the state-of-the-art algorithm, adistinguishing property of our proposed algorithm is that the (resource-constrained) outsourcer is not required to perform any expensive operations, such as point multiplications or exponentiations. Furthermore, we utilize this algorithm as a subroutine to achieve outsource-secure identity-based encryptions and signatures.
Research center :
Disciplines :
Computer science
Author, co-author :
Chen, Xiaofeng;  Xidian university
Susilo, Willy;  Wollongong university
Li, Jin;  Guangzhou university
Wong, Duncan;  City University of Hong Kong
Ma, Jianfeng;  Xidian university
Tang, Shaohua;  South China University of Technology
Tang, Qiang ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Language :
Title :
Efficient Algorithms for Secure Outsourcing of Bilinear Pairings
Publication date :
Journal title :
Theoretical Computer Science
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 18 November 2014


Number of views
91 (1 by Unilu)
Number of downloads
0 (0 by Unilu)

Scopus citations®
Scopus citations®
without self-citations
WoS citations


Similar publications

Contact ORBilu