{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T06:18:06Z","timestamp":1789625886340,"version":"build-2803163510"},"publisher-location":"New York, New York, USA","reference-count":23,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3216122.3216153","type":"proceedings-article","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T16:26:42Z","timestamp":1531240002000},"page":"208-216","source":"Crossref","is-referenced-by-count":4,"title":["Top-k Query Processing over Distributed Sensitive Data"],"prefix":"10.1145","author":[{"given":"Sakina","family":"Mahboubi","sequence":"first","affiliation":[{"name":"INRIA & LIRMM, Montpellier FRANCE"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reza","family":"Akbarinia","sequence":"additional","affiliation":[{"name":"INRIA & LIRMM, Montpellier FRANCE"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Valduriez","sequence":"additional","affiliation":[{"name":"INRIA & LIRMM, Montpellier, FRANCE"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","reference":[{"key":"key-10.1145\/3216122.3216153-1","doi-asserted-by":"crossref","unstructured":"P. Cao and Z. Wang. Efficient top-k query calculation in distributed networks. In PODC Conf., pages 206--215, 2004.","DOI":"10.1145\/1011767.1011798"},{"key":"key-10.1145\/3216122.3216153-2","doi-asserted-by":"crossref","unstructured":"Y. Chang and M. Mitzenmacher. Privacy preserving keyword searches on remote encrypted data. In Applied Cryptography and Network Security (ACNS), pages 442--455, 2005.","DOI":"10.1007\/11496137_30"},{"key":"key-10.1145\/3216122.3216153-3","doi-asserted-by":"crossref","unstructured":"S. Choi, G. Ghinita, H. Lim, and E. Bertino. Secure knn query processing in untrusted cloud environments. IEEE TKDE, 26(11):2818--2831, 2014.","DOI":"10.1109\/TKDE.2014.2302434"},{"key":"key-10.1145\/3216122.3216153-4","unstructured":"X. Ding, P. Liu, and H. Jin. Privacy-preserving multi-keyword top-k similarity search over encrypted data. IEEE TDSC, (99):1--14, 2017."},{"key":"key-10.1145\/3216122.3216153-5","doi-asserted-by":"crossref","unstructured":"Y. Elmehdwi, B. K. Samanthula, and W. Jiang. Secure k-nearest neighbor query over encrypted data in outsourced environments. In Proc. of IEEE ICDE, pages 664--675, 2014.","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"key-10.1145\/3216122.3216153-6","doi-asserted-by":"crossref","unstructured":"R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614--656, 2003.","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"key-10.1145\/3216122.3216153-7","doi-asserted-by":"crossref","unstructured":"C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages 169--178, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"key-10.1145\/3216122.3216153-8","doi-asserted-by":"crossref","unstructured":"B. Hore, S. Mehrotra, M. Canim, and M. Kantarcioglu. Secure multidimensional range queries over outsourced data. VLDB J., 21(3):333--358, 2012.","DOI":"10.1007\/s00778-011-0245-7"},{"key":"key-10.1145\/3216122.3216153-9","doi-asserted-by":"crossref","unstructured":"B. Hore, S. Mehrotra, and G. Tsudik. A privacy-preserving index for range queries. In VLDB Conf., pages 720--731, 2004.","DOI":"10.1016\/B978-012088469-8.50064-4"},{"key":"key-10.1145\/3216122.3216153-10","doi-asserted-by":"crossref","unstructured":"H. Kim, H. Kim, and J. Chang. A privacy-preserving top-k query processing algorithm in the cloud computing. In GECON, pages 277--292, 2017.","DOI":"10.1007\/978-3-319-61920-0_20"},{"key":"key-10.1145\/3216122.3216153-11","doi-asserted-by":"crossref","unstructured":"R. Li, A. X. Liu, A. L. Wang, and B. Bruhadeshwar. Fast range query processing with strong privacy protection for cloud computing. PVLDB, 7(14):1953--1964, 2014.","DOI":"10.14778\/2733085.2733100"},{"key":"key-10.1145\/3216122.3216153-12","doi-asserted-by":"crossref","unstructured":"X. Liao and J. Li. Privacy-preserving and secure top-k query in two-tier wireless sensor network. In Global Communications Conference (GLOBECOM), pages 335--341, 2012.","DOI":"10.1109\/GLOCOM.2012.6503135"},{"key":"key-10.1145\/3216122.3216153-13","doi-asserted-by":"crossref","unstructured":"J. Pilourdault, V. Leroy, and S. Amer-Yahia. Distributed evaluation of top-k temporal joins. In SIGMOD Conf., pages 1027--1039, 2016.","DOI":"10.1145\/2882903.2882912"},{"key":"key-10.1145\/3216122.3216153-14","doi-asserted-by":"crossref","unstructured":"R. A. Popa, C. M. S. Redfield, N. Zeldovich, and H. Balakrishnan. Cryptdb: processing queries on an encrypted database. Commun. ACM, 55(9):103--111, 2012.","DOI":"10.1145\/2330667.2330691"},{"key":"key-10.1145\/3216122.3216153-15","doi-asserted-by":"crossref","unstructured":"C. Sahin, T. Allard, R. Akbarinia, A. E. Abbadi, and E. Pacitti. A differentially private index for range query processing in clouds. In ICDE Conf., 2018.","DOI":"10.1109\/ICDE.2018.00082"},{"key":"key-10.1145\/3216122.3216153-16","doi-asserted-by":"crossref","unstructured":"J. Shi, D. Wu, and N. Mamoulis. Top-k relevant semantic place retrieval on spatial RDF data. In SIGMOD Conf., pages 1977--1990, 2016.","DOI":"10.1145\/2882903.2882941"},{"key":"key-10.1145\/3216122.3216153-17","unstructured":"D. X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy, pages 44--55, 2000."},{"key":"key-10.1145\/3216122.3216153-18","doi-asserted-by":"crossref","unstructured":"J. Vaidya and C. Clifton. Privacy-preserving top-k queries. In Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on, pages 545--546. IEEE, 2005.","DOI":"10.1109\/ICDE.2005.112"},{"key":"key-10.1145\/3216122.3216153-19","doi-asserted-by":"crossref","unstructured":"X. Wang, Y. Zhang, W. Zhang, X. Lin, and Z. Huang. SKYPE: top-k spatial-keyword publish\/subscribe over sliding window. PVLDB, 9(7):588--599, 2016.","DOI":"10.14778\/2904483.2904490"},{"key":"key-10.1145\/3216122.3216153-20","doi-asserted-by":"crossref","unstructured":"W. K. Wong, D. W. Cheung, B. Kao, and N. Mamoulis. Secure knn computation on encrypted databases. In SIGMOD Conf., pages 139--152, 2009.","DOI":"10.1145\/1559845.1559862"},{"key":"key-10.1145\/3216122.3216153-21","unstructured":"H. Z. Xianrui Meng and G. Kollios. Top-k query processing on encrypted databases with strong security guarantees. In ICDE Conf., 2018."},{"key":"key-10.1145\/3216122.3216153-22","doi-asserted-by":"crossref","unstructured":"H. Yang, C. Chung, and M. H. Kim. An efficient top-k query processing framework in mobile sensor networks. Data Knowl. Eng., 102:78--95, 2016.","DOI":"10.1016\/j.datak.2016.02.001"},{"key":"key-10.1145\/3216122.3216153-23","doi-asserted-by":"crossref","unstructured":"X. Zhang, G. Li, and J. Feng. Crowdsourced top-k algorithms: An experimental evaluation. PVLDB, 9(8):612--623, 2016.","DOI":"10.14778\/2921558.2921559"}],"event":{"name":"the 22nd International Database Engineering & Applications Symposium","location":"Villa San Giovanni, Italy","acronym":"IDEAS 2018","number":"22","sponsor":["Concordia University"],"start":{"date-parts":[[2018,6,18]]},"end":{"date-parts":[[2018,6,20]]}},"container-title":["Proceedings of the 22nd International Database Engineering &amp; Applications Symposium on - IDEAS 2018"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3216122.3216153","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3216153&ftid=1986350&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T17:51:52Z","timestamp":1751737912000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3216122.3216153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1145\/3216122.3216153","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}