Predicate Privacy in Encryption Systems

  • Emily Shen
  • Elaine Shi
  • Brent Waters
Conference paper

DOI: 10.1007/978-3-642-00457-5_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5444)
Cite this paper as:
Shen E., Shi E., Waters B. (2009) Predicate Privacy in Encryption Systems. In: Reingold O. (eds) Theory of Cryptography. TCC 2009. Lecture Notes in Computer Science, vol 5444. Springer, Berlin, Heidelberg


Predicate encryption is a new encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data. The master secret key owner can generate secret key tokens corresponding to predicates. An encryption of data x can be evaluated using a secret token corresponding to a predicate f; the user learns whether the data satisfies the predicate, i.e., whether f(x) = 1.

Prior work on public-key predicate encryption has focused on the notion of data or plaintext privacy, the property that ciphertexts reveal no information about the encrypted data to an attacker other than what is inherently revealed by the tokens the attacker possesses. 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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Emily Shen
    • 1
  • Elaine Shi
    • 2
  • Brent Waters
    • 3
  1. 1.MIT 
  2. 2.CMU/PARC 
  3. 3.UT Austin 

Personalised recommendations