Back to Results
First PageMeta Content
Pseudorandomness / Computational hardness assumptions / Pseudorandom number generators / Algorithmic information theory / Pseudorandom generator / Naor-Reingold Pseudorandom Function / Decisional Diffie–Hellman assumption / Pseudorandom function family / Randomized algorithm / Cryptography / Theoretical computer science / Applied mathematics


Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants Allison B. Lewko ∗ University of Texas at Austin
Add to Reading List

Document Date: 2009-10-16 13:57:22

Open Document

File Size: 192,85 KB

Share Result on Facebook

City

Evaluation(x / /

Facility

University of Texas / /

IndustryTerm

probabilistic polynomial time algorithms / cryptographic primitives and systems / index calculus algorithm / baby-step giant-step algorithm / probabilistic algorithm / cryptographic systems / polynomial time algorithm / /

Organization

Air Force office of Scientific Research / University of Texas at Austin / National Science Foundation / /

Person

Rabin / Ai / Bt / Allison B. Lewko / Brent Waters / /

ProvinceOrState

Texas / /

Technology

cryptography / private key / simulation / polynomial time algorithm / index calculus algorithm / ElGamal encryption / probabilistic polynomial time algorithms / baby-step giant-step algorithm / Evaluation algorithm / probabilistic algorithm / key-exchange protocol / Setup algorithm / public key encryption / /

SocialTag