New Efficient and Flexible Algorithms for Secure Outsourcing of Bilinear Pairings

Xi-Jun Lin; Haipeng Qu; Xiaoshuai Zhang

Paper 2016/076 Original: eprint.iacr.org/2016/076 ↗

New Efficient and Flexible Algorithms for Secure Outsourcing of Bilinear Pairings

Xi-Jun Lin

Haipeng Qu

Xiaoshuai Zhang

Abstract

Outsourcing paradigm has become a hot research topic in the cryptography community, where computation workloads can be outsourced to cloud servers by the resource-constrained devices, such as RFID tags. The computation of bilinear pairings is the most expensive operation in pairing-based cryptographic primitives. In this paper, we present two new algorithms for secure outsourcing the computation of bilinear pairings. One is secure in the OMTUP model. The other, which provides flexible checkability, is in the TUP model. Compared with the state-of-the-art algorithms, our proposal is more efficient.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2016-01-28: last updated; 2016-01-28: published
Short URL: https://ia.cr/2016/076
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2016/076,
      author = {Xi-Jun Lin and Haipeng Qu and Xiaoshuai Zhang},
      title = {New Efficient and Flexible Algorithms for Secure Outsourcing of Bilinear Pairings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/076},
      year = {2016},
      url = {https://eprint.iacr.org/2016/076}
}