More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function

Masahito Hayashi; Toyohiro Tsurumaru

doi:10.1109/TIT.2016.2526018

paper

More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function

arXiv:1311.5322 · doi:10.1109/TIT.2016.2526018

Abstract

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 lo g 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.

33 pages, no figure, 1 table; v3: revised arguments with new hash functions proposed additionally, v4: minor corrections and clarifications, some new references added, v5: minor corrections, and enhanced arguments related with applications

More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function

Abstract

References in corpus (6)

Cited by in corpus (24)