V. Valli Kumari

Understanding User Behavior using Web Usage Mining

usage mining is about analyzing the user interactions with a web server based on resources like web logs, click streams and database transactions. It helps in discovering the browsing patterns of the user and in relating the pages visited by him. This knowledge can be of help in making business decisions, refining the web site design to derive personalized pages. Web usage mining uses the data mining and the incremental mining techniques to extract the user usage patterns and study the visiting characteristics of the user. Normally, the source for all this data is the web server log, which changes dynamically. Conventional data mining techniques were proposed to be inefficient, as they need to be re-executed every time the log changes which in turn requires multiple database scans. This paper discusses an algorithm to suit the dynamically changing log scenario, based on association rule mining with incremental technique. The algorithm proved to be more efficient as there are redundant no of scans of database; it avoids the generation of candidate keys and allows interactive mining with different supports. The experimental results proving this claim are given in this paper.

Formal Verification of IEEE802.16m PKMv3 Protocol Using CasperFDR

IEEE 802.16m is the standard representing the security architecture for multi hop relay of broadband wireless access. The security sublayer is provided within IEEE 802.16m MAC layer for privacy and access control, which includes the Privacy and Key Management (PKM) protocol. This paper models the PKMv3 key agreement protocol using CasperFDR and analyzes the output. A few Attacks are found in this version. The specifications through which these attacks are found are presented.

Molecular docking and dynamic simulation studies evidenced plausible immunotherapeutic anticancer property by Withaferin A targeting indoleamine 2,3-dioxygenase

Indoleamine 2,3-dioxygenase (IDO) is emerging as an important new therapeutic drug target for the treatment of cancer characterized by pathological immune suppression. IDO catalyzes the rate-limiting step of tryptophan degradation along the kynurenine pathway. Reduction in local tryptophan concentration and the production of immunomodulatory tryptophan metabolites contribute to the immunosuppressive effects of IDO. Presence of IDO on dentritic cells in tumor-draining lymph nodes leading to the activation of T cells toward forming immunosuppressive microenvironment for the survival of tumor cells has confirmed the importance of IDO as a promising novel anticancer immunotherapy drug target. On the other hand, Withaferin A (WA) – active constituent of Withania Somnifera ayurvedic herb has shown to be having a wide range of targeted anticancer properties. In the present study conducted here is an attempt to explore the potential of WA in attenuating IDO for immunotherapeutic tumor arresting activity and to elucidate the underlying mode of action in a computational approach. Our docking and molecular dynamic simulation results predict high binding affinity of the ligand to the receptor with up to −11.51 kcal/mol of energy and 3.63 nM of IC50 value. Further, de novo molecular dynamic simulations predicted stable ligand interactions with critically important residues SER167; ARG231; LYS377, and heme moiety involved in IDO’s activity. Conclusively, our results strongly suggest WA as a valuable small ligand molecule with strong binding affinity toward IDO.

Outliers Detection as Network Intrusion Detection System Using Multi Layered Framework

Outlier detection is a popular technique that can be utilized for finding Intruders. Security is becoming a critical part of organizational information systems. Network Intrusion Detection System ( NIDS) is an important detection system that is used as a counter measure to preserve data integrity and system availability from attacks [2]. However, current researches find that it is extremely difficult to find out outliers directly from high dimensional datasets. In our work we used entropy method for reducing high dimensionality to lower dimensionality, where the processing time can be saved without compromising the efficiency. Here we proposed a framework for finding outliers from high dimensional dataset and also presented the results. We implemented our proposed method on standard dataset kddcup’99 and the results shown with the high accuracy.

Secure Group Key Distribution Using Hybrid Cryptosystem

In group-oriented applications like conferencing, chat groups and interactive gaming myriad messages are sent from one or more sources to multiple users. Multicasting is the optimum technique for such group oriented applications with effective network resource utilization. But maintaining security is a critical issue in group oriented protocols with frequent membership changes. Confidentiality can be achieved through changing the key material, known as rekeying every time a new member joins the group or existing member leaves from the group. Many techniques have been proposed earlier for this purpose. In centralized approach, a single key server is responsible to generate and distribute keys. In decentralized approach, a hierarchy of key managers distributes the keys. In distributed key-agreement protocol, the group members collectively generate and distribute a group key. This paper uses combination of both de-centralized and key agreement approaches to prevent a single point of failures and to improve the reliability as well as the performance of the system. This paper proposes new a technique(SGKP-1), using hybrid key trees, has certain advantages like secure channel establishment for the distribution of the key material, reducing the storage requirements and burden at each member, minimization of time requirement to become a new member of a group. The computational complexity further reduced using both the combination of public and private key crypto systems.

An Effective Calculation of Reputation in P2P Networks

With the advent of sophisticated networking technologies and the related applications, more and more computers are getting hooked to the Internet. This is mainly for utilizing several services ranging from information sharing to electronic transactions. P2P networks which allow decentralized systems, have posed problems related to trust when transactions have to be carried out. Current literature proposes several solutions for trust management and reputation computation. The solutions base their assessment of reputations on the number of successful transactions or on the similarity of the feedbacks. There are some concerns in the feedback ratings if we are not considering the issues like number of transactions, frequency of transactions with the same peer and different peers, age of transaction, how frequently a given peer attends a common vendor, and the number of common vendors between the pairs. This paper puts forward a reputation computation system addressing these concerns. It implicitly allows detection of malicious peers. It also incorporates a corrective mechanism, if the feedbacks are from more number of malicious peers. The implementations and the results that support our claims are also presented.

MobiCoin: digital cash for m-commerce

Advances in mobile device technology have given rise to applications that rely on trusted hardware These have also made the once only virtually possible ideas into real applications One such application is transforming the mobile phone into a mobile wallet with digital cash that supports both anonymity (as in real cash) and security In this paper, we introduce MobiCoin, a protocol to support M-commerce transactions It employs SIM cards for data protection and active certificates for distributed trust MobiCoin is secure, durable, fair, atomic and accountable It may be used as a digital cash protocol with a mobile digital wallet without the trade-off for anonymity In addition, it is an offline protocol, thus increasing the efficiency and availability of m-commerce transactions The paper describes the model, the infrastructure, and the details of the protocol It also discusses some implementation issues and security implications of using the protocol.

A novel rough set attribute reduction based on ant colony optimisation

Rough Sets RS, the most promising and proven approach for data reduction, has the ability to retain the essence of the data and it does not expect any domain inputs from an expert. RS based reduction however can attain only local minima, so to elaborate the search space it is wise to employ well known and proven artificial intelligence techniques like the ant colony optimisation ACO. In this work a novel rough set attribute reduction based on ACO, called as NRSACO is proposed, which can identify global optimal attribute set with the help of rough set based mutual information as a heuristic aid for the ants. Few improvements were suggested through which minimum reducts were attained faster and with fewer ants and iterations. Experiments were conducted on 22 UCI datasets, and the results shows that our approach has outperformed in convergence time with comparable or improved classification accuracies.

Formal Verification of IEEE802.11i WPA-GPG Authentication Protocol

IEEE802.11i is the standard designed to provide secured communication of wireless LAN. The IEEE802.11i specification contains WPA-GPG authentication protocol. It allows a wireless station to gain access to a protected wireless network managed by access point. This paper models the WPA-GPG authentication protocol by formal verification using CasperFDR and analyzes the output. A few attacks are found in this protocol. The specifications through which these attacks are found are presented.

Trust Based Participant Driven Privacy Control in Participatory Sensing

Widespread use of sensors and multisensory personal devices generate a lot of personal information. Sharing this information with others could help in various ways. However, this information may be misused when shared with all. Sharing of information between trusted parties overcomes this problem. This paper describes a model to share information based on interactions and opinions to build trust among peers. It also considers institutional and other controls, which influence the behaviour of the peers. The trust and control build confidence. The computed confidence bespeaks whether to reveal information or not thereby increasing trusted cooperation among peers.