International Journal of Engineering and Techniques - Volume 4 Issue 1, Jan – Feb 2018 ISSN: 2395-1303 http://www.ijetjournal.org Page 598 Enhancing Personalized Web Search Protection Using Cryptography Algorithm 1 Mr. S. Dhinakaran, 2 Dr. J. Thirumaran 1 Research Scholar, Rathinam College of Arts & Science, Coimbatore. 2 Professor, Dept of Comp. Science,Rathinam College of Arts & Science, Coimbatore. 1. INTRODUCTION Current web search engines are built to serve all users, independent of the special needs of any individual user. With the exponential growth of the available information on the World Wide Web, a traditional search engine, even if based on sophisticated document indexing algorithms, has difficulty meeting efficiency and effectiveness performance demanded by users searching for relevant information. Personalization of web search is to carry out retrieval for each user incorporating his/her interests. Personalized web search differs from generic web search, which returns identical results to all users for identical queries, regardless of varied user interests and information needs. When queries are issued to search engine, most return the same results to users. In fact, the vast majority of queries to search engines are short and ambiguous. Different users may have completely different information needs and goals when using precisely the same query. RESEARCH ARTICLE OPEN ACCESS Abstract: Over the last twenty years, there has been a extensive growth in the amount of private data collected about individuals. This data comes from a number of sources including medical, financial, library, telephone, and shopping records. Such data can be integrated and analyzed digitally as it’s possible due to the rapid growth in database, networking, and computing technologies. On the one hand, this has led to the development of data mining tools that aim to infer useful trends from this data. But, on the other hand, easy access to personal data poses a threat to individual privacy. On the other hand privacy regulations and other privacy concerns may prevent data owners from sharing information for data analysis. In order to share data while preserving privacy data owner must come up with a solution which achieves the dual goal of privacy preservation as well as accurate clustering result. Some experimental results are presented which tries to finds the optimum value of segment size and quantization parameter which gives optimum in the tradeoff between clustering utility and data privacy in the input dataset. This research work protects the information about PWS applications that model user preferences as hierarchical user profiles. In this paper, proposes a PWS framework called UPS that can adaptively generalize profiles by queries while respecting user specified privacy requirements. It aims at providing protection against a typical model of privacy attack using the cryptography algorithm. Keywords — Privacy, Personalization, Web, Search, Cryptography, Algorithm.