Algebraic pseudorandom functions with improved efficiency from the augmented cascade

We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic NaorReingold algebraic PRF. Our PRF is the result of adapting the cascade construction, which is the basis of HMAC, to the algebraic settings. To do so we define an augmented cascade and prove it secure when the underlying PRF satisfies a property called parallel security. We then use the augmented cascade to build new algebraic PRFs. The algebraic structure of our PRF leads to an efficient large-domain Verifiable Random Function (VRF) and a large-domain simulatable VRF.

• Type: Conference
• Year: 2010
• Where: CCS
• Authors: Dan Boneh, Hart William Montgomery, Ananth Raghunathan
• Keywords: Algebraic Prfs, Algebraic Pseudorandom Function, Augmented Cascade, CCS 2010, Security Privacy