Idioma:

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

Hayashi, Masahito ; Tsurumaru, Toyohiro

IEEE transactions on information theory, 2016-04, Vol.62 (4), p.2213-2232 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function
Autor: Hayashi, Masahito ; Tsurumaru, Toyohiro
Assuntos: Computational complexity ; Cryptography ; Entropy ; Generators ; Information theory ; Mathematical functions ; minimum entropy ; Privacy ; privacy amplification ; quantum cryptography ; universal hash function
É parte de: IEEE transactions on information theory, 2016-04, Vol.62 (4), p.2213-2232
Descrição: 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 the conventional universal 2 hash functions.
Editor: New York: IEEE
Idioma: Inglês

Voltar para lista de resultados