Advertisement

Conjunctive, Subset, and Range Queries on Encrypted Data

  • Dan Boneh
  • Brent Waters
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4392)

Abstract

We construct public-key systems that support comparison queries (x ≥ a) on encrypted data as well as more general queries such as subset queries (x ∈ S). Furthermore, these systems support arbitrary conjunctive queries (P 1 ∧ ⋯ ∧ P ) without leaking information on individual conjuncts. We present a general framework for constructing and analyzing public-key systems supporting queries on encrypted data.

Keywords

Range Query Encrypt Data Message Space Mail Server Equality Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., Shi, H.: Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 205–222. Springer, Heidelberg (2005)Google Scholar
  2. 2.
    Bellare, M., Boldyreva, A., O’Neill, A.: Efficiently-searchable and deterministic asymmetric encryption (2006), http://eprint.iacr.org/2006/186
  3. 3.
    Bethencourt, J., Chan, H., Perrig, A., Shi, E., Song, D.: Anonymous multi-attribute encryption with range query and conditional decryption. Technical report, C.M.U, CMU-CS-06-135 (2006)Google Scholar
  4. 4.
    Bethencourt, J., Song, D., Waters, B.: New constructions and practical applications for private stream searching. In: Proceeding of 2006 IEEE Symposium on Security and Privacy, IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  5. 5.
    Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13, 422–426 (1970)zbMATHCrossRefGoogle Scholar
  6. 6.
    Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC, pp. 103–112 (1988)Google Scholar
  7. 7.
    Blum, M., De Santis, A., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM J. Comput. 20(6), 1084–1118 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, Springer, Heidelberg (2004)Google Scholar
  9. 9.
    Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-dnf formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–342. Springer, Heidelberg (2005)Google Scholar
  10. 10.
    Boneh, D., Sahai, A., Waters, B.: Fully collusion resistant traitor tracing with short ciphertexts and private keys. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. Cryptology ePrint Archive, Report, 2006/287 (2006), http://eprint.iacr.org/
  12. 12.
    Boneh, D., Waters, B.: A fully collusion resistant broadcast trace and revoke system with public traceability. In: ACM Conference on Computer and Communication Security (CCS), ACM Press, New York (2006)Google Scholar
  13. 13.
    Boyen, X., Waters, B.: Anonymous hierarchical identity-based encryption (without random oracles). In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  14. 14.
    Goldreich, O., Ostrovsky, R.: Software protection and simulation by oblivious rams. JACM (1996)Google Scholar
  15. 15.
    Golle, P., Staddon, J., Waters, B.R.: Secure conjunctive keyword search over encrypted data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol. 3089, pp. 31–45. Springer, Heidelberg (2004)Google Scholar
  16. 16.
    Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: FOCS, pp. 364–373 (1997)Google Scholar
  17. 17.
    Ostrovsky, R.: Software protection and simulation on oblivious RAMs. PhD thesis, M.I.T, 1992. Preliminary version in STOC (1990)Google Scholar
  18. 18.
    Ostrovsky, R., Skeith, W.: Private searching on streaming data. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, Springer, Heidelberg (2005)Google Scholar
  19. 19.
    Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of the 2000 IEEE symposium on Security and Privacy (S&P 2000), IEEE Computer Society Press, Los Alamitos (2000)Google Scholar
  20. 20.
    Waters, B., Balfanz, D., Durfee, G., Smetters, D.: Building an encrypted and searchabe audit log. In: Proceedings of NDSS ’04 (2004)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Dan Boneh
    • 1
  • Brent Waters
    • 2
  1. 1.Stanford University 
  2. 2.SRI International 

Personalised recommendations