Privacy-preserving similarity-based text retrieval

ACM Transactions on Internet Technology

Volumn 10, Issue 1, 2010, Pages

  Pang, Hweehwa ^a   Shen, Jialie ^a   Krishnan, Ramayya ^b  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Privacy of search queries; Security in text retrieval; Singular value decomposition

Indexed keywords

CONFIDENTIAL INFORMATION; ON-LINE DOCUMENTS; ON-LINE SERVICE; PRIVACY PRESERVING; SEARCH QUERIES; SEARCH RESULTS; SECURITY IN TEXT RETRIEVAL; TEXT CORPORA; TEXT RETRIEVAL;

NETWORK SECURITY; SINGULAR VALUE DECOMPOSITION;

INFORMATION RETRIEVAL;

EID: 76849085704     PISSN: 15335399     EISSN: 15576051     Source Type: Journal    
DOI: 10.1145/1667067.1667071     Document Type: Article

References (76)

1. AES. 2001. Advanced Encryption Standard. National Institute of Science and Technology, FIPS 197.
2. AGRAWAL, R., KIERNAN, J., SRIKANT, R., AND XU, Y. 2002. Hippocratic databases. In Proceedings of the Very Large Data Bases. 143-154.
3. AGRAWAL, R.,KIERNAN, J., SRIKANT, R., AND XU, Y. 2004a. Order preserving encryption for numeric data. In Proceedings of the ACM International Conference on Management of Data. 563-574.
4. AGRAWAL, R., SRIKANT, R., AND THOMAS, D. 2004b. Privacy preserving OLAP. In Proceedings of the ACM International Conference on Management of Data. 251-262.
5. ANDERSON, R.,NEEDHAM, R., AND SHAMIR, A. 1998. The steganographic file system. In Proceedings of the International Workshop on Information Hiding (IWIH).
6. BAEZA-YATES, R. AND NETO, B. R. 1999. Modern Information Retrieval. Addison Wesley.
7. 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.
8. 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.
9. 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.
10. BERCHTOLD, S., BOHM, C., AND KRIEGEL, H.-P. 1998. Improving the query performance of highdimensional index structures by bulk-load operations. In Proceedings of the 6th International Conference on Extending Database Technology. 216-230.
11. BETHENCOURT, J., SONG, D., AND WATERS, B. 2006. New constructions and practical applications for private stream searching (extended abstract). In Proceedings of the IEEE Symposium on Security and Privacy (S&P'06). 132-139.
12. BLOOM, B. 1970. Space/time trade-offs in hash coding with allowable errors. Comm. ACM 13, 7, 422-426.
13. BOOKSTEIN, A., KLEIN, S. T., AND ZIFF, D. 1992. A systematic appproach to compressing a full text retrieval system. Inform. Process. Manage. 28, 6, 795-806.
14. BRIN, S. AND PAGE, L. 1998. The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30, 1-7, 107-117.
15. CHAUM, D. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Commu. ACM 24, 2, 84-90.
16. 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.
17. DAMIANI, E., VIMERCATI, S. D. C., JAJODIA, S., PARABOSCHI, S., AND SAMARATI, P. 2003. Balancing confidentiality and efficiency in untrusted relational DBMSS. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03). 93-102.
18. DEERWESTER, S., DUMAIS, S. T., FURNAS, G. W., LANDAUER, T. K., AND HARSHMAN, R. 1990. Indexing by latent semantic analysis. J. Am. Soc. Inform. Sci. 41, 6, 391-407.
19. DINGLEDINE, R.,MATHEWSON, N., AND SYVERSON, P. 2004. Tor: The second-generation onion router. In Proceedings of the 13th USENIX Security Symposium. 303-320.
20. DOMINGO-FERRER, J., SEB́E, F., AND CASTELL-ROCA, J. 2004. On the security of noise addition for privacy in statistical databases. In Privacy in Statistical Databases, 149-161.
21. DOMINGO-FERRER, J., VIEJO, A., SEB́E, F., AND GONŹALEZ- NICOĹAS, U. 2008. Privacy homomorphisms for social networks with private relationships. Comput. Netw. 52, 3007-3016.
22. DRINEAS, P., KANNAN, R., AND MAHONEY, M. W. 2006. Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. SIAM J. Comput. 36, 1, 158-183. (Pubitemid 46374022)
23. 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.
24. 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.
25. DUNCAN, G. T., FIENBERG, S. E., KRISHNAN, R., PADMAN, R., AND ROEHRIG, S. F. 2001. Disclosure limitationmethods 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.
26. ELGAMAL, T. 1984. A public-key cryptosystem and a signature scheme based on discrete logarithms. In Proceedings of the Crypto. 10-18.
27. 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.
28. FREEDMAN, M. J., ISHAI, Y., PINKAS, B., AND REINGOLD, O. 2005. Keyword search and oblivious pseudorandom functions. In Proceedings of the 2nd Theory of Cryptography Conference.
29. FUHR, N. 1992. Probabilistic models in information retrieval. Comput. J. 35, 3, 243-255.
30. GOH, E. 2003. Secure indexes. Cryptology ePnnt Archive, Report 2003/216.
31. GOLDSCHLAG, D., REED, M., AND SYVERSON, P. 1999. Onion routing. Comm. ACM 42, 2, 39-41.
32. GOPAL, R., GARFINKEL, R., AND GOES, P. 2002. Confidentiality via camouflage: The CVC approach to disclosure limitation when answering queries to databases. Oper. Reser. 50, 3, 501-516.
33. GRUTESER, M. AND GRUNWALD, D. 2003. Anonymous usage of location-based services through spatial and temporal cloaking. In Proceedings of the 1st International Conference on Mobile Systems, Applications and Services (MobiSys'03), 31-42.
34. GUTTMAN, A. 1984. R-Trees: A dynamic index structure for spatial searching. In Proceedings of the ACM International Conference on Management of Data. 47-57.
35. HACIGUMUS, H., IYER, B., LI, C., AND MEHROTRA, S. 2002. Executing SQL over encrypted data in the database service provider model. In Proceedings of the ACM International Conference on Management of Data. 216-227.
36. HANSELL, S. 2006. Marketers trace paths users leave on internet. The New York Times. http://www.nytimes.com/2006/08/15/technology/15search.html.
37. HE, X.,CAI, D., LIU, H., AND MA,W.-Y. 2004. Locality preserving indexing for document representation. In Proceedings of the ACMSIGIR Conference on Research and Development in Information Retrieval, 96-103.
38. HJALTASON, G. R. AND SAMET, H. 1999. Distance browsing in spatial databases. ACM Trans. on Datab. Syst. 24, 2, 265-318.
39. HOFMANN, T. 1999. Probabilistic latent semantic indexing. In Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval, 50-57.
40. 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.
41. JAJODIA, S.,SAMARATI, P.,SAPINO,M. L., AND SUBRAHMANIAN, V. S. 2001. Flexible support formultiple access control policies. ACM Trans. Datab. Syst. 26, 2, 214-260. (Pubitemid 33661632)
42. JIANG, W.,MURUGESAN, M., CLIFTON, C., AND SI, L. 2008. Similar document detection with limited information disclosure. In Proceedings of the IEEE International Conference on Data Engineering. 735-743.
43. KADANE, J. B., KRISHNAN, R., AND SHMUELI, G. 2006. A data disclosure policy for count data based on the COM-Poisson distribution. Manag. Sci. 52, 10, 1610-1617.
44. KALNIS, P.,GHINITA, G.,MOURATIDIS, K., AND PAPADIAS, D. 2007. Preventing location-based identity inference in anonymous spatial queries. IEEE Trans. Knowl. Data Engin. 19, 12, 1719-1733.
45. 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.
46. KLEIN, S. T., BOOKSTEIN, A., AND DEERWESTER, S. C. 1989. Storing text retrieval systems on CDROM: Compression and encryption considerations. ACM Trans. Inform. Syst. 7, 3, 230-245. (Pubitemid 21659998)
47. KLEINBERG, J. M. 1999. Authoritative sources in a hyperlinked environment. J. ACM 46, 5, 604-632.
48. KOLDA, T. G. AND O'LEARY, D. P. 1998. A semidiscrete matrix decomposition for latent semantic indexing information retrieval. ACM Trans. Inform. Syst. 16, 4, 322-346.
49. KUROSAWA, K. AND OGATA, W. 2004. Oblivious keyword search. J. Complex. 20, 2-3, 356-371.
50. LEWIS, D. D., YANG, Y., ROSE, T. G., AND LI, F. 2004. RCV1: A new benchmark collection for text categorization research. J. Mach. Learn. Resea. 5, 361-397.
51. LONG, D. 2002. Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme. In Proceedings of the 1st EurAsian Conference on Information and Communication Technology (EurAsia-ICT'02).
52. MACHANAVAJJHALA, A., GEHRKE, J., KIFER, D., AND VENKITASUBRAMANIAM, M. 2006. L-Diversity: Privacy beyond K-anonymity. In Proceedings of the IEEE International Conference on Data Engineering. 24-35.
53. MENON, S. AND SARKAR, S. 2007. Minimizing information loss and preserving privacy. Manag. Sci. 53, 1, 101-116.
54. MEYERSON, A. AND WILLIAMS, R. 2004. On the complexity of optimal K-anonymity. In Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'04), 223-228.
55. OSTROVSKY, R. AND SKEITH, W. E. 2007. Private searching on streaming data. J. Cryptol. 20, 4, 397-430.
56. PANG, H. AND MOURATIDIS, K. 2008. Authenticating the query results of text search engines. In Proceedings of the Very Large Data Bases. 126-137.
57. PANG, H., TAN, K.-L., AND ZHOU, X. 2004. Steganographic schemes for file system and B-tree. IEEE Trans. Knowl. Data Engin. 16, 6, 701-713.
58. ROBERTSON, S. E. AND JONES, K. S. 1976. Relevance weighting of search terms. J. Amer. Soc. Inform. Sci. 27, 3, 129-146.
59. ROBINSON, J. T. 1981. The K-D-B-Tree: A search structure for large multidimensional dynamic indexes. In Proceedings of the ACM International Conference on Management of Data. 10-18.
60. 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.
61. SALTON, G. 1989. Automatic Text Processing-The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley.
62. SALTON, G. 1991. Developments in automatic text retrieval. Sci. 253, 5023, 974-979.
63. SAMARATI, P. 2001. Protecting respondents' Identities in microdata release. IEEE Trans. Knowl. Data Engin. 13, 6, 1010-1027.
64. SANDHU, R. S., COYNE, E. J., FEINSTEIN, H. L., AND YOUMAN, C. E. 1996. Role-based access control models. IEEE Comput. 29, 2, 38-47.
65. SHEN, X., TAN, B., AND ZHAI, C. 2007. Privacy protection in personalized search. ACM SIGIR Forum 41, 1, 4-17.
66. 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.
67. SWEENEY, L. 2002. k-Anonymity: A model for protecting privacy. Int. J. Uncertain., Fuzz. Knowl.-Based Syst. 10, 5, 557-570.
68. VAN RIJSBERGEN, C. 1986. A non-classical logic for information retrieval. Comput. J. 29, 6, 481-485.
69. VAN RIJSBERGEN, C. J. 1979. Information Retrieval. Butterworth.
70. WANG, L.,NOEL, S., AND JAJODIA, S. 2006. Minimum-cost network hardening using attack graphs. Comput. Commun. 29, 18, 3812-3824. (Pubitemid 44751132)
71. 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.
72. XIAO, X. AND TAO, Y. 2006. Personalized privacy preservation. In Proceedings of the ACM International Conference on Management of Data. 229-240.
73. YAN, H., GROSKY, W. I., AND FOTOUHI, F. 2008. Augmenting the power of LSI in text retrieval: Singular value rescaling. Data Knowl. Engin. 65, 1, 108-125.
74. ZHONG, S., YANG, Z., AND WRIGHT, R. N. 2005. Privacy-enhancing k-anonymization of customer data. In Proceedings of the ACM Symposium on Principles of Database Systems. 139-147.
75. ZOBEL, J. AND MOFFAT, A. 1995. Adding compression to a full-text retrieval system. Softw.-Practice Exper. 25, 8, 891-903.
76. ZOBEL, J. AND MOFFAT, A. 2006. Inverted files for text search engine. ACM Comput. Surv. 38, 2, 6.