arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.06502cs.CR
收藏

椭圆曲线多集哈希

Elliptic Curve Multiset Hash

Jeremy Maitin-Shepard, Mehdi Tibouchi, Diego Aranha

摘要:

一个同态或增量的多集哈希函数,将一个哈希值与任意的对象集合(可能有重复)相关联,使得两个集合的并集的哈希值很容易从两个集合本身的哈希值计算出来:它只是它们在一个合适的组运算下的总和。特别地,可以递增地和/或并行地计算大集合的散列值。因此,同态散列是一个非常有用的原语,其应用范围从数据库完整性验证到流集/多集比较和网络编码。不幸的是,文献中同态散列函数的构造受到两个主要缺点的阻碍:它们往往比相同安全级别的普通散列函数长得多(例如,为了实现2^128的抗冲突性,它们的长度为几千位,而普通散列函数的长度为256位),并且它们也相当慢。在本文中,我们介绍了椭圆曲线多集哈希(ECMH),它结合了一个常见的位串值哈希函数,如BLAKE 2与一个有效的编码到二进制椭圆曲线,以克服这两个困难。一方面,ECMH哈希表的大小本质上是最优的:2 m位哈希值提供O(2^m)的抗冲突性。另一方面,我们展示了一个高效的软件实现ECMH,我们彻底的实证评估表明,能够处理超过300万集元素每秒4 GHz的英特尔Haswell机在128位安全级别-许多倍的速度比以前的实际方法。

英文摘要:

A homomorphic, or incremental, multiset hash function, associates a hash value to arbitrary collections of objects (with possible repetitions) in such a way that the hash of the union of two collections is easy to compute from the hashes of the two collections themselves: it is simply their sum under a suitable group operation. In particular, hash values of large collections can be computed incrementally and/or in parallel. Homomorphic hashing is thus a very useful primitive with applications ranging from database integrity verification to streaming set/multiset comparison and network coding. Unfortunately, constructions of homomorphic hash functions in the literature are hampered by two main drawbacks: they tend to be much longer than usual hash functions at the same security level (e.g. to achieve a collision resistance of 2^128, they are several thousand bits long, as opposed to 256 bits for usual hash functions), and they are also quite slow. In this paper, we introduce the Elliptic Curve Multiset Hash (ECMH), which combines a usual bit string-valued hash function like BLAKE2 with an efficient encoding into binary elliptic curves to overcome both difficulties. On the one hand, the size of ECMH digests is essentially optimal: 2m-bit hash values provide O(2^m) collision resistance. On the other hand, we demonstrate a highly-efficient software implementation of ECMH, which our thorough empirical evaluation shows to be capable of processing over 3 million set elements per second on a 4 GHz Intel Haswell machine at the 128-bit security level---many times faster than previous practical methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑