利用双线性聚集签名实现公平的签名交换方案

A scheme of fair exchange of signatures based on bilinear aggregate signatures

公平的签名交换方案是实现数字合同签署、电子支付等电子商务活动的一项重要技术,它的有效实现一直是人们追求的目标。利用最近Boneh提出的基于双线性聚集签名的签名可验证加密方案,设计了一种公平的签名交换方案。该方案基于双线性群对上计算co-Diffie-Hellman假设,借助双线性映射实现加密可验证性,具有签名长度短、计算简便等优点,可有效提高公平签名交换的实现效率。

The scheme of fair exchange of digital signatures was an important tool to signing digital contracts, e-payment and other electronic commerce actions. Its efficient realization had still been pursued since it appeared. Based on Boneh's bilinear verifiable encrypted signature scheme that assumed the so-called computational co-Diffie-Hellman problem be difficult on the bilinear group pair, a scheme of fair exchange of digital signatures was proposed in this paper. The scheme has the properties of short signature, low computation and verification cost. It can exchange signatures of two parties aided by bilinear mapping very efficiently and fairly.