Paper 2015/960 Original: eprint.iacr.org/2015/960 ↗

More Efficient Secure Outsourcing Methods for Bilinear Maps

Öznur Arabacı
Mehmet Sabir Kiraz
İsa Sertkaya
Osmanbey Uzunkol
Abstract

Bilinear maps are popular cryptographic primitives which have been commonly used in various modern cryptographic protocols. However, the cost of computation for bilinear maps is expensive because of their realization using variants of Weil and Tate pairings of elliptic curves. Due to increasing availability of cloud computing services, devices with limited computational resources can outsource this heavy computation to more powerful external servers. Currently, the checkability probability of the most efficient outsourcing algorithm is $1/2$ and the overall computation requires $4$ point addition in the preimage and $3$ multiplications in the image of the bilinear map under the one-malicious version of a two-untrusted-program model. In this paper, we propose two efficient new algorithms which decrease not only the memory requirement but also the overall communication overhead.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2015-10-05: last updated
2015-10-05: published
Short URL
https://ia.cr/2015/960
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2015/960,
      author = {Öznur Arabacı and Mehmet Sabir Kiraz and İsa Sertkaya and Osmanbey Uzunkol},
      title = {More Efficient Secure Outsourcing Methods for Bilinear Maps},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/960},
      year = {2015},
      url = {https://eprint.iacr.org/2015/960}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.