Sciweavers

4 search results - page 1 / 1
» Building PRFs from PRPs
Sort
View
CRYPTO
1998
Springer
137views Cryptology» more  CRYPTO 1998»
14 years 3 months ago
Building PRFs from PRPs
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...
CCS
2010
ACM
13 years 11 months ago
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 constructio...
Dan Boneh, Hart William Montgomery, Ananth Raghuna...
TIT
2010
130views Education» more  TIT 2010»
13 years 5 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
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...
Palash Sarkar
ASIACRYPT
2008
Springer
14 years 26 days ago
Compact Proofs of Retrievability
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...
Hovav Shacham, Brent Waters