Title
Noninteractive Verifiable Outsourcing Algorithm for Bilinear Pairing with Improved Checkability.
Abstract
It is well known that the computation of bilinear pairing is the most expensive operation in pairing-based cryptography. In this paper, we propose a noninteractive verifiable outsourcing algorithm of bilinear pairing based on two servers in the one-malicious model. The outsourcer need not execute any expensive operation, such as scalar multiplication and modular exponentiation. Moreover, the outsourcer could detect any failure with a probability close to 1 if one of the servers misbehaves. Therefore, the proposed algorithm improves checkability and decreases communication cost compared with the previous ones. Finally, we utilize the proposed algorithm as a subroutine to achieve an anonymous identity-based encryption (AIBE) scheme with outsourced decryption and an identity-based signature (IBS) scheme with outsourced verification.
Year
DOI
Venue
2017
10.1155/2017/4892814
SECURITY AND COMMUNICATION NETWORKS
Field
DocType
Volume
Scalar multiplication,Computer security,Computer science,Cryptography,Server,Outsourcing,Encryption,Theoretical computer science,Verifiable secret sharing,Distributed computing,Algorithm,Pairing,Modular exponentiation
Journal
2017
ISSN
Citations 
PageRank 
1939-0114
1
0.41
References 
Authors
10
4
Name
Order
Citations
PageRank
Yanli Ren124724.83
Min Dong290689.34
Zhihua Niu311.09
Xiaoni Du4317.84