Skip to main content

Privacy-Preserving Top-k Query Processing in Distributed Systems

  • Chapter
  • First Online:
Transactions on Large-Scale Data- and Knowledge-Centered Systems XLII

Part of the book series: Lecture Notes in Computer Science ((TLDKS,volume 11860))

  • 316 Accesses

Abstract

We consider a distributed system that stores user sensitive data across multiple nodes. In this context, we address the problem of privacy-preserving top-k query processing. We propose a novel system, called SD-TOPK, which is able to evaluate top-k queries over encrypted distributed data without needing to decrypt the data in the nodes where they are stored. We implemented and evaluated our system over synthetic and real databases. The results show excellent performance for SD-TOPK compared to baseline approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This journal paper is a major extension of [23].

References

  1. Akbarinia, R., Pacitti, E., Valduriez, P.: Best position algorithms for efficient top-k query processing. Inf. Syst. 36(6), 973–989 (2011)

    Article  Google Scholar 

  2. Barhamgi, M., Bandara, A.K., Yu, Y., Belhajjame, K., Nuseibeh, B.: Protecting privacy in the cloud: current practices, future directions. IEEE Comput. 49(2), 68–72 (2016). https://doi.org/10.1109/MC.2016.59

    Article  Google Scholar 

  3. Bast, H., Majumdar, D., Schenkel, R., Theobald, M., Weikum, G.: IO-Top-k: Index-access optimized top-k query processing. In: Proceedings of International Conference on Very Large Databases (VLDB), pp. 475–486 (2006)

    Google Scholar 

  4. Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: Proceedings of ACM PODC, pp. 206–215 (2004)

    Google Scholar 

  5. Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg (2005). https://doi.org/10.1007/11496137_30

    Chapter  Google Scholar 

  6. Choi, S., Ghinita, G., Lim, H., Bertino, E.: Secure kNN query processing in untrusted cloud environments. IEEE TKDE 26(11), 2818–2831 (2014)

    Google Scholar 

  7. Ciceri, E., Fraternali, P., Martinenghi, D., Tagliasacchi, M.: Crowdsourcing for top-k query processing over uncertain data. IEEE TKDE 28(1), 41–53 (2016)

    Google Scholar 

  8. Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering top-k queries using views. In: Proceedings of International Conference on Very Large Databases (VLDB), pp. 451–462 (2006)

    Google Scholar 

  9. Demertzis, I., Papadopoulos, S., Papapetrou, O., Deligiannakis, A., Garofalakis, M.N.: Practical private range search revisited. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, 26 June–01 July 2016, pp. 185–198 (2016)

    Google Scholar 

  10. Ding, X., Liu, P., Jin, H.: Privacy-preserving multi-keyword top-k similarity search over encrypted data. IEEE TDSC 99, 1–14 (2017)

    Google Scholar 

  11. Dylla, M., Miliaraki, I., Theobald, M.: Top-k query processing in probabilistic databases with non-materialized views. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp. 122–133 (2013)

    Google Scholar 

  12. Elmehdwi, Y., Samanthula, B.K., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. In: Proceedings of IEEE ICDE, pp. 664–675 (2014)

    Google Scholar 

  13. Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Proceedings of ACM PODS (2001)

    Google Scholar 

  14. Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4), 614–656 (2003)

    Article  MathSciNet  Google Scholar 

  15. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: ACM STOC, pp. 169–178 (2009)

    Google Scholar 

  16. Gupta, M., Gao, J., Yan, X., Cam, H., Han, J.: Top-k interesting subgraph discovery in information networks. In: IEEE ICDE, pp. 820–831 (2014)

    Google Scholar 

  17. Hore, B., Mehrotra, S., Canim, M., Kantarcioglu, M.: Secure multidimensional range queries over outsourced data. J. VLDB 21(3), 333–358 (2012)

    Article  Google Scholar 

  18. Hore, B., Mehrotra, S., Tsudik, G.: A privacy-preserving index for range queries. In: Proceedings of International Conference on Very Large Databases (VLDB), pp. 720–731 (2004)

    Chapter  Google Scholar 

  19. Khemmarat, S., Gao, L.: Fast top-k path-based relevance query on massive graphs. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp. 316–327 (2014)

    Google Scholar 

  20. Kim, H.-I., Kim, H.-J., Chang, J.-W.: A privacy-preserving top-k query processing algorithm in the cloud computing. In: Bañares, J.Á., Tserpes, K., Altmann, J. (eds.) GECON 2016. LNCS, vol. 10382, pp. 277–292. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61920-0_20

    Chapter  Google Scholar 

  21. Li, R., Liu, A.X., Wang, A.L., Bruhadeshwar, B.: Fast range query processing with strong privacy protection for cloud computing. PVLDB 7(14), 1953–1964 (2014)

    Google Scholar 

  22. Liao, X., Li, J.: Privacy-preserving and secure top-k query in two-tier wireless sensor network. In: Global Communications Conference (GLOBECOM), pp. 335–341 (2012)

    Google Scholar 

  23. Mahboubi, S., Akbarinia, R., Valduriez, P.: Privacy-preserving top-k query processing in distributed systems. In: Aldinucci, M., Padovani, L., Torquati, M. (eds.) Euro-Par 2018. LNCS, vol. 11014, pp. 281–292. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96983-1_20

    Chapter  Google Scholar 

  24. Naveed, M., Kamara, S., Wright, C.V.: Inference attacks on property-preserving encrypted databases. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 644–655. ACM (2015)

    Google Scholar 

  25. Pilourdault, J., Leroy, V., Amer-Yahia, S.: Distributed evaluation of top-k temporal joins. In: ACM SIGMOD, pp. 1027–1039 (2016)

    Google Scholar 

  26. Popa, R.A., Redfield, C.M.S., Zeldovich, N., Balakrishnan, H.: CryptDB: processing queries on an encrypted database. Commun. ACM 55(9), 103–111 (2012)

    Article  Google Scholar 

  27. Sahin, C., Allard, T., Akbarinia, R., Abbadi, A.E., Pacitti, E.: A differentially private index for range query processing in clouds. In: ICDE Conference (2018)

    Google Scholar 

  28. Shen, Z., Cheema, M.A., Lin, X., Zhang, W., Wang, H.: Efficiently monitoring top-k pairs over sliding windows. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp. 798–809 (2012)

    Google Scholar 

  29. Shi, J., Wu, D., Mamoulis, N.: Top-k relevant semantic place retrieval on spatial RDF data. In: ACM SIGMOD, pp. 1977–1990 (2016)

    Google Scholar 

  30. Soliman, M.A., Ilyas, I.F., Chang, K.C.: Top-k query processing in uncertain databases. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp. 896–905 (2007)

    Google Scholar 

  31. Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE S&P, pp. 44–55 (2000)

    Google Scholar 

  32. U, L.H., Mamoulis, N., Berberich, K., Bedathur, S.J.: Durable top-k search in document archives. In: Proceedings of ACM International Conference on Management of Data (SIGMOD), pp. 555–566 (2010)

    Google Scholar 

  33. Vaidya, J., Clifton, C.: Privacy-preserving top-k queries. In: Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, pp. 545–546. IEEE (2005)

    Google Scholar 

  34. Wang, J., Li, G., Deng, D., Zhang, Y., Feng, J.: Two birds with one stone: an efficient hierarchical framework for top-k and threshold-based string similarity search. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp. 519–530 (2015)

    Google Scholar 

  35. Wang, X., Zhang, Y., Zhang, W., Lin, X., Huang, Z.: SKYPE: top-k spatial-keyword publish/subscribe over sliding window. PVLDB 9(7), 588–599 (2016)

    Google Scholar 

  36. Wong, W.K., Cheung, D.W., Kao, B., Mamoulis, N.: Secure kNN computation on encrypted databases. In: ACM SIGMOD, pp. 139–152 (2009)

    Google Scholar 

  37. Xianrui Meng, H.Z., Kollios, G.: Top-k query processing on encrypted databases with strong security guarantees. In: ICDE Conference (2018)

    Google Scholar 

  38. Yang, H., Chung, C., Kim, M.: An efficient top-k query processing framework in mobile sensor networks. Data Knowl. Eng. 102, 78–95 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Reza Akbarinia .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer-Verlag GmbH Germany, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Mahboubi, S., Akbarinia, R., Valduriez, P. (2019). Privacy-Preserving Top-k Query Processing in Distributed Systems. In: Hameurlain, A., Wagner, R. (eds) Transactions on Large-Scale Data- and Knowledge-Centered Systems XLII. Lecture Notes in Computer Science(), vol 11860. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-60531-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-60531-8_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-60530-1

  • Online ISBN: 978-3-662-60531-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics