Bilinear Entropy Expansion from the Decisional Linear Assumption [chapter]

Lucas Kowalczyk, Allison Bishop Lewko
2015 Lecture Notes in Computer Science  
We develop a technique inspired by pseudorandom functions that allows us to increase the entropy available for proving the security of dual system encryption schemes under the Decisional Linear Assumption. We show an application of the tool to Attribute-Based Encryption by presenting a Key-Policy ABE scheme that is fully-secure under DLIN with short public parameters. * Allison Lewko is supported in part by NSF CNS 1413971 and NSF CCF 1423306. 1. The shares belonging to all attributes form a vector over Z p .
doi:10.1007/978-3-662-48000-7_26 fatcat:dijuxpucubb37gejlab6ah3wtu