A Sponge-Based PRF with Good Multi-user Security

ePrint Report: A Sponge-Based PRF with Good Multi-user Security

Arghya Bhattacharjee, Ritam Bhaumik, Mridul Nandi

Both multi-user PRFs and sponge-based constructions have generated a lot of research interest lately. Dedicated analyses for multi-user security have improved the bounds a long distance from the early generic bounds obtained through hybrid arguments, yet the bounds generally don't allow the number of users to be more than birthday-bound in key-size. Similarly, known sponge constructions suffer from being only birthday-bound secure in terms of …

eprint report security user security