Efficient algorithms for secure outsourcing of bilinear pairings
Efficient algorithms for secure outsourcing of bilinear pairings
复制标题
DOI：
10.1016/j.tcs.2014.09.038
复制
发表时间：
2015-01
期刊：
影响因子：
--
通讯作者：
Xiaofeng Chen;W. Susilo;Jin Li;D. Wong;Jianfeng Ma;Shaohua Tang;Qiang Tang
中科院分区：
文献类型：
--
作者：
Xiaofeng Chen;W. Susilo;Jin Li;D. Wong;Jianfeng Ma;Shaohua Tang;Qiang Tang
双线性对的计算一直被认为是基于对的密码协议中最昂贵的操作。本文首先针对两个不可信规划模型中的双线性配对，提出了一种高效、安全的外包算法。与最先进的算法相比，我们提出的算法的一个显著特性是（资源受限的）外包者不需要执行任何昂贵的操作，例如点乘法或幂运算。此外，我们利用该算法作为子例程来实现外包安全的基于身份的加密和签名。
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.