双线性对运算在密码学领域具有广泛的应用,但是双线性对运算也是此类密码协议中最耗计算资源的运算。目前解决该问题的方法之一是将复杂的运算外包给计算能力强大但不可信的服务器。对最近在双服务器模型下提出的双线性对运算外包协议的安全性进行了分析,分析结果表明如果资源受限设备发起的质询消息以明文的方式发送,则这些协议不能提供足够的安全性保障。并且在单服务器模型下提出了一个高效的可验证双线性对运算外包协议,即外包用户可以验证服务器回复消息的正确性。新协议中受限设备只需执行1个G1和G2中的标量加法和1个群GT中的模幂运算,执行效率要优于目前已提出的双线性对运算外包协议。
Bilinear pairing operation has been widely applied in cryptography field, but the computation of bilinear pairings has been considered the most expensive operation in pairing-based eryptographic protocol. One of the ways to solve this problem now is to outsouroe expensive computation to untrusted but powerful servers. The security of some recently proposed pairing delegation algorithms are ana- lyzed in the two-server assumption model, and it is found that if the query messages sent by the source-constrained devices are plalntext, these protocols cannot provide enough security guarantee. Also an efficient verifiable secret pairing outsourcing protocol is put forward in the single server assumption model, and tlie protocol enables the limited device to verify the value received from the server with one scalar addition in (71 and/72 ,and one exponentiation in Gr ,which is much more efficient than the existing protocols.