期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：5
出版社：S.S. Mishra
摘要：Search engine companies gathering database information and histories of the users from search queries. These search details are useful for the researchers. Search engine companies are releasing different search details in order not to release perceptive information of the users. In this paper, I analyze the various algorithms for publishing relevant keywords, queries, and clicks of search details. I have to show how methods that achieve difference of k-anonymity are vulnerable to active attacks. Then i demonstrate that the stronger guarantee ensured by e-differential secured unfortunately does not provide any utility for this issue. I then implement an algorithm and show how to set its parameters to achieve probabilistic privacy. My paper concludes with a detailed study using real applications where the algorithm and previous work that achieves k-anonymity in search details releasing. My results show that the algorithm gives comparable utility to k-anonymity while at the same time achieving much stronger secured details
关键词：information storage and retrieval; db management; web search; IT and systems Security; protection
