Secure Authentication from a Weak Key, without Leaking Information

We study the problem of authentication based on a weak key in the informationtheoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. This problem has recently received considerable attention, with different solutions optimizing different parameters. We study the problem in an extended setting, where the weak key… CONTINUE READING