{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:52Z","timestamp":1760596252206},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p>Users of text search engines are increasingly wary that their activities may disclose confidential information about their business or personal profiles. It would be desirable for a search engine to perform document retrieval for users while protecting their intent. In this paper, we identify the privacy risks arising from semantically related search terms within a query, and from recurring high-specificity query terms in a search session. To counter the risks, we propose a solution for a similarity text retrieval system to offer anonymity and plausible deniability for the query terms, and hence the user intent, without degrading the system's precision-recall performance. The solution comprises a mechanism that embellishes each user query with decoy terms that exhibit similar specificity spread as the genuine terms, but point to plausible alternative topics. We also provide an accompanying retrieval scheme that enables the search engine to compute the encrypted document relevance scores from only the genuine search terms, yet remain oblivious to their distinction from the decoys. Empirical evaluation results are presented to substantiate the effectiveness of our solution.<\/jats:p>","DOI":"10.14778\/1920841.1920918","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"598-607","source":"Crossref","is-referenced-by-count":28,"title":["Embellishing text search queries to protect user privacy"],"prefix":"10.14778","volume":"3","author":[{"given":"HweeHwa","family":"Pang","sequence":"first","affiliation":[{"name":"Singapore Management University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuhua","family":"Ding","sequence":"additional","affiliation":[{"name":"Singapore Management University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[{"name":"Nanyang Technological University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Query Log Analysis Workshop, WWW","author":"Adar E.","year":"2007","unstructured":"E. Adar . User 4xxxxx9 : Anonymizing Query Logs . In Query Log Analysis Workshop, WWW , May 2007 . E. Adar. User 4xxxxx9: Anonymizing Query Logs. In Query Log Analysis Workshop, WWW, May 2007."},{"key":"e_1_2_1_2_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R.","year":"1999","unstructured":"R. Baeza-Yates and B. R. Neto . Modern Information Retrieval . Addison Wesley , 1999 . R. Baeza-Yates and B. R. Neto. Modern Information Retrieval. Addison Wesley, 1999."},{"key":"e_1_2_1_3_1","volume-title":"The New York Times","author":"Barbaro M.","year":"2006","unstructured":"M. Barbaro and T. Z. Jr . A Face Is Exposed for AOL Searcher No. 4417749 . The New York Times , 9 August 2006 . M. Barbaro and T. Z. Jr. A Face Is Exposed for AOL Searcher No. 4417749. The New York Times, 9 August 2006."},{"key":"e_1_2_1_4_1","volume-title":"Dense Probabilistic Encryption. In Workshop on Selected Areas of Cryptography","author":"Benaloh J. C.","year":"1994","unstructured":"J. C. Benaloh . Dense Probabilistic Encryption. In Workshop on Selected Areas of Cryptography , May 1994 . J. C. Benaloh. Dense Probabilistic Encryption. In Workshop on Selected Areas of Cryptography, May 1994."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.27"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_2_1_9_1","volume-title":"Second Text REtrieval Conference (TREC2), D. Harman, ed.","author":"Dumais S. T.","year":"1994","unstructured":"S. T. Dumais . Latent Semantic Indexing (LSI) and TREC-2 . In Second Text REtrieval Conference (TREC2), D. Harman, ed. , March 1994 . S. T. Dumais. Latent Semantic Indexing (LSI) and TREC-2. In Second Text REtrieval Conference (TREC2), D. Harman, ed., March 1994."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.3115\/1218955.1219008"},{"key":"e_1_2_1_12_1","unstructured":"D. C. Howe and H. Nissenbaum. TrackMeNot.mrl.nyu.edu\/dhower\/trackmenot\/.  D. C. Howe and H. Nissenbaum. TrackMeNot.mrl.nyu.edu\/dhower\/trackmenot\/."},{"key":"e_1_2_1_13_1","volume-title":"Ding. On The Use Of The Singular Value Decomposition For Text Retrieval. In Proc. SIAM Computational Information Retrieval","author":"Husbands P.","year":"2001","unstructured":"P. Husbands , H. Simon , and C. H. Q. Ding. On The Use Of The Singular Value Decomposition For Text Retrieval. In Proc. SIAM Computational Information Retrieval , 2001 . P. Husbands, H. Simon, and C. H. Q. Ding. On The Use Of The Singular Value Decomposition For Text Retrieval. In Proc. SIAM Computational Information Retrieval, 2001."},{"key":"e_1_2_1_14_1","volume-title":"Recherche d'Information Assist\u00e9e par Ordinateur Conference (RIAO)","author":"Joho H.","year":"2007","unstructured":"H. Joho and M. Sanderson . Document Frequency and Term Specificity . In Recherche d'Information Assist\u00e9e par Ordinateur Conference (RIAO) , May 2007 . H. Joho and M. Sanderson. Document Frequency and Term Specificity. In Recherche d'Information Assist\u00e9e par Ordinateur Conference (RIAO), May 2007."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908983"},{"key":"e_1_2_1_16_1","volume-title":"Computationally-Private Information Retrieval. In FOCS","author":"Kushilevitz E.","year":"1997","unstructured":"E. Kushilevitz and R. Ostrovsky . Replication is NOT Needed: SINGLE Database , Computationally-Private Information Retrieval. In FOCS , October 1997 . E. Kushilevitz and R. Ostrovsky. Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. In FOCS, October 1997."},{"key":"e_1_2_1_17_1","unstructured":"Lucene. Apache Lucene Search Engine. http:\/\/lucene.apache.org\/java\/docs\/.  Lucene. Apache Lucene Search Engine. http:\/\/lucene.apache.org\/java\/docs\/."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.66"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756146"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453875"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667067.1667071"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/160688.160713"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(99)00046-1"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0110-6"},{"key":"e_1_2_1_26_1","volume-title":"Practical Techniques for Searches on Encrypted Data. In IEEE Symposium on Security and Privacy","author":"Song D. X.","year":"2000","unstructured":"D. X. Song , D. Wagner , and A. Perrig . Practical Techniques for Searches on Encrypted Data. In IEEE Symposium on Security and Privacy , May 2000 . D. X. Song, D. Wagner, and A. Perrig. Practical Techniques for Searches on Encrypted Data. In IEEE Symposium on Security and Privacy, May 2000."},{"key":"e_1_2_1_27_1","volume-title":"REtrieval Conference. http:\/\/trec.nist.gov\/.","author":"Text TREC.","unstructured":"TREC. Text REtrieval Conference. http:\/\/trec.nist.gov\/. TREC. Text REtrieval Conference. http:\/\/trec.nist.gov\/."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243202"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1920841.1920918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:49:04Z","timestamp":1672228144000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1920841.1920918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.14778\/1920841.1920918"],"URL":"https:\/\/doi.org\/10.14778\/1920841.1920918","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}