arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.06453cs.CRcs.CCcs.DS
收藏

基于标准假设的保性质哈希函数

Property-Preserving Hash Functions from Standard Assumptions

Nils Fleischhacker, Kasper Green Larsen, and Mark Simkin

摘要:

属性保持散列函数允许以允许仅给定两个散列值而无需访问原始数据来计算谓词$P(x_0, x_1)$的方式将长输入$x_0$和$x_1$压缩成短散列$h(x_0)$和$h(x_1)$。如果在散列函数已被采样之后开始挑选$x_0$和$x_1$的对手不能找到在散列值上评估的谓词输出不正确结果的输入,则这样的散列函数被称为对抗鲁棒的。在这项工作中,我们构建了强大的属性保持哈希函数的汉明距离谓词区分输入的汉明距离至少有一些阈值$t$从那些距离小于$t$。结构的安全性是基于标准的晶格硬度假设。我们的结构比Fleischhacker和Simkin以前最著名的结构有几个优点。我们的建设依赖于一个单一的研究从格密码学的硬度假设,而以前的工作依赖于一个新引入的家庭的计算硬度假设。就计算量而言,我们的构造仅需要每个输入位进行少量的模加法,而之前需要每个位进行多次取幂以及在大场上对高次多项式进行插值和求值。我们的构造的另一个好处是,哈希函数的描述可以被压缩到$λ$位,假设是随机预言。先前的工作描述了输入位长度$\ell$的长度$\mathcal{O}(\ell λ)$位,其具有秘密结构,因此不能被压缩。我们证明了一个下界的输出大小的任何属性保持哈希函数的汉明距离谓词。这个界限表明我们的哈希值的大小离最佳值不远了。

英文摘要:

Property-preserving hash functions allow for compressing long inputs $x_0$ and $x_1$ into short hashes $h(x_0)$ and $h(x_1)$ in a manner that allows for computing a predicate $P(x_0, x_1)$ given only the two hash values without having access to the original data. Such hash functions are said to be adversarially robust if an adversary that gets to pick $x_0$ and $x_1$ after the hash function has been sampled, cannot find inputs for which the predicate evaluated on the hash values outputs the incorrect result. In this work we construct robust property-preserving hash functions for the hamming-distance predicate which distinguishes inputs with a hamming distance at least some threshold $t$ from those with distance less than $t$. The security of the construction is based on standard lattice hardness assumptions. Our construction has several advantages over the best known previous construction by Fleischhacker and Simkin. Our construction relies on a single well-studied hardness assumption from lattice cryptography whereas the previous work relied on a newly introduced family of computational hardness assumptions. In terms of computational effort, our construction only requires a small number of modular additions per input bit, whereas previously several exponentiations per bit as well as the interpolation and evaluation of high-degree polynomials over large fields were required. An additional benefit of our construction is that the description of the hash function can be compressed to $λ$ bits assuming a random oracle. Previous work has descriptions of length $\mathcal{O}(\ell λ)$ bits for input bit-length $\ell$, which has a secret structure and thus cannot be compressed. We prove a lower bound on the output size of any property-preserving hash function for the hamming distance predicate. The bound shows that the size of our hash value is not far from optimal.

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

↑