Advertisement

A Privacy-Preserving Join on Outsourced Database

  • Sha Ma
  • Bo Yang
  • Kangshun Li
  • Feng Xia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7001)

Abstract

Outsourced database provides a solution for data owners who want to delegate the task of answering database queries to service provider. Of essential concern in such framework is data privacy. The data owner may want to keep the database hidden from service provider. Simultaneously, potential clients may desire a mean of privacy-preserving computations on outsourced encrypted database. We present a solution of privacy-preserving join query with computational privacy and low overheads. The primary goal of this paper is to provide a set of security notion for such a system as well as a construction which is secure under the newly introduced security notions.

Keywords

searching on encrypted data join query outsourced database data privacy 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lehner, W., Sattler, K.U.: Database as a Service (DBaaS). In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), March 1-6, pp. 1216–1217. IEEE, Piscataway (2010)CrossRefGoogle Scholar
  2. 2.
    Agrawal, D., El Abbadi, A., Emekci, F., Metwally, A.: Database management as a service: challenges and opportunities. In: IEEE 25th International Conference on Data Engineering, ICDE 2009, USA, March 29-April 2. IEEE, Piscataway (2009)Google Scholar
  3. 3.
    Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection, pp. 1–19. Springer, Heidelberg (2004)zbMATHGoogle Scholar
  4. 4.
    Carbunar, B., Sion, R.: Joining Privately on Outsourced Data. In: Jonker, W., Petković, M. (eds.) SDM 2010. LNCS, vol. 6358, pp. 70–86. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Hacigumus, H., Iyer, B., Li, C., Mehrotra, S.: Executing SQL over encrypted data in the database-service-provider model. In: ACM SIGMOD 2002 Proceedings of the ACM SIGMOD International Conference on Managment of Data, Jun 3-6, pp. 216–227. Association for Computing Machinery, Madison (2002)CrossRefGoogle Scholar
  6. 6.
    Hacıgümüş, H., Iyer, B., Mehrotra, S.: Efficient Execution of Aggregation Queries over Encrypted Relational Databases. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 125–136. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    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, pp. 506–522. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, pp. 44–55. IEEE, Berkeley (2000)Google Scholar
  9. 9.
    Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order preserving encryption for numeric data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 563–574. Association for Computing Machinery, Paris (2004)Google Scholar
  10. 10.
    Boldyreva, A., Chenette, N., Lee, Y., O’Neill, A.: Order-preserving symmetric encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 224–241. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535–554. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402–414. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  13. 13.
    Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 41–50. IEEE Computer Society, Milwaukee (1995)Google Scholar
  14. 14.
    Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)CrossRefzbMATHGoogle Scholar
  16. 16.
    Goh, E.J.: Secure indexes. Cryptology ePrint Archive (2003), http://eprint.iacr.org/2003/216/

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Sha Ma
    • 1
  • Bo Yang
    • 1
  • Kangshun Li
    • 1
  • Feng Xia
    • 1
  1. 1.Department of InformationSouth China Agricultural UniversityGuangzhouChina

Personalised recommendations