Multilinear Pseudorandom Functions

Aloni Cohen; Justin Holmgren

Paper 2015/125

Multilinear Pseudorandom Functions

Aloni Cohen and Justin Holmgren

Abstract

We define the new notion of a multilinear pseudorandom function (PRF), and give a construction with a proof of security assuming the hardness of the decisional Diffie-Hellman problem. A direct application of our construction yields (non-multilinear) PRFs with aggregate security from the same assumption, resolving an open question of Cohen, Goldwasser, and Vaikuntanathan. Additionally, multilinear PRFs give a new way of viewing existing algebraic PRF constructions: our main theorem implies they too satisfy aggregate security.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint. MINOR revision.
Keywords: pseudo-random functions decisional Diffie-Hellman algebraic PRFs
Contact author(s): holmgren @ mit edu
History: 2015-02-26: received
Short URL: https://ia.cr/2015/125
License: CC BY

BibTeX

@misc{cryptoeprint:2015/125,
      author = {Aloni Cohen and Justin Holmgren},
      title = {Multilinear Pseudorandom Functions},
      howpublished = {Cryptology ePrint Archive, Paper 2015/125},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/125}},
      url = {https://eprint.iacr.org/2015/125}
}