Paper 2016/142 Original: eprint.iacr.org/2016/142 ↗

Hash-Function based PRFs: AMAC and its Multi-User Security

Mihir Bellare
Daniel J. Bernstein
Stefano Tessaro
Abstract

AMAC is a simple and fast candidate construction of a PRF from an MD-style hash function which applies the keyed hash function and then a cheap, un-keyed output transform such as truncation. Spurred by its use in the widely-deployed Ed25519 signature scheme, this paper investigates the provable PRF security of AMAC to deliver the following three-fold message: (1) First, we prove PRF security of AMAC (2) Second, we show that AMAC has a quite unique and attractive feature, namely that its multi-user security is essentially as good as its single-user security and in particular superior in some settings to that of competitors. (3) Third, it is technically interesting, its security and analysis intrinsically linked to security of the compression function in the presence of leakage.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
History
2016-03-01: last updated
2016-02-16: published
Short URL
https://ia.cr/2016/142
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2016/142,
      author = {Mihir Bellare and Daniel J.  Bernstein and Stefano Tessaro},
      title = {Hash-Function based PRFs: AMAC and its Multi-User Security},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/142},
      year = {2016},
      url = {https://eprint.iacr.org/2016/142}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.