THIRU SEVEN HILLS POLYTECHNIC COLLEGE MADURAVOYAL, CHENNAI-95.

DEPARTMENT OF COMPUTER ENGINEERING PROJECT LIST

SL. NO 1 2 3 4 5 6 7

TOPIC OF PROJECT Fuzzy Keyword Search over Encrypted Data in Cloud Computing Effective Personalized Privacy reservation Credit Card Fraud Detection Using Hidden Markov Model Ensuring Data Storage Security in Cloud Computing Adaptive Join Operators for Result Rate Optimization on Streaming Inputs Blogger-web-application An Abuse Free Fair Contract Signing Protocol Based on the RSA Signature

NO.OF. STUDENTS 5 5 6 5 6 5 5

HOD

PRINCIPAL

THIRU SEVEN HILLS POLYTECHNIC COLLEGE MADURAVOYAL, CHENNAI-95.

BRANCH/SEM NAME OF THE PROJECT

: Computer Engineering : Fuzzy Keyword Search over Encrypted Data in Cloud Computing 11501903 11501910 11501868 11501872 11501890

NAME OF THE PROJECT MEMBERS : 1. SRI HARI VARMA.B 2. VIGNESHWER.N 3. ARJUN.A 4. BALAKRISHNAN.M 5. PRAGADEESH.S

SYNOPSIS: 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. PROGRAMMING PACKAGE: Visual Studio.Net COST OF THE PROJECT: Rs.6000/GUIDENAME: Mr.R.Sukumar M.E.,

Guide

HOD

Principal

THIRU SEVEN HILLS POLYTECHNIC COLLEGE MADURAVOYAL, CHENNAI-95.

BRANCH/SEM NAME OF THE PROJECT

: Computer Engineering : Effective Personalized Privacy Preservation 11501893 11501889 11501892 11501876 11501909

NAME OF THE PROJECT MEMBERS : 1. PREMKUMAR.D 2. PRADEESH.P 3. PRAVEENKUMAR.V 4. DIWAKAR.N 5. VIGNESH.S

SYNOPSIS: The k-anonymity privacy requirement for publishing micro data requires that each equivalence class (i.e., a set of records that are indistinguishable from each other with respect to certain identifying attributes) contains at least k records. Recently, several authors have recognized that k-anonymity cannot prevent attribute disclosure. The notion of l-diversity has been proposed to address this; l-diversity requires that each equivalence class has at least well-represented (in Section 2) values for each sensitive attribute. In this paper, we show that l-diversity has a number of limitations. In particular, it is neither necessary nor sufficient to prevent attribute disclosure. Motivated by these limitations, we propose a new notion of privacy called closeness. We first present the base model t-closeness, which requires that the distribution of a sensitive attribute in any equivalence class is close to the distribution of the attribute in the overall table (i.e., the distance between the two distributions should be no more than a threshold t). t-closeness that offers higher utility. We describe our desiderata for designing a distance measure between two probability distributions and present two distance measures. We discuss the rationale for using closeness as a privacy measure and illustrate its advantages through examples and experiments. PROGRAMMING PACKAGE: Visual Studio.Net COST OF THE PROJECT: Rs.6000/GUIDENAME: Mrs.N.Kalpana B.E.,

Guide

HOD THIRU SEVEN HILLS POLYTECHNIC COLLEGE

Principal

MADURAVOYAL, CHENNAI-95.

BRANCH/SEM NAME OF THE PROJECT

: Computer Engineering

: Credit Card Fraud Detection Using Hidden Markov Model NAME OF THE PROJECT MEMBERS : 1. JANETHA.N 11501877 2. MUTHULAKSHMI.B 11501886 3. MALATHY.A 11501883 4. DEEPAPRIYA.R 11501873 5. REFICELIN.E 11501897 6. MOWNICA.A 11501884 SYNOPSIS: Now a day the usage of credit cards has dramatically increased. As credit card becomes the most popular mode of payment for both online as well as regular purchase, cases of fraud associated with it are also rising. In this paper, we model the sequence of operations in credit card transaction processing using a Hidden Markov Model (HMM) and show how it can be used for the detection of frauds. An HMM is initially trained with the normal behavior of a cardholder. If an incoming credit card transaction is not accepted by the trained HMM with sufficiently high probability, it is considered to be fraudulent. At the same time, we try to ensure that genuine transactions are not rejected. We present detailed experimental results to show the effectiveness of our approach and compare it with other techniques available in the literature.

PROGRAMMING PACKAGE: Visual Studio.Net COST OF THE PROJECT: Rs.6000/GUIDENAME: Mrs. G.Shalini B.E.,

Guide

HOD THIRU SEVEN HILLS POLYTECHNIC COLLEGE MADURAVOYAL, CHENNAI-95.

Principal

BRANCH/SEM NAME OF THE PROJECT

: Computer Engineering

: Ensuring Data Storage Security in Cloud Computing NAME OF THE PROJECT MEMBERS : 1. SWATHY.A 11501906 2. NIVETHA.B 11512655 3. SATHYA.B 11501900 4. SEETHALAKSHMI.A 11501901 5. RAJA SINDUJA.T.S 11501894 SYNOPSIS: Cloud computing has been envisioned as the next-generation architecture of IT enterprise. In contrast to traditional solutions, where the IT services are under proper physical, logical and personnel controls, cloud computing moves the application software and databases to the large data centers, where the management of the data and services may not be fully trustworthy. This unique attribute, however, poses many new security challenges which have not been well understood. In this article, we focus on cloud data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users' data in the cloud, we propose an effective and flexible distributed scheme with two salient features, opposing to its predecessors. By utilizing the homomorphic token with distributed verification of erasure-coded data, our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server (s). Unlike most prior works, the new scheme further supports secure and efficient dynamic operations on data blocks, including: data update, delete and append. Extensive security and performance analysis shows that the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server colluding attacks. PROGRAMMING PACKAGE: J2EE COST OF THE PROJECT: Rs.6000/GUIDENAME: Mrs.Vedavalli.S M.C.A.,M.B.A.,

Guide

HOD

Principal

THIRU SEVEN HILLS POLYTECHNIC COLLEGE MADURAVOYAL, CHENNAI-95.

BRANCH/SEM NAME OF THE PROJECT

: Computer Engineering : Adaptive Join Operators for Result Rate Optimization on Streaming Inputs

NAME OF THE PROJECT MEMBERS : 1. RANJITH.K 2. RANJITH.R 3. SABARIGIRI.K 4. SABARINATHAN.R 5. JAYAKUMAR.G 6. ARUNKUMAR.A 11501895 11501896 11501898 11501899 11501878 11501869

SYNOPSIS: MODERN information processing is moving into a realm where we often need to process data that are pushed or pulled from autonomous data sources through heterogeneous networks. Adaptive join algorithms have recently attracted a lot of attention in emerging applications where data are provided by autonomous data sources through heterogeneous network environments Their main advantage over traditional join techniques is that they can start producing join results as soon as the first input tuples are available, thus, improving pipelining by smoothing join result production and by masking source or network delays. In this project, we first propose Double Index NEsted-loops Reactive join (DINER), a new adaptive two-way join algorithm for result rate maximization. DINER combines two key elements: an intuitive flushing policy that aims to increase the productivity of in-memory tuples in producing results during the online phase of the join, and a novel reentrant join technique that allows the algorithm to rapidly switch between processing in-memory and disk-resident tuples, thus, better exploiting temporary delays when new data are not available We then extend the applicability of the proposed technique for a more challenging setup: handling more than two inputs. Multiple Index NEsted-loop Reactive join (MINER) is a multiway join operator that inherits its principles from DINER. Our experiments using real and synthetic data sets demonstrate that DINER outperforms previous adaptive join algorithms in producing result tuples at a significantly higher rate, while making better use of the available memory. Our experiments also shows that in the presence of multiple inputs, MINER manages to produce a high percentage of early results PROGRAMMING PACKAGE: Visual Studio.Net COST OF THE PROJECT: Rs.6000/GUIDENAME: Mr.P.Paulraj B.E., Guide HOD THIRU SEVEN HILLS POLYTECHNIC COLLEGE MADURAVOYAL, CHENNAI-95. Principal

BRANCH/SEM NAME OF THE PROJECT

: Computer Engineering : Blogger-web-application

NAME OF THE PROJECT MEMBERS : 1.VENKATARAMAN.C 2.SIVAPRAKASH.C 3.MUTHUKUMAR.R 4.YOSUVA.P 5.DHARANI.S SYNOPSIS:

11501907 11501902 11501885 11501913 11501874

This is a website that allows users to read and post their blogs. Only registered users can post blogs. Blogs can be deleted and modified by users. Unregistered users are allowed to search, read and comment on the blogs. Users can post something as well as create pages also. Regular features related to users like login, change password, change profile etc. are provided.

PROGRAMMING PACKAGE: Visual Studio.Net COST OF THE PROJECT: Rs.6000/GUIDENAME: Mrs. B.Saraswathy B.C.A.,

Guide

HOD

Principal

THIRU SEVEN HILLS POLYTECHNIC COLLEGE MADURAVOYAL, CHENNAI-95.

BRANCH/SEM NAME OF THE PROJECT

: Computer Engineering : An Abuse Free Fair Contract Signing Protocol Based on the RSA Signature

NAME OF THE PROJECT MEMBERS : 1.VINOTHKUMAR.D 2.KANNAN.V 3.KARTHICK.D 4.AVINASH.S.N 5.YUVARAJ.P 11501912 11501879 11501880 11501871 11501914

SYNOPSIS: A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a fair way, so that either each of them obtains the others signature, or neither party does. Based on the RSA signature scheme, a new digital contract signing protocol is proposed in this paper. Like the existing RSA-based solutions for the same problem, our protocol is not only fair, but also optimistic, since the third trusted party is involved only in the situations where one party is cheating or the communication channel is interrupted. Furthermore, the proposed protocol satisfies a new property, i.e., it is abuse-free. That is, if the protocol is executed unsuccessfully, none of the two parties can show the validity of intermediate results to others. Technical details are provided to analyze the security and performance of the proposed protocol. In summary, we present the first abuse-free fair contract signing protocol based on the RSA signature, and show that it is both secure and efficient. PROGRAMMING PACKAGE: Visual Studio.Net COST OF THE PROJECT: Rs.6000/GUIDENAME: Mr.P.Paulraj B.E.,

Guide

HOD

Principal

THIRU SEVEN HILLS POLYTECHNIC COLLEGE MADURAVOYAL, CHENNAI-95.

DEPARTMENT OF INFORMATION TECHNOLOGY PROJECT LIST

SL. NO

TOPIC OF PROJECT

NO.OF. STUDENTS

1.

AI AND OPINION MINING

HOD

PRINCIPAL

THIRU SEVEN HILLS POLYTECHNIC COLLEGE MADURAVOYAL, CHENNAI-95.

BRANCH/SEM NAME OF THE PROJECT

: Information Technology : AI AND OPINION MINING

NAME OF THE PROJECT MEMBERS : 1. ANANDHI.V 2. PRABHU.M 3. SELVARAJ.S 4. SHANRAJ.A 5. SHARMILEERANI.S.M 6. SIVAKUMAR.R 11501861 11501862 11501863 11501864 11501865 11501866

SYNOPSIS: The main goal of this project is to extracting, classifying, understanding and accessing the opinions expressed in various online news sources. Here opinion mining refers to computational techniques for analyzing the opinions that are extracted from various sources. Current opinion research focuses on business and e-commerce such as product reviews and movie ratings. We developed a framework for analysis with four major stages such as stakeholder analysis, topical analysis, sentiment analysis and stock modeling. During the stakeholder analysis stage, we identified the stakeholder groups participating in web forum discussions. In the topical analysis stage, the major topics of discussion driving communication in the Web forum are determined. The sentiment analysis stage consists of assessing the opinions expressed by the Web forum participants in their discussions. Finally, in the stock modeling stage, we examine the relationships between various attributes of web forum discussions and the firms stock behavior. Opinion target, opinion holder and opinion are the definitions used to extracting opinions from different online sources. An opinion can be expressed in two types. 1. Direct opinion, 2.Comparative opinion. All the opinions are stored in a document. Following are the steps to extracting the opinions. Identify the objects. Feature extraction and synonym grouping. Opinion orientation determination.

Integration.

PROGRAMMING PACKAGE: : Visual Studio.Net COST OF THE PROJECT: Rs.6000/GUIDENAME: Mrs.G.Mahalakshmi M.C.A., Guide HOD Principal