Welcome to the resource topic for 2015/324
Title:
A Note on Lower Bounds for Non-interactive Message Authentication Using Weak Keys
Authors: Divesh Aggarwal, Alexander Golovnev
Abstract:In this note, we prove lower bounds on the amount of entropy of random sources necessary for secure message authentication. We consider the problem of non-interactive c-time message authentication using a weak secret key having min-entropy k. We show that existing constructions using (c+1)-wise independent hash functions are optimal. This result resolves one of the main questions left open by the work of Dodis and Spencer [DS02] who considered this problem for one-time message authentication of one-bit messages.
ePrint: https://eprint.iacr.org/2015/324
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .