More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
This work addresses the need for more efficient and resource-saving privacy amplification methods in cryptography, though it appears incremental as it builds on existing concepts like dual universal2 hash functions.
The paper tackles the problem of privacy amplification by constructing random hash functions that require smaller random seed lengths than prior work while maintaining efficient O(n log n) complexity for input length n, using dual universal2 hash functions and a concatenation method with other extractors.
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.