Accumulable optimistic fair exchange from verifiably encrypted homomorphic signatures
Accumulable optimistic fair exchange from verifiably encrypted homomorphic signatures
复制标题
DOI：
10.1007/s10207-017-0367-z
复制
发表时间：
2015-06
影响因子：
3.2
通讯作者：
Jae Hong Seo;K. Emura;Keita Xagawa;Kazuki Yoneyama
中科院分区：
文献类型：
--
作者：
Jae Hong Seo;K. Emura;Keita Xagawa;Kazuki Yoneyama
让我们考虑客户（Alice）频繁地从商店（Bob）购买某种产品的情况（例如，在线音乐服务以相同的价格销售单个歌曲，并且客户在一个月内多次购买歌曲）。在这种情况下，Alice和Bob希望汇总总交易并每月支付一次，因为单独支付很麻烦。虽然乐观公平交换（OFE）已被认为是为了交换电子项目同时，已知的OFE协议不能有效地提供这样的聚集功能，因为各种成本的范围内的交易数量的时期。为了有效地运行这个聚合过程，我们引入了一种新的OFE，称为可累积OFE（AOFE），允许客户有效地累积每个期间的付款。在AOFE中，支付回合的任何内存成本、计算成本和通信复杂度都必须在交易数量方面保持恒定。由于客户端通常仅具有低功率和差的存储器设备，因此这些效率在实践中是期望的。目前，已知的方法（例如，基于可验证加密签名方案）对于构造AOFE不是很成功。因此，我们考虑一个新的方法的基础上，一个新的密码原语称为可验证加密同态签名方案（VEHS）。在本文中，我们提出了一个通用的AOFE从VEHS的结构，并提出了一个具体的VEHS方案在一个复合阶双线性群使用的双重形式的签名技术。这个VEHS计划也是独立的利益。由于我们可以在没有随机预言机的情况下证明VEHS的安全性，因此我们的AOFE协议在没有随机预言机的情况下也是安全的。最后，我们实现了我们的AOFE协议，它是足够有效的实际应用。
Let us consider a situation where a client (Alice) frequently buys a certain kind of product from a shop (Bob) (e.g., an online music service sells individual songs at the same price, and a client buys songs multiple times in a month). In this situation, Alice and Bob would like to aggregate the total transactions and pay once per month because individual payments are troublesome. Though optimistic fair exchange (OFE) has been considered in order to swap electronic items simultaneously, known OFE protocols cannot provide such aggregate function efficiently because various costs are bounded by the number of transactions in the period. In order to run this aggregation procedure efficiently, we introduce a new kind of OFE called accumulable OFE (AOFE) that allows clients to efficiently accumulate payments in each period. In AOFE, any memory costs, computational costs, and communication complexity of the payment round must be constant in terms of the number of transactions. Since a client usually has just a low power and poor memory device, these efficiencies are desirable in practice. Currently, known approaches (e.g., based on verifiably encrypted signature scheme) are not very successful for constructing AOFE. Thus, we consider a new approach based on a new cryptographic primitive called verifiably encrypted homomorphic signature scheme (VEHS). In this paper, we propose a generic construction of AOFE from VEHS and also present a concrete VEHS scheme over a composite-order bilinear group by using the dual-form signature techniques. This VEHS scheme is also of independent interest. Since we can prove the security of VEHS without random oracles, our AOFE protocol is also secure without random oracles. Finally, we implemented our AOFE protocol, and it is efficient enough for practical use.