A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In predicate encryption, a ciphertext is associated with descriptive attribute values x in addition to a plaintext µ, and a secret key is associated with a predicate f . Decryption returns plaintext µ if and only if f (x) = 1. Moreover, security of predicate encryption guarantees that an adversary learns nothing about the attribute x or the plaintext µ from a ciphertext, given arbitrary many secret keys that are not authorized to decrypt the ciphertext individually. We construct a leveleddoi:10.1007/978-3-662-48000-7_25 fatcat:sfnrzxcwkbafld3m56ib7hhihy