Secure Bilinear Pairing Outsourcing Made More Efficient and Flexible
Secure Bilinear Pairing Outsourcing Made More Efficient and Flexible
复制标题
DOI：
10.1145/2714576.2714615
复制
发表时间：
2015-04
期刊：
影响因子：
--
通讯作者：
Haibo Tian;Fangguo Zhang;K. Ren
中科院分区：
文献类型：
--
作者：
Haibo Tian;Fangguo Zhang;K. Ren
随着云计算可用性的不断提高，越来越多的移动设备可以将昂贵的计算外包出去。在这些计算中，双线性对是非常基本的，也是许多现代密码协议经常使用的。目前，最有效的双线性对外包算法在两个不可信程序假设的一个恶意版本下，在G1和G2中需要大约5点加法，在GT中需要大约4次乘法。该算法的结果是可检验的，概率约为1/2。本文提出了两种新的双线性对外包算法，改进了现有的算法。一种是在相同假设下，具有相同可检查性的更有效的外包算法。另一种在两个不可信程序的假设下更灵活，具有更好的可检查性。这两种算法都更适合于在线计算由于缺乏可用的计算资源而受到严格限制的各种应用。
The increasing availability of cloud computing allows more and more mobile devices to outsource expensive computations. Among these computations, bilinear pairing is very fundamental and frequently-used by many modern cryptographic protocols. Currently, the most efficient outsourcing algorithm of bilinear pairings requires about 5 point additions in G1 and G2 and 4 multiplications in GT under the one-malicious version of a two-untrusted-program assumption. And the result of the algorithm is checkable with a probability about 1/2. In this paper, we improve the state-of-the-art by proposing two new outsourcing algorithms for bilinear pairings. One is a more efficient outsourcing algorithm under the same assumption with the same checkability. The other is more flexible under a two-untrusted-program assumption with improved checkability. Both algorithms are better suited to various applications where on-line computations are strictly limited due to the lack of available computing resources.