{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:20Z","timestamp":1760596220110,"version":"3.41.0"},"reference-count":75,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100014790","name":"Singapore Management University","doi-asserted-by":"crossref","award":["C220\/MSS6C002"],"award-info":[{"award-number":["C220\/MSS6C002"]}],"id":[{"id":"10.13039\/501100014790","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2010,2]]},"abstract":"<jats:p>Users of online services are increasingly wary that their activities could disclose confidential information on their business or personal activities. It would be desirable for an online document service to perform text retrieval for users, while protecting the privacy of their activities. In this article, we introduce a privacy-preserving, similarity-based text retrieval scheme that (a) prevents the server from accurately reconstructing the term composition of queries and documents, and (b) anonymizes the search results from unauthorized observers. At the same time, our scheme preserves the relevance-ranking of the search server, and enables accounting of the number of documents that each user opens. The effectiveness of the scheme is verified empirically with two real text corpora.<\/jats:p>","DOI":"10.1145\/1667067.1667071","type":"journal-article","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T13:16:40Z","timestamp":1282655800000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Privacy-preserving similarity-based text retrieval"],"prefix":"10.1145","volume":"10","author":[{"given":"Hweehwa","family":"Pang","sequence":"first","affiliation":[{"name":"Singapore Management University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jialie","family":"Shen","sequence":"additional","affiliation":[{"name":"Singapore Management University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramayya","family":"Krishnan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,2,8]]},"reference":[{"volume-title":"Advanced Encryption Standard","unstructured":"AES. 2001. Advanced Encryption Standard . National Institute of Science and Technology , FIPS 197. AES. 2001. Advanced Encryption Standard. National Institute of Science and Technology, FIPS 197.","key":"e_1_2_1_1_1"},{"volume-title":"Proceedings of the Very Large Data Bases. 143--154","author":"Agrawal R.","unstructured":"Agrawal , R. , Kiernan , J. , Srikant , R. , and Xu , Y . 2002. Hippocratic databases . In Proceedings of the Very Large Data Bases. 143--154 . Agrawal, R., Kiernan, J., Srikant, R., and Xu, Y. 2002. Hippocratic databases. In Proceedings of the Very Large Data Bases. 143--154.","key":"e_1_2_1_2_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1145\/1007568.1007632"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1145\/1066157.1066187"},{"volume-title":"Proceedings of the International Workshop on Information Hiding (IWIH).","author":"Anderson R.","unstructured":"Anderson , R. , Needham , R. , and Shamir , A . 1998. The steganographic file system . In Proceedings of the International Workshop on Information Hiding (IWIH). Anderson, R., Needham, R., and Shamir, A. 1998. The steganographic file system. In Proceedings of the International Workshop on Information Hiding (IWIH).","key":"e_1_2_1_5_1"},{"unstructured":"Baeza-Yates R. and Neto B. R. 1999. Modern Information Retrieval. Addison Wesley.   Baeza-Yates R. and Neto B. R. 1999. Modern Information Retrieval. Addison Wesley.","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 3rd International Conference on Information Security and Cryptology","author":"Bao F.","year":"2015","unstructured":"Bao , F. , Deng , R. H. , and Feng , P . 2000. An efficient and practical scheme for privacy protection in e-commerce of digital goods . In Proceedings of the 3rd International Conference on Information Security and Cryptology , 2015 , 162--170. Bao, F., Deng, R. H., and Feng, P. 2000. An efficient and practical scheme for privacy protection in e-commerce of digital goods. In Proceedings of the 3rd International Conference on Information Security and Cryptology, 2015, 162--170."},{"unstructured":"Barbaro M. and Zeller T. 2006. A face is exposed for AOL searcher No. 4417749. The New York Times. http:\/\/www.nytimes.com\/2006\/08\/09\/technology\/09aol.html.  Barbaro M. and Zeller T. 2006. A face is exposed for AOL searcher No. 4417749. The New York Times. http:\/\/www.nytimes.com\/2006\/08\/09\/technology\/09aol.html.","key":"e_1_2_1_8_1"},{"volume-title":"Proceedings of the International Conference on Very Large Data Bases.","author":"Bawa M.","unstructured":"Bawa , M. , Bayardo , R. J. , and Agrawal , R . 2003. Privacy-preserving Indexing of Documents on the Network . In Proceedings of the International Conference on Very Large Data Bases. Bawa, M., Bayardo, R. J., and Agrawal, R. 2003. Privacy-preserving Indexing of Documents on the Network. In Proceedings of the International Conference on Very Large Data Bases.","key":"e_1_2_1_9_1"},{"volume-title":"Proceedings of the 6th International Conference on Extending Database Technology. 216--230","author":"Berchtold S.","unstructured":"Berchtold , S. , Bohm , C. , and Kriegel , H . -P. 1998. Improving the query performance of high-dimensional index structures by bulk-load operations . In Proceedings of the 6th International Conference on Extending Database Technology. 216--230 . Berchtold, S., Bohm, C., and Kriegel, H.-P. 1998. Improving the query performance of high-dimensional index structures by bulk-load operations. In Proceedings of the 6th International Conference on Extending Database Technology. 216--230.","key":"e_1_2_1_10_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_11_1","DOI":"10.1109\/SP.2006.27"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1145\/362686.362692"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1016\/0306-4573(92)90069-C"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1016\/S0169-7552(98)00110-X"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_1","DOI":"10.1145\/358549.358563"},{"volume-title":"Proceedings of the IEEE Symposium on Foundations of Computer Science. 41--50","author":"Chor B.","unstructured":"Chor , B. , Goldreich , O. , Kushilevitz , E. , and Sudan , M . 1995. Private information retrieval . In Proceedings of the IEEE Symposium on Foundations of Computer Science. 41--50 . Chor, B., Goldreich, O., Kushilevitz, E., and Sudan, M. 1995. Private information retrieval. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 41--50.","key":"e_1_2_1_16_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_1","DOI":"10.1145\/948109.948124"},{"doi-asserted-by":"publisher","key":"e_1_2_1_18_1","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"volume-title":"Proceedings of the 13th USENIX Security Symposium. 303--320","author":"Dingledine R.","unstructured":"Dingledine , R. , Mathewson , N. , and Syverson , P . 2004. Tor: The second-generation onion router . In Proceedings of the 13th USENIX Security Symposium. 303--320 . Dingledine, R., Mathewson, N., and Syverson, P. 2004. Tor: The second-generation onion router. In Proceedings of the 13th USENIX Security Symposium. 303--320.","key":"e_1_2_1_19_1"},{"doi-asserted-by":"crossref","unstructured":"Domingo-Ferrer J. Seb\u00e9 F. and Castell-Roca J. 2004. On the security of noise addition for privacy in statistical databases. In Privacy in Statistical Databases 149--161.  Domingo-Ferrer J. Seb\u00e9 F. and Castell-Roca J. 2004. On the security of noise addition for privacy in statistical databases. In Privacy in Statistical Databases 149--161.","key":"e_1_2_1_20_1","DOI":"10.1007\/978-3-540-25955-8_12"},{"doi-asserted-by":"publisher","key":"e_1_2_1_21_1","DOI":"10.1016\/j.comnet.2008.06.017"},{"doi-asserted-by":"publisher","key":"e_1_2_1_22_1","DOI":"10.1137\/S0097539704442696"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 2nd Text REtrieval Conference (TREC2). D. Harman, Ed. National Institute of Standards and Technology Special Publication, 105--116","author":"Dumais S. T.","year":"1994","unstructured":"Dumais , S. T. 1994 . Latent Semantic Indexing (LSI) and TREC-2 . In Proceedings of the 2nd Text REtrieval Conference (TREC2). D. Harman, Ed. National Institute of Standards and Technology Special Publication, 105--116 . Dumais, S. T. 1994. Latent Semantic Indexing (LSI) and TREC-2. In Proceedings of the 2nd Text REtrieval Conference (TREC2). D. Harman, Ed. National Institute of Standards and Technology Special Publication, 105--116."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 3rd Text REtrieval Conference (TREC3). National Institute of Standards and Technology Special Publication, 219--230","author":"Dumais S. T.","year":"1995","unstructured":"Dumais , S. T. 1995 . Latent semantic indexing (LSI): TREC-3 report, D. Harman, ed . In Proceedings of the 3rd Text REtrieval Conference (TREC3). National Institute of Standards and Technology Special Publication, 219--230 . Dumais, S. T. 1995. Latent semantic indexing (LSI): TREC-3 report, D. Harman, ed. In Proceedings of the 3rd Text REtrieval Conference (TREC3). National Institute of Standards and Technology Special Publication, 219--230."},{"unstructured":"Duncan G. T. Fienberg S. E. Krishnan R. Padman R. and Roehrig S. F. 2001. Disclosure limitation methods and information loss for tabular data. In Confidentiality Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies P. Doyle J. Lane J. Theeuwes and L. Zayatz Eds. Elsevier 135--166.  Duncan G. T. Fienberg S. E. Krishnan R. Padman R. and Roehrig S. F. 2001. Disclosure limitation methods and information loss for tabular data. In Confidentiality Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies P. Doyle J. Lane J. Theeuwes and L. Zayatz Eds. Elsevier 135--166.","key":"e_1_2_1_25_1"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the Crypto. 10--18","author":"ElGamal T.","year":"1984","unstructured":"ElGamal , T. 1984 . A public-key cryptosystem and a signature scheme based on discrete logarithms . In Proceedings of the Crypto. 10--18 . ElGamal, T. 1984. A public-key cryptosystem and a signature scheme based on discrete logarithms. In Proceedings of the Crypto. 10--18."},{"doi-asserted-by":"crossref","unstructured":"Fierro R. and Berry M. 2002. Efficient computation of the Riemannian SVD in TLS problems in information retrieval. In Total Least Squares and Errors-In-Variables Modeling: Analysis Algorithms and Applications S. van Huffel and P. Lemmerling Eds. Kluwer Academic Publishers 349--360.  Fierro R. and Berry M. 2002. Efficient computation of the Riemannian SVD in TLS problems in information retrieval. In Total Least Squares and Errors-In-Variables Modeling: Analysis Algorithms and Applications S. van Huffel and P. Lemmerling Eds. Kluwer Academic Publishers 349--360.","key":"e_1_2_1_27_1","DOI":"10.1007\/978-94-017-3552-0_31"},{"doi-asserted-by":"publisher","key":"e_1_2_1_28_1","DOI":"10.1007\/978-3-540-30576-7_17"},{"doi-asserted-by":"publisher","key":"e_1_2_1_29_1","DOI":"10.1093\/comjnl\/35.3.243"},{"doi-asserted-by":"publisher","key":"e_1_2_1_31_1","DOI":"10.1145\/293411.293443"},{"doi-asserted-by":"publisher","key":"e_1_2_1_32_1","DOI":"10.1287\/opre.50.3.501.7745"},{"doi-asserted-by":"publisher","key":"e_1_2_1_33_1","DOI":"10.1145\/1066116.1189037"},{"doi-asserted-by":"publisher","key":"e_1_2_1_34_1","DOI":"10.1145\/602259.602266"},{"doi-asserted-by":"publisher","key":"e_1_2_1_35_1","DOI":"10.1145\/564691.564717"},{"unstructured":"Hansell S. 2006. Marketers trace paths users leave on internet. The New York Times. http:\/\/www.nytimes.com\/2006\/08\/15\/technology\/15search.html.  Hansell S. 2006. Marketers trace paths users leave on internet. The New York Times. http:\/\/www.nytimes.com\/2006\/08\/15\/technology\/15search.html.","key":"e_1_2_1_36_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_37_1","DOI":"10.1145\/1008992.1009012"},{"doi-asserted-by":"publisher","key":"e_1_2_1_38_1","DOI":"10.1145\/320248.320255"},{"doi-asserted-by":"publisher","key":"e_1_2_1_39_1","DOI":"10.1145\/312624.312649"},{"volume-title":"Proceedings of the SIAM Conference on Computational Information Retrieval. 145--156","author":"Husbands P.","unstructured":"Husbands , P. , Simon , H. , and Ding , C. H. Q. 2001. On the use of the singular value decomposition for text retrieval . In Proceedings of the SIAM Conference on Computational Information Retrieval. 145--156 . Husbands, P., Simon, H., and Ding, C. H. Q. 2001. On the use of the singular value decomposition for text retrieval. In Proceedings of the SIAM Conference on Computational Information Retrieval. 145--156.","key":"e_1_2_1_40_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_41_1","DOI":"10.1145\/383891.383894"},{"doi-asserted-by":"publisher","key":"e_1_2_1_42_1","DOI":"10.1109\/ICDE.2008.4497482"},{"doi-asserted-by":"publisher","key":"e_1_2_1_43_1","DOI":"10.1287\/mnsc.1060.0562"},{"doi-asserted-by":"publisher","key":"e_1_2_1_44_1","DOI":"10.1109\/TKDE.2007.190662"},{"volume-title":"Section on Survey Research Methods","author":"Kim J.","unstructured":"Kim , J. 1986. A method for limiting disclosure in microdata based on random noise and transformation . In Section on Survey Research Methods , American Statistical Association , 303--308. Kim, J. 1986. A method for limiting disclosure in microdata based on random noise and transformation. In Section on Survey Research Methods, American Statistical Association, 303--308.","key":"e_1_2_1_45_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_46_1","DOI":"10.1145\/65943.65946"},{"doi-asserted-by":"publisher","key":"e_1_2_1_47_1","DOI":"10.1145\/324133.324140"},{"doi-asserted-by":"publisher","key":"e_1_2_1_48_1","DOI":"10.1145\/291128.291131"},{"doi-asserted-by":"publisher","key":"e_1_2_1_49_1","DOI":"10.1016\/j.jco.2003.08.023"},{"doi-asserted-by":"publisher","key":"e_1_2_1_50_1","DOI":"10.5555\/1005332.1005345"},{"doi-asserted-by":"publisher","key":"e_1_2_1_51_1","DOI":"10.5555\/646603.697049"},{"doi-asserted-by":"publisher","key":"e_1_2_1_52_1","DOI":"10.1109\/ICDE.2006.1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_53_1","DOI":"10.1287\/mnsc.1060.0603"},{"doi-asserted-by":"publisher","key":"e_1_2_1_54_1","DOI":"10.1145\/1055558.1055591"},{"doi-asserted-by":"publisher","key":"e_1_2_1_55_1","DOI":"10.1007\/s00145-007-0565-3"},{"doi-asserted-by":"publisher","key":"e_1_2_1_56_1","DOI":"10.14778\/1453856.1453875"},{"doi-asserted-by":"publisher","key":"e_1_2_1_57_1","DOI":"10.1109\/TKDE.2004.15"},{"doi-asserted-by":"publisher","key":"e_1_2_1_58_1","DOI":"10.1002\/asi.4630270302"},{"doi-asserted-by":"publisher","key":"e_1_2_1_59_1","DOI":"10.1145\/582318.582321"},{"volume-title":"Latent semantic indexing: An overview. Techn. rep. INFOSYS 240 Spring Paper","author":"Rosario B.","unstructured":"Rosario , B. 2000. Latent semantic indexing: An overview. Techn. rep. INFOSYS 240 Spring Paper , University of California , Berkeley. http:\/\/www.sims.berkeley.edu\/rosario\/projects\/LSI.pdf. Rosario, B. 2000. Latent semantic indexing: An overview. Techn. rep. INFOSYS 240 Spring Paper, University of California, Berkeley. http:\/\/www.sims.berkeley.edu\/rosario\/projects\/LSI.pdf.","key":"e_1_2_1_60_1"},{"unstructured":"Salton G. 1989. Automatic Text Processing\u2014The Transformation Analysis and Retrieval of Information by Computer. Addison--Wesley.   Salton G. 1989. Automatic Text Processing\u2014The Transformation Analysis and Retrieval of Information by Computer. Addison--Wesley.","key":"e_1_2_1_61_1"},{"doi-asserted-by":"crossref","unstructured":"Salton G. 1991. Developments in automatic text retrieval. Sci. 253 5023 974--979.  Salton G. 1991. Developments in automatic text retrieval. Sci. 253 5023 974--979.","key":"e_1_2_1_62_1","DOI":"10.1126\/science.253.5023.974"},{"doi-asserted-by":"publisher","key":"e_1_2_1_63_1","DOI":"10.1109\/69.971193"},{"doi-asserted-by":"publisher","key":"e_1_2_1_64_1","DOI":"10.1109\/2.485845"},{"doi-asserted-by":"publisher","key":"e_1_2_1_65_1","DOI":"10.1145\/1273221.1273222"},{"volume-title":"Proceedings of the IEEE Symposium on Security and Privacy. 44--55","author":"Song D. X.","unstructured":"Song , D. X. , Wagner , D. , and Perrig , A . 2000. Practical techniques for searches on encrypted data . In Proceedings of the IEEE Symposium on Security and Privacy. 44--55 . Song, D. X., Wagner, D., and Perrig, A. 2000. Practical techniques for searches on encrypted data. In Proceedings of the IEEE Symposium on Security and Privacy. 44--55.","key":"e_1_2_1_66_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_67_1","DOI":"10.1142\/S0218488502001648"},{"doi-asserted-by":"publisher","key":"e_1_2_1_68_1","DOI":"10.1093\/comjnl\/29.6.481"},{"unstructured":"van Rijsbergen C. J. 1979. Information Retrieval. Butterworth.   van Rijsbergen C. J. 1979. Information Retrieval. Butterworth.","key":"e_1_2_1_69_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_70_1","DOI":"10.1016\/j.comcom.2006.06.018"},{"volume-title":"Proceedings of the European Symposium on Research in Computer Security (ESORICS). 49--64","author":"Wang S.","unstructured":"Wang , S. , Ding , X. , Deng , R. H. , and Bao , F . 2007. Private information retrieval using trusted hardware . In Proceedings of the European Symposium on Research in Computer Security (ESORICS). 49--64 . Wang, S., Ding, X., Deng, R. H., and Bao, F. 2007. Private information retrieval using trusted hardware. In Proceedings of the European Symposium on Research in Computer Security (ESORICS). 49--64.","key":"e_1_2_1_71_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_72_1","DOI":"10.1145\/1142473.1142500"},{"doi-asserted-by":"publisher","key":"e_1_2_1_73_1","DOI":"10.1016\/j.datak.2007.10.005"},{"doi-asserted-by":"publisher","key":"e_1_2_1_74_1","DOI":"10.1145\/1065167.1065185"},{"doi-asserted-by":"publisher","key":"e_1_2_1_75_1","DOI":"10.1002\/spe.4380250804"},{"doi-asserted-by":"publisher","key":"e_1_2_1_76_1","DOI":"10.1145\/1132956.1132959"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1667067.1667071","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1667067.1667071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:30Z","timestamp":1750250490000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1667067.1667071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["10.1145\/1667067.1667071"],"URL":"https:\/\/doi.org\/10.1145\/1667067.1667071","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"type":"print","value":"1533-5399"},{"type":"electronic","value":"1557-6051"}],"subject":[],"published":{"date-parts":[[2010,2]]},"assertion":[{"value":"2008-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-02-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}