Some dot.net Project Abstracts

Some dot.net projects from final-sem-projects.blogspot.in Fuzzy Keyword Search over Encrypted Data in Cloud Computing - IEEE Project - ASP.NET Project Details Project Code DWA113 Title Fuzzy Keyword Search over Encrypted Data in Cloud Computing - IEEE Project - ASP.NET Project Type ASP.NET Website Front End Microsoft Visual Studio 2008 (.Net 2008) Back End Microsoft SQL Server 2005 Project Cost Rs. 3999/-Rs. 1990/- (Offer Price) About the Project Abstract: As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. Although traditional searchable encryption schemes allow a user to securely search over encrypted data through keywords and selectively retrieve files of interest, these techniques support only exact keyword search. In this paper, for the first time we formalize and solve the problem of effective fuzzy keyword search over encrypted cloud data while maintaining keyword privacy. Fuzzy keyword search greatly enhances system usability by returning the matching files when users’ searching inputs exactly match the predefined keywords or the closest possible matching files based on keyword similarity semantics, when exact match fails. In our solution, we exploit edit distance to quantify keywords similarity and develop two advanced techniques on constructing fuzzy keyword sets, which achieve optimized storage and representation overheads. We further propose a brand new symbol-based trie-traverse searching scheme, where a multi-way tree structure is built up using symbols transformed from the resulted fuzzy keyword sets. Through rigorous security analysis, we show that our proposed solution is secure and privacy-preserving, while correctly realizing the goal of fuzzy keyword search. Extensive experimental results demonstrate the efficiency of the proposed solution. ======================= Publishing Search Logs - A Comparative Study of Privacy Guarentees (DWI101) Project Details Project Code DWI101 Title Publishing Search Logs - A Comparative Study of Privacy Guarentees Project Type ASP.NET Website Front End Microsoft Visual Studio 2010 (.Net 2010) Back End Microsoft SQL Server 2008 Project Cost Rs. 2500/- About the Project Search engine companies collect the “database of intentions,” the histories of their users’ search queries. These search logs are a gold mine for researchers. Search engine companies, however, are wary of publishing search logs in order not to disclose sensitive information. In this paper we analyze algorithms for publishing frequent keywords, queries and clicks of a search log. We first show how methods that achieve variants of k-anonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by epsilon-differential privacy unfortunately does not provide any utility for this problem. We then propose a novel algorithm ZEALOUS and show how to set its parameters to achieve (epsilon, delta)-probabilistic privacy. We also contrast our analysis of ZEALOUS with an analysis by Korolova et al. that achieves (epsilon’, delta’)-indistinguishability. Our paper concludes with a large experimental study using real applications where we compare ZEALOUS and previous work that achieves k-anonymity in search log publishing. Our results show that ZEALOUS yields comparable utility to k-anonymity while at the same time achieving much stronger privacy guarantees.