论文信息 - Multilinear Pseudorandom Functions

Multilinear Pseudorandom Functions

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 in [CGV15]. Additionally, multilinear PRFs give a new way of viewing existing algebraic PRF constructions: our main theorem implies they too satisfy aggregate security.

Aloni Cohen | Justin Holmgren

[1] Vinod Vaikuntanathan,et al. Aggregate Pseudorandom Functions and Connections to Learning , 2015, TCC.

[2] Hoeteck Wee,et al. A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes , 2004, APPROX-RANDOM.

[3] Yevgeniy Vahlis,et al. Verifiable Delegation of Computation over Large Datasets , 2011, IACR Cryptol. ePrint Arch..

[4] Oded Goldreich,et al. On the Implementation of Huge Random Objects , 2003, SIAM J. Comput..

[5] Carmit Hazay,et al. Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs , 2015, Journal of Cryptology.

[6] Rafail Ostrovsky,et al. Circular-Secure Encryption from Decision Diffie-Hellman , 2008, CRYPTO.

[7] Moni Naor,et al. Number-theoretic constructions of efficient pseudo-random functions , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.