{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T01:14:29Z","timestamp":1769562869588,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,5,16]],"date-time":"2015-05-16T00:00:00Z","timestamp":1431734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,5,16]],"date-time":"2015-05-16T00:00:00Z","timestamp":1431734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval J"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10791-015-9256-0","type":"journal-article","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T15:39:48Z","timestamp":1431704388000},"page":"331-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Versatile Query Scrambling for Private Web Search"],"prefix":"10.1007","volume":"18","author":[{"given":"Avi","family":"Arampatzis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Drosatos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlos S.","family":"Efraimidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"9256_CR1","doi-asserted-by":"crossref","unstructured":"Arampatzis, A., Kamps, J., & Robertson, S. (2009). Where to stop reading a ranked list: Threshold optimization using truncated score distributions. In SIGIR, ACM (pp. 524\u2013531).","DOI":"10.1145\/1571941.1572031"},{"key":"9256_CR2","doi-asserted-by":"crossref","unstructured":"Arampatzis, A., Efraimidis, P., & Drosatos, G. (2011). Enhancing deniability against query-logs. In ECIR, Springer, lecture notes in computer science (Vol. 6611, pp. 117\u2013128).","DOI":"10.1007\/978-3-642-20161-5_13"},{"issue":"6","key":"9256_CR3","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s10791-012-9212-1","volume":"16","author":"A Arampatzis","year":"2013","unstructured":"Arampatzis, A., Efraimidis, P. S., & Drosatos, G. (2013). A query scrambler for search privacy on the internet. Information Retrieval, 16(6), 657\u2013679.","journal-title":"Information Retrieval"},{"key":"9256_CR4","unstructured":"Barbaro, M., & Zeller, T. (2006). A face is exposed for AOL searcher no. 4417749. Accessed June 5, 2014. http:\/\/www.nytimes.com\/2006\/08\/09\/technology\/09aol.html."},{"key":"9256_CR5","doi-asserted-by":"publisher","unstructured":"Bhagat, S., Weinsberg, U., Ioannidis, S., & Taft, N. (2014). Recommending with an agenda: Active learning of private attributes using matrix factorization. In Proceedings of the 8th ACM conference on recommender systems (pp. 65\u201372). New York: ACM. RecSys \u201914. doi:10.1145\/2645710.2645747.","DOI":"10.1145\/2645710.2645747"},{"key":"9256_CR6","doi-asserted-by":"publisher","unstructured":"Boneh, D., & Waters, B. (2007). Conjunctive, subset, and range queries on encrypted data. In Theory of cryptography, lecture notes in computer science (Vol. 4392, pp. 535\u2013554). Berlin: Springer. doi:10.1007\/978-3-540-70936-7_29.","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"9256_CR7","unstructured":"Bouma, G. (2009). Normalized (pointwise) mutual information in collocation extraction. In Proceedings of GSCL (pp. 31\u201340). http:\/\/www.ling.uni-potsdam.de\/ gerlof\/docs\/npmi-pfd.pdf."},{"issue":"4","key":"9256_CR8","first-page":"467","volume":"18","author":"PF Brown","year":"1992","unstructured":"Brown, P. F., Pietra, V. J. D., de Souza, P. V., Lai, J. C., & Mercer, R. L. (1992). Class-based n-gram models of natural language. Computational Linguistics, 18(4), 467\u2013479.","journal-title":"Computational Linguistics"},{"issue":"2","key":"9256_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/382979.383040","volume":"19","author":"JP Callan","year":"2001","unstructured":"Callan, J. P., & Connell, M. E. (2001). Query-based sampling of text databases. ACM Transactions on Information Systems, 19(2), 97\u2013130.","journal-title":"ACM Transactions on Information Systems"},{"issue":"1","key":"9256_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/TPDS.2013.45","volume":"25","author":"N Cao","year":"2014","unstructured":"Cao, N., Wang, C., Li, M., Ren, K., & Lou, W. (2014). Privacy-preserving multi-keyword ranked search over encrypted cloud data. Parallel and Distributed Systems, IEEE Transactions on, 25(1), 222\u2013233. doi:10.1109\/TPDS.2013.45.","journal-title":"Parallel and Distributed Systems, IEEE Transactions on"},{"key":"9256_CR11","first-page":"2000","volume":"98","author":"A Caprara","year":"1998","unstructured":"Caprara, A., Fischetti, M., & Toth, P. (1998). Algorithms for the set covering problem. Annals of Operations Research, 98, 2000.","journal-title":"Annals of Operations Research"},{"key":"9256_CR12","doi-asserted-by":"publisher","unstructured":"Carpineto, C., & Romano, G. (2013). Semantic search log k-anonymization with generalized k-cores of query concept graph. In Advances in information retrieval, lecture notes in computer Science (Vol. 7814, pp. 110\u2013121). Berlin: Springer. doi:10.1007\/978-3-642-36973-5_10.","DOI":"10.1007\/978-3-642-36973-5_10"},{"key":"9256_CR13","unstructured":"Carr, R. D., Doddi, S., Konjevod, G., & Marathe, M. (2000). On the red-blue set cover problem. In Proceedings of the eleventh annual ACM-SIAM symposium on Discrete Algorithms (pp. 345\u2013353). Philadelphia: Society for Industrial and Applied Mathematics. SODA \u201900, http:\/\/dl.acm.org\/citation.cfm?id=338219.338271."},{"issue":"13\u201314","key":"9256_CR14","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1016\/j.comcom.2009.05.009","volume":"32","author":"J Castell\u00e0-Roca","year":"2009","unstructured":"Castell\u00e0-Roca, J., Viejo, A., & Herrera-Joancomart\u00ed, J. (2009). Preserving user\u2019s privacy in web search engines. Computer Communications, 32(13\u201314), 1541\u20131551. doi:10.1016\/j.comcom.2009.05.009.","journal-title":"Computer Communications"},{"issue":"3","key":"9256_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V. (1979). A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3), 233\u2013235. doi:10.2307\/3689577.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"9256_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1177\/001316446002000104","volume":"20","author":"J Cohen","year":"1960","unstructured":"Cohen, J. (1960). A coefficient of agreement for nominal scales. Educational and Psychological Measurement, 20(1), 37.","journal-title":"Educational and Psychological Measurement"},{"issue":"11","key":"9256_CR17","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1016\/j.datak.2009.06.004","volume":"68","author":"J Domingo-Ferrer","year":"2009","unstructured":"Domingo-Ferrer, J., Bras-Amor\u00f3s, M., Wu, Q., & Manj\u00f3n, J. A. (2009). User-private information retrieval based on a peer-to-peer community. Data & Knowledge Engineering, 68(11), 1237\u20131252.","journal-title":"Data & Knowledge Engineering"},{"issue":"4","key":"9256_CR18","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1108\/14684520910985693","volume":"33","author":"J Domingo-Ferrer","year":"2009","unstructured":"Domingo-Ferrer, J., Solanas, A., & Castell\u00e0-Roca, J. (2009). h(k)-private information retrieval from privacy-uncooperative queryable databases. Online Information Review, 33(4), 720\u2013744. doi:10.1108\/14684520910985693.","journal-title":"Online Information Review"},{"issue":"5","key":"9256_CR19","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1037\/h0031619","volume":"76","author":"J Fleiss","year":"1971","unstructured":"Fleiss, J., et al. (1971). Measuring nominal scale agreement among many raters. Psychological Bulletin, 76(5), 378\u2013382.","journal-title":"Psychological Bulletin"},{"key":"9256_CR20","doi-asserted-by":"crossref","unstructured":"Hannak, A., Sapiezynski, P., Molavi Kakhki, A., Krishnamurthy, B., Lazer, D., Mislove, A., & Wilson, C. (2013). Measuring personalization of web search. In Proceedings of the 22nd international conference on World Wide Web (pp. 527\u2013538). Republic and Canton of Geneva: International World Wide Web Conferences Steering Committee. WWW \u201913. http:\/\/dl.acm.org\/citation.cfm?id=2488388.2488435.","DOI":"10.1145\/2488388.2488435"},{"key":"9256_CR21","first-page":"417","volume-title":"Lessons from the Identity trail: Anonymity, privacy, and identity in a networked society","author":"DC Howe","year":"2009","unstructured":"Howe, D. C., & Nissenbaum, H. (2009). TrackMeNot: Resisting surveillance in web search. In I. Kerr, C. Lucock, & V. Steeves (Eds.), Lessons from the Identity trail: Anonymity, privacy, and identity in a networked society (Chap 23, pp. 417\u2013436). Oxford: Oxford University Press."},{"key":"9256_CR22","unstructured":"Karp, R. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, NY, The IBM Research Symposia Series, Complexity of computer computations (pp. 85\u2013103). New York: Plenum Press."},{"key":"9256_CR23","doi-asserted-by":"publisher","unstructured":"Lindell, Y., & Waisbard, E. (2010). Private web search with malicious adversaries. In Privacy enhancing technologies, lecture notes in computer science (Vol. 6205, pp. 220\u2013235). Berlin: Springer. doi:10.1007\/978-3-642-14527-8_13.","DOI":"10.1007\/978-3-642-14527-8_13"},{"issue":"5","key":"9256_CR24","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund, C., & Yannakakis, M. (1994). On the hardness of approximating minimization problems. Journal of the ACM (JACM), 41(5), 960\u2013981. doi:10.1145\/185675.306789.","journal-title":"Journal of the ACM (JACM)"},{"key":"9256_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, C. D., Raghavan, P., & Sch\u00fctze, H. (2008). Introduction to information retrieval. Cambridge: Cambridge University Press."},{"key":"9256_CR26","doi-asserted-by":"crossref","unstructured":"Murugesan, M., & Clifton, C. (2009). Providing privacy through plausibly deniable search. In SDM, SIAM (pp. 768\u2013779).","DOI":"10.1137\/1.9781611972795.66"},{"key":"9256_CR27","doi-asserted-by":"crossref","unstructured":"Pass, G., Chowdhury, A., & Torgeson, C. (2006). A picture of search. In InfoScale \u201906: Proceedings of the 1st international conference on scalable information systems. New York: ACM Press.","DOI":"10.1145\/1146847.1146848"},{"key":"9256_CR28","doi-asserted-by":"crossref","unstructured":"Peddinti, S. T., & Saxena, N. (2014). Web search query privacy: Evaluating query obfuscation and anonymizing networks. Journal of Computer Security, 22(1), 155\u2013199. http:\/\/dl.acm.org\/citation.cfm?id=2590636.2590640.","DOI":"10.3233\/JCS-130491"},{"key":"9256_CR29","doi-asserted-by":"crossref","unstructured":"Saint-Jean, F., Johnson, A., Boneh, D., & Feigenbaum, J. (2007). Private web search. In WPES \u201907: Proceedings of the 2007 ACM workshop on privacy in electronic society (pp. 84\u201390). New York: ACM.","DOI":"10.1145\/1314333.1314351"},{"key":"9256_CR30","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ins.2012.06.025","volume":"218","author":"D S\u00e1nchez","year":"2013","unstructured":"S\u00e1nchez, D., Castell\u00e0-Roca, J., & Viejo, A. (2013). Knowledge-based scheme to create privacy-preserving but semantically-related queries for web search engines. Information Sciences, 218, 17\u201330. doi:10.1016\/j.ins.2012.06.025.","journal-title":"Information Sciences"},{"issue":"1","key":"9256_CR31","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1273221.1273222","volume":"41","author":"X Shen","year":"2007","unstructured":"Shen, X., Tan, B., & Zhai, C. (2007). Privacy protection in personalized search. SIGIR Forum, 41(1), 4\u201317.","journal-title":"SIGIR Forum"},{"issue":"5","key":"9256_CR32","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L. (2002). k-Anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5), 557\u2013570.","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"9256_CR33","doi-asserted-by":"crossref","unstructured":"Terra, E. L., & Clarke, C. L. A. (2003). Frequency estimates for statistical word similarity measures. In HLT-NAACL, Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, May 27\u2013June 1, Edmonton, Canada.","DOI":"10.3115\/1073445.1073477"},{"key":"9256_CR34","unstructured":"Tigelaar, A. S., & Hiemstra, D. (2010). Query-based sampling using snippets. In Eighth workshop on Large-Scale Distributed Systems for information retrieval, Geneva, Switzerland, CEUR-WS, Aachen, Germany, CEUR workshop proceedings (Vol. 630, pp. 9\u201314)."},{"issue":"12","key":"9256_CR35","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1002\/asi.23144","volume":"65","author":"A Viejo","year":"2014","unstructured":"Viejo, A., & S\u00e1nchez, D. (2014). Profiling social networks to provide useful and privacy-preserving web search. JASIST, 65(12), 2444\u20132458. doi:10.1002\/asi.23144.","journal-title":"JASIST"},{"key":"9256_CR36","unstructured":"Yang, Y., & Pedersen, J. O. (1997). A comparative study on feature selection in text categorization. In ICML, Morgan Kaufmann (pp. 412\u2013420)."},{"key":"9256_CR37","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-0-387-30162-4_175","volume-title":"Encyclopedia of algorithms","author":"NE Young","year":"2008","unstructured":"Young, N. E. (2008). Greedy set-cover algorithms. In M.-Y. Kao (Ed.), Encyclopedia of algorithms (pp. 379\u2013381). US: Springer. doi:10.1007\/978-0-387-30162-4_175."}],"container-title":["Information Retrieval Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-015-9256-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-015-9256-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-015-9256-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-015-9256-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:19:28Z","timestamp":1704205168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-015-9256-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,16]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9256"],"URL":"https:\/\/doi.org\/10.1007\/s10791-015-9256-0","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,16]]},"assertion":[{"value":"25 June 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}