Welcome to the resource topic for 2009/486
Title:
Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants
Authors: Allison Lewko, Brent Waters
Abstract:In this paper, we generalize Naor and Reingold’s construction of pseudorandom functions under the DDH Assumption to yield a construction of pseudorandom functions under the decisional k-Linear Assumption, for each k\geq 1. The decisional Linear Assumption was first introduced by Boneh, Boyen, and Shacham as an alternative assumption for settings where the DDH problem is easy, such as bilinear groups. This assumption can be generalized to obtain the decisional k-Linear Assumptions. Shacham and Hofheinz and Kiltz showed that the decisional (k+1)-Linear problem is hard for generic groups even when the decisional k-Linear problem is easy. It is thus desirable to have constructions of cryptographic primitives based on the decisional k-Linear Assumption instead of DDH. Not surprisingly, one must pay a small price for added security: as k increases, our constructed functions become slightly less efficient to compute and the key size increases (quadratically in k).
ePrint: https://eprint.iacr.org/2009/486
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .