Efficient pseudorandom functions from the decisional linear assumption and weaker variants

13 years 8 months ago

Download eprint.iacr.org

In this paper, we generalize Naor and Reingold's construction of pseudorandom functions under the DDH Assumption to yield a construction of pseudorandom

Allison B. Lewko, Brent Waters

Real-time Traffic

CCS 2009 | Pseudorandom Functions | Reingold's Construction | Security Privacy |

claim paper

» PublicKey Cryptosystems Resilient to Key Leakage

» An Update on the Analysis and Design of NMAC and HMAC Functions

» Efficient and Provably Secure TrapdoorFree Group Signature Schemes from Bilinear Pairings

» Towards a Theory of Extractable Functions

» NearOptimal Conversion of Hardness into PseudoRandomness

» Plaintext Simulatability

» Learning distance function by coding similarity

Post Info
More Details (n/a)

Added	12 Aug 2010
Updated	12 Aug 2010
Type	Conference
Year	2009
Where	CCS
Authors	Allison B. Lewko, Brent Waters

Comments (0)

Sciweavers

Efficient pseudorandom functions from the decisional linear assumption and weaker variants

CCS 2009 | Pseudorandom Functions | Reingold's Construction | Security Privacy |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers