Journal
THEORETICAL COMPUTER SCIENCE
Volume 562, Issue -, Pages 112-121Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2014.09.038
Keywords
Cloud computing; Outsource-secure algorithms; Bilinear pairings; Untrusted program model
Categories
Funding
- National Natural Science Foundation of China [61272455, 61100224]
- China 111 Project [B08038]
- Doctoral Fund of Ministry of Education of the People's Republic of China [20130203110004]
- Program for New Century Excellent Talents in University [NCET-13-0946]
- Fundamental Research Funds for the Central Universities [BDY151402]
- Australian Research Council Future Fellowship [FT0991397]
- Australian Research Council Discovery Project [DP130101383]
Ask authors/readers for more resources
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, a distinguishing 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. (C) 2014 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available