New algorithms for verifiable outsourcing of bilinear pairings

摘要创新点双线性对运算是密码学中最昂贵的运算之一, 已有的对运算外包计算方案效率很低或可验证概率不高。 基于两个不可信的服务器, 我们提出了新的双线性对运算外包方案。 用户不需要执行任何复杂度高的运算, 如标量乘、 模乘运算等。 如果服务器返回错误的计算结果, 用户能以概率 1 检测到, 即外包结果能完全验证。 与已有方案相比, 所提方案能同时提高双线性对运算的计算效率和可验证概率。

[1]  Michael Scott,et al.  Implementing Cryptographic Pairings on Smartcards , 2006, CHES.

[2]  Fangguo Zhang,et al.  Secure Bilinear Pairing Outsourcing Made More Efficient and Flexible , 2015, AsiaCCS.

[3]  David Naccache,et al.  Secure Delegation of Elliptic-Curve Pairing , 2010, IACR Cryptol. ePrint Arch..

[4]  Kenneth G. Paterson,et al.  Pairings for Cryptographers , 2008, IACR Cryptol. ePrint Arch..

[5]  Sean W. Smith,et al.  Batch Pairing Delegation , 2007, IWSEC.

[6]  Willy Susilo,et al.  Server-aided signatures verification secure against collusion attack , 2011, ASIACCS '11.

[7]  Jianfeng Ma,et al.  Efficient algorithms for secure outsourcing of bilinear pairings , 2015, Theor. Comput. Sci..

[8]  Jianfeng Ma,et al.  New Algorithms for Secure Outsourcing of Modular Exponentiations , 2012, IEEE Transactions on Parallel and Distributed Systems.

[9]  Jianfeng Ma,et al.  New Algorithms for Secure Outsourcing of Modular Exponentiations , 2014, IEEE Trans. Parallel Distributed Syst..