Abstract. We evaluate constructions for building pseudo-random functions (PRFs) from pseudo-random permutations (PRPs). We present two constructions: a slower construction which pr...
Chris Hall, David Wagner, John Kelsey, Bruce Schne...
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 constructio...
Dan Boneh, Hart William Montgomery, Ananth Raghuna...
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...