Prior work on public-key predicate encryption has focused on the notion of plaintext privacy, the property that ciphertexts reveal no information about the encrypted plaintext. In this paper, we consider a new notion called predicate privacy, the property that tokens reveal no information about the encoded query predicate. Predicate privacy is inherently impossible to achieve in the public-key setting and has therefore received little attention in prior work. In this work, we consider predicate encryption in the symmetric-key setting and present a symmetric-key predicate encryption scheme which supports inner product queries. We prove that our scheme achieves both plaintext privacy and predicate privacy.
Category / Keywords: Date: received 20 Dec 2008, last revised 24 Dec 2008 Contact author: bwaters at cs utexas edu Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Note: Elaine Shi (firstname.lastname@example.org) Emily Shen (email@example.com) Version: 20081228:085550 (All versions of this report) Short URL: ia.cr/2008/536 Discussion forum: Show discussion | Start new discussion