Noninteractive Verifiable Outsourcing Algorithm for Bilinear Pairing with Improved Checkability

Abstract EN

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.