The authors study the problem of authentication based on a weak key in the information-theoretic 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. The authors study the problem ...Download Now
Submit Your Content
Get your content listed in our directory for free!
Our directory is the largest library of vendor-supplied technical content on the web. It's also the first place IT decision makers turn to when researching technology solutions. Our members are already finding your competitors' papers here - shouldn't they find yours too?