{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T19:44:52Z","timestamp":1768592692501,"version":"3.49.0"},"publisher-location":"New York, New York, USA","reference-count":49,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["IIS-1528041"],"award-info":[{"award-number":["IIS-1528041"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186084","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"1725-1734","source":"Crossref","is-referenced-by-count":3,"title":["Privacy and Efficiency Tradeoffs for Multiword Top<i>K<\/i>Search with Linear Additive Rank Scoring"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Agun","sequence":"first","affiliation":[{"name":"University of California at Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinjin","family":"Shao","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyu","family":"Ji","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Yang","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186084-1","doi-asserted-by":"crossref","unstructured":"E. Agichtein, E. Brill, S. Dumais, and R. Ragno. Learning user interaction models for predicting web search result preferences. In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '06, pages 3--10, New York, NY, USA, 2006. ACM.","DOI":"10.1145\/1148170.1148175"},{"key":"key-10.1145\/3178876.3186084-2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Order-preserving encryption for numeric data. In SIGMOD 2004, pages 563--574, 2004.","DOI":"10.1145\/1007568.1007632"},{"key":"key-10.1145\/3178876.3186084-3","unstructured":"Akamai.com. Akamai's State of the Internet. Q1 2017 Executive Summary, 2017."},{"key":"key-10.1145\/3178876.3186084-4","doi-asserted-by":"crossref","unstructured":"A. Arampatzis, G. Drosatos, and P. S. Efraimidis. Versatile query scrambling for private web search. Information Retrieval Journal, 18(4):331--358, 2015.","DOI":"10.1007\/s10791-015-9256-0"},{"key":"key-10.1145\/3178876.3186084-5","doi-asserted-by":"crossref","unstructured":"A. Arampatzis, P. Efraimidis, and G. Drosatos. Enhancing deniability against query-logs. In European Conference on Information Retrieval, pages 117--128. Springer, 2011.","DOI":"10.1007\/978-3-642-20161-5_13"},{"key":"key-10.1145\/3178876.3186084-6","unstructured":"L. T. I. at Carnegie Mellon University. The clueweb09 dataset, http:\/\/boston.lti.cs.cmu.edu\/data\/clueweb09."},{"key":"key-10.1145\/3178876.3186084-7","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval (2nd Edition). Addison Wesley, 2011."},{"key":"key-10.1145\/3178876.3186084-8","doi-asserted-by":"crossref","unstructured":"J. Bai, Y. Chang, H. Cui, Z. Zheng, G. Sun, and X. Li. Investigation of partial query proximity in web search. WWW '08, pages 1183--1184, 2008.","DOI":"10.1145\/1367497.1367717"},{"key":"key-10.1145\/3178876.3186084-9","doi-asserted-by":"crossref","unstructured":"A. Boldyreva, N. Chenette, Y. Lee, and A. O'Neill. Order-preserving symmetric encryption. EUROCRYPT '09, pages 224--241, 2009.","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"key-10.1145\/3178876.3186084-10","doi-asserted-by":"crossref","unstructured":"D. Boneh. The decision diffie-hellman problem. Algorithmic number theory, pages 48--63, 1998.","DOI":"10.1007\/BFb0054851"},{"key":"key-10.1145\/3178876.3186084-11","doi-asserted-by":"crossref","unstructured":"L. Boytsov and A. Belova. Evaluating learning-to-rank methods in the web track adhoc task. In TREC, 2011.","DOI":"10.6028\/NIST.SP.500-296.web-srchvrs"},{"key":"key-10.1145\/3178876.3186084-12","doi-asserted-by":"crossref","unstructured":"S. B&#252;ttcher, C. L. A. Clarke, and B. Lushman. Term proximity scoring for ad-hoc retrieval on very large text collections. SIGIR '06, pages 621--622. ACM.","DOI":"10.1145\/1148170.1148285"},{"key":"key-10.1145\/3178876.3186084-13","doi-asserted-by":"crossref","unstructured":"N. Cao, C. Wang, M. Li, K. Ren, and W. Lou. Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst., 25(1):222--233, 2014.","DOI":"10.1109\/TPDS.2013.45"},{"key":"key-10.1145\/3178876.3186084-14","doi-asserted-by":"crossref","unstructured":"B. Carterette, V. Pavlu, H. Fang, and E. Kanoulas. Million query track 2009 overview. In TREC, 2009.","DOI":"10.6028\/NIST.SP.500-278.million-query-overview"},{"key":"key-10.1145\/3178876.3186084-15","doi-asserted-by":"crossref","unstructured":"D. Cash, P. Grubbs, J. Perry, and T. Ristenpart. Leakage-abuse attacks against searchable encryption. In CCS'15, pages 668--679. ACM, 2015.","DOI":"10.1145\/2810103.2813700"},{"key":"key-10.1145\/3178876.3186084-16","doi-asserted-by":"crossref","unstructured":"D. Cash, J. Jaeger, S. Jarecki, C. S. Jutla, H. Krawczyk, M. Rosu, and M. Steiner. Dynamic searchable encryption in very-large databases: Data structures and implementation. In NDSS 2014, 2014.","DOI":"10.14722\/ndss.2014.23264"},{"key":"key-10.1145\/3178876.3186084-17","doi-asserted-by":"crossref","unstructured":"D. Cash, S. Jarecki, C. S. Jutla, H. Krawczyk, M. Rosu, and M. Steiner. Highly-scalable searchable symmetric encryption with support for boolean queries. In CRYPTO 2013, pages 353--373, 2013.","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"key-10.1145\/3178876.3186084-18","doi-asserted-by":"crossref","unstructured":"D. Cash and S. Tessaro. The locality of searchable symmetric encryption. In EUROCRYPT 2014, pages 351--368, 2014.","DOI":"10.1007\/978-3-642-55220-5_20"},{"key":"key-10.1145\/3178876.3186084-19","doi-asserted-by":"crossref","unstructured":"J. S. Culpepper and A. Moffat. Efficient set intersection for inverted indexing. ACM Trans. Inf. Syst., 29(1):1:1--1:25, Dec. 2010.","DOI":"10.1145\/1877766.1877767"},{"key":"key-10.1145\/3178876.3186084-20","doi-asserted-by":"crossref","unstructured":"R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky. Searchable symmetric encryption: Improved definitions and efficient constructions. CCS '06, pages 79--88. ACM, 2006.","DOI":"10.1145\/1180405.1180417"},{"key":"key-10.1145\/3178876.3186084-21","doi-asserted-by":"crossref","unstructured":"T. Elsayed, N. Asadi, L. Wang, J. J. Lin, and D. Metzler. UMD and USC\/ISI: TREC 2010 web track experiments with ivory. In Proceedings of The Nineteenth Text REtrieval Conference, TREC 2010, Gaithersburg, Maryland, USA, 2010.","DOI":"10.6028\/NIST.SP.500-294.web-UMD"},{"key":"key-10.1145\/3178876.3186084-22","doi-asserted-by":"crossref","unstructured":"C. Gentry. A Fully Homomorphic Encryption Scheme. PhD thesis, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"key-10.1145\/3178876.3186084-23","doi-asserted-by":"crossref","unstructured":"O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious rams. J. ACM, 43(3):431--473, May 1996.","DOI":"10.1145\/233551.233553"},{"key":"key-10.1145\/3178876.3186084-24","doi-asserted-by":"crossref","unstructured":"J. Guo, Y. Fan, Q. Ai, and W. B. Croft. A deep relevance matching model for ad-hoc retrieval. In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, CIKM '16, pages 55--64, New York, NY, USA, 2016. ACM.","DOI":"10.1145\/2983323.2983769"},{"key":"key-10.1145\/3178876.3186084-25","doi-asserted-by":"crossref","unstructured":"H. Hu, J. Xu, C. Ren, and B. Choi. Processing private queries over untrusted data cloud through privacy homomorphism. In ICDE, pages 601--612, 2011.","DOI":"10.1109\/ICDE.2011.5767862"},{"key":"key-10.1145\/3178876.3186084-26","unstructured":"M. S. Islam, M. Kuzu, and M. Kantarcioglu. Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In NDSS 2012, 2012."},{"key":"key-10.1145\/3178876.3186084-27","doi-asserted-by":"crossref","unstructured":"K. S. Jones, S. Walker, and S. E. Robertson. A probabilistic model of information retrieval: development and comparative experiments. Inf. Process. Manage., 36(6):779--808, Nov. 2000.","DOI":"10.1016\/S0306-4573(00)00015-7"},{"key":"key-10.1145\/3178876.3186084-28","doi-asserted-by":"crossref","unstructured":"S. Kamara and T. Moataz. Boolean searchable symmetric encryption with worst-case sub-linear complexity. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 94--124. Springer, 2017.","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"key-10.1145\/3178876.3186084-29","doi-asserted-by":"crossref","unstructured":"S. Kamara and C. Papamanthou. Parallel and dynamic searchable symmetric encryption. In FC 2013, pages 258--274, 2013.","DOI":"10.1007\/978-3-642-39884-1_22"},{"key":"key-10.1145\/3178876.3186084-30","doi-asserted-by":"crossref","unstructured":"S. Kamara, C. Papamanthou, and T. Roeder. Dynamic searchable symmetric encryption. In CCS'12, pages 965--976, 2012.","DOI":"10.1145\/2382196.2382298"},{"key":"key-10.1145\/3178876.3186084-31","doi-asserted-by":"crossref","unstructured":"M. Naveed, M. Prabhakaran, and C. A. Gunter. Dynamic searchable encryption via blind storage. SP '14, pages 639--654. IEEE Computer Society, 2014.","DOI":"10.1109\/SP.2014.47"},{"key":"key-10.1145\/3178876.3186084-32","doi-asserted-by":"crossref","unstructured":"C. &#214;rencik and E. Savas. An efficient privacy-preserving multi-keyword search over encrypted cloud data with ranking. Distributed and Parallel Databases, 32(1):119--160, 2014.","DOI":"10.1007\/s10619-013-7123-9"},{"key":"key-10.1145\/3178876.3186084-33","doi-asserted-by":"crossref","unstructured":"P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT '99, pages 223--238, 1999.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"key-10.1145\/3178876.3186084-34","doi-asserted-by":"crossref","unstructured":"R. A. Popa, F. H. Li, and N. Zeldovich. An ideal-security protocol for order-preserving encoding. SP '13, pages 463--477. IEEE Computer Society, 2013.","DOI":"10.1109\/SP.2013.38"},{"key":"key-10.1145\/3178876.3186084-35","doi-asserted-by":"crossref","unstructured":"R. A. Popa, C. M. S. Redfield, N. Zeldovich, and H. Balakrishnan. Cryptdb: Protecting confidentiality with encrypted query processing. SOSP '11, pages 85--100. ACM, 2011.","DOI":"10.1145\/2043556.2043566"},{"key":"key-10.1145\/3178876.3186084-36","doi-asserted-by":"crossref","unstructured":"D. Pouliot and C. V. Wright. The shadow nemesis: Inference attacks on efficiently deployable, efficiently searchable encryption. In CCS'16, pages 1341--1352. ACM, 2016.","DOI":"10.1145\/2976749.2978401"},{"key":"key-10.1145\/3178876.3186084-37","unstructured":"C. Project. The enron email dataset, https:\/\/www.cs.cmu.edu\/ enron\/."},{"key":"key-10.1145\/3178876.3186084-38","unstructured":"D. X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. SP '00. IEEE Computer Society, 2000."},{"key":"key-10.1145\/3178876.3186084-39","unstructured":"E. Stefanov, E. Shi, and D. X. Song. Towards practical oblivious RAM. In NDSS 2012, 2012."},{"key":"key-10.1145\/3178876.3186084-40","doi-asserted-by":"crossref","unstructured":"W. Sun, B. Wang, N. Cao, M. Li, W. Lou, Y. T. Hou, and H. Li. Verifiable privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking. IEEE Trans. Parallel Distrib. Syst., 25(11):3025--3035, 2014.","DOI":"10.1109\/TPDS.2013.282"},{"key":"key-10.1145\/3178876.3186084-41","doi-asserted-by":"crossref","unstructured":"K. M. Svore, P. H. Kanani, and N. Khan. How good is a span of terms?: exploiting proximity to improve web retrieval. SIGIR '10, pages 154--161. ACM, 2010.","DOI":"10.1145\/1835449.1835477"},{"key":"key-10.1145\/3178876.3186084-42","doi-asserted-by":"crossref","unstructured":"T. Tao and C. Zhai. An exploration of proximity measures in information retrieval. SIGIR '07, pages 295--302. ACM, 2007.","DOI":"10.1145\/1277741.1277794"},{"key":"key-10.1145\/3178876.3186084-43","doi-asserted-by":"crossref","unstructured":"L. Wang, J. Lin, and D. Metzler. A cascade ranking model for efficient ranked retrieval. In Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '11, pages 105--114, New York, NY, USA, 2011. ACM.","DOI":"10.1145\/2009916.2009934"},{"key":"key-10.1145\/3178876.3186084-44","doi-asserted-by":"crossref","unstructured":"Q. Wu, C. J. Burges, K. M. Svore, and J. Gao. Adapting boosting for information retrieval measures. Inf. Retr., 13(3):254--270, June 2010.","DOI":"10.1007\/s10791-009-9112-1"},{"key":"key-10.1145\/3178876.3186084-45","doi-asserted-by":"crossref","unstructured":"Z. Xia, X. Wang, X. Sun, and Q. Wang. A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst., 27(2):340--352, 2016.","DOI":"10.1109\/TPDS.2015.2401003"},{"key":"key-10.1145\/3178876.3186084-46","doi-asserted-by":"crossref","unstructured":"C. Xiong, Z. Dai, J. Callan, Z. Liu, and R. Power. End-to-End Neural Ad-hoc Ranking with Kernel Pooling. In Proceedings of the 40th International ACM SIGIR Conference on Research &#38; Development in Information Retrieval. ACM, 2017.","DOI":"10.1145\/3077136.3080809"},{"key":"key-10.1145\/3178876.3186084-47","doi-asserted-by":"crossref","unstructured":"J. Xu and H. Li. Adarank: a boosting algorithm for information retrieval. SIGIR '07, pages 391--398. ACM, 2007.","DOI":"10.1145\/1277741.1277809"},{"key":"key-10.1145\/3178876.3186084-48","doi-asserted-by":"crossref","unstructured":"W. Zhang, Y. Lin, S. Xiao, J. Wu, and S. Zhou. Privacy preserving ranked multi-keyword search for multiple data owners in cloud computing. IEEE Trans. Computers, 65(5):1566--1577, 2016.","DOI":"10.1109\/TC.2015.2448099"},{"key":"key-10.1145\/3178876.3186084-49","doi-asserted-by":"crossref","unstructured":"J. Zhao and J. X. Huang. An enhanced context-sensitive proximity model for probabilistic information retrieval. In SIGIR, pages 1131--1134, 2014.","DOI":"10.1145\/2600428.2609527"}],"event":{"name":"the 2018 World Wide Web Conference","location":"Lyon, France","acronym":"WWW '18","number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"start":{"date-parts":[[2018,4,23]]},"end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186084","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186084&ftid=1957419&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:27:42Z","timestamp":1751563662000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186084"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186084","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}