More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
复制标题
通过双通用哈希函数以更少的随机种子实现更有效的隐私放大
DOI：
--
复制
发表时间：
--
期刊：
影响因子：
--
通讯作者：
Raimundo Carmona Puertac
中科院分区：
文献类型：
--
作者：
Elibet Chávez Gonzáleza;E. González;Rodríguezb;Raimundo Carmona Puertac
我们显式地为隐私放大（提取器）构建随机哈希函数，它需要比以前的文献更小的随机种子长度，并且对于输入长度为n的输入，仍然允许复杂度为O （n log n）的有效实现。其核心思想是最近引入的对偶全称2哈希函数的概念。我们还使用了一种新的构造提取器的方法，即将δ -几乎对偶通用2哈希函数与其他提取器连接起来。除了最小化种子长度，我们还介绍了允许使用非均匀随机种子提取器的方法。这些方法可以应用于广泛的提取器，包括对偶通用2哈希函数，以及常规通用2哈希函数。
We explicitly construct random hash functions for privacy amplification (extractors) that require smaller random seed lengths than the previous literature, and still allow efficient implementations with complexity O ( n log n ) for input length n . The key idea is the concept of dual universal 2 hash function introduced recently. We also use a new method for constructing extractors by concatenating δ -almost dual universal 2 hash functions with other extractors. Besides minimizing seed lengths, we also introduce methods that allow one to use non-uniform random seeds for extractors. These methods can be applied to a wide class of extractors, including dual universal 2 hash function, as well as to conventional universal 2 hash functions.