Abstract: Universal hashing is a standard tool for extending keyed functions on fixed-length inputs to variable-length messages, notably in message authentication. It can provide efficient compression with information-theoretic bounds on collision probabilities.
This talk presents the key-then-hash approach to constructing universal hash functions from public functions. We will first consider constructions based on public permutations and explain how their concrete properties yield universality guarantees without relying on an ideal-permutation model. We will then generalize these techniques to non-invertible public functions, examining which properties are needed to preserve these guarantees.
Il seminario si svolgerà in presenza presso il Dipartimento di Matematica e Fisica, Largo San Leonardo Murialdo, 1 - Edificio C - Aula C006
Link identifier #identifier__184847-1Locandina
This post is also available in:
Link identifier #identifier__36783-5
Eng