摘要
创新点
双线性对运算是密码学中最昂贵的运算之一, 已有的对运算外包计算方案效率很低或可验证概率不高。 基于两个不可信的服务器, 我们提出了新的双线性对运算外包方案。 用户不需要执行任何复杂度高的运算, 如标量乘、 模乘运算等。 如果服务器返回错误的计算结果, 用户能以概率 1 检测到, 即外包结果能完全验证。 与已有方案相比, 所提方案能同时提高双线性对运算的计算效率和可验证概率。
This is a preview of subscription content, log in via an institution to check access.
References
Chen X F, Li J, Ma J F, et al. New algorithms for secure outsourcing of modular exponentiations. IEEE Trans Paral Distr Syst, 2014, 25: 2386–2396
Chevallier-Mames B, Coron J, McCullagh N, et al. Secure delegation of elliptic-curve pairing. In: Proceedings of 9th IFIPWG 8.8/11.2 International Conference on Smart Card Research and Advanced Application, Passau, 2010. 24–35
Scott M, Costigan N, Abdulwahab W. Implementing cryptographic pairings on smartcards. In: Proceedings of 8th International Workshop on Cryptographic Hardware and Embedded Systems, Yokohama, 2006. 134–147
Galbraith S, Paterson K, Smart N. Pairings for cryptographers. Discret Appl Math, 2008, 156: 3113–3121
Tsang P, Chow S, Smith S. Batch pairing delegation. In: Proceedings of 2nd International Workshop on Security, Nara, 2007. 74–90
Chow S, Au M, Susilo W. Server-aided signatures verification secure against collusion attack. In: Proceedings of 6th ACM Symposium on Information, Computer and Communications Security, Hong Kong, 2011. 401–405
Chen X F, Susilo W, Li J, et al. Efficient algorithms for secure outsourcing of bilinear pairings. Theor Comput Sci, 2015, 562: 112–121
Tian H B, Zhang F G, Ren K. Secure bilinear pairing outsourcing made more efficient and flexible. In: Proceedings of 10th ACM Symposium on Information, Computer and Communications Security, Singapore, 2015. 417–426
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors declare that they have no conflict of interest.
