ComputePub Date : 2013-08-22DOI: 10.1145/2522548.2523132
Hasmukh Patel, D. Jinwala
{"title":"Modeling and analysis of internet key exchange protocolv2 and a proposal for its variant","authors":"Hasmukh Patel, D. Jinwala","doi":"10.1145/2522548.2523132","DOIUrl":"https://doi.org/10.1145/2522548.2523132","url":null,"abstract":"With the growing concerns on the information security and the capabilities of an attacker, Denial of Service (DoS) attacks have become one of the most serious and potent form of network security attacks. The attackers target the protocols to exhaust resources by either disabling the servers or disrupting the protocol exchange. In fact, almost all the communication protocols including TCP, HIP, etc. are vulnerable to resource exhaustion attacks. One of the ways of dealing with the DoS attacks is to carry out a cost analysis of the impact of the DoS attacks and ensure that the impact of the same is minimized to the extent possible. We illustrate the applicability of the same to analyze the Internet Key Exchange (IKE) version2 protocol. IKEv2 is one of the significant protocol of IPSec suite. It establishes the security association between source and destination before IPSec connection establishes. In this paper, we analyze IKEv2 protocol to show that IKE v2 is susceptible to DoS attacks.\u0000 To the best of our knowledge, although IKE v1 has been analyzed for susceptibility to the DoS attacks, IKE v2 has not yet been. We also propose a new variant of IKE v2 protocol using model given by Stebila and et al. to ensure mitigation of DoS attacks in IKEv2.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"23 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120916313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ComputePub Date : 2013-08-22DOI: 10.1145/2522548.2522607
J. Justin, A. Beegom
{"title":"Nearest neighbour based social recommendation using heat diffusion","authors":"J. Justin, A. Beegom","doi":"10.1145/2522548.2522607","DOIUrl":"https://doi.org/10.1145/2522548.2522607","url":null,"abstract":"Growth of the internet has lead to information overload. Recommender systems filter this vast amount of information and outputs useful information. They are traditionally based on users rating of items. But those systems were not useful for coldstart users i.e. users who have made very few purchases. So social recommenders began to evolve which makes use of social networks to improve recommendations. In this paper we propose a nearest neighbour based top N recommendation technique using social network. We model the data sources as graph and use heat diffusion process for generating recommendations. The experimental evaluation on the epinions dataset shows that our approach outperforms the approach that combines user based collaborative filtering approach and trust based approach.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116328710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ComputePub Date : 2013-08-22DOI: 10.1145/2522548.2523134
Divya Sharma, Akz Alam, P. Dasgupta, Debashis Saha
{"title":"A ranking algorithm for online social network search","authors":"Divya Sharma, Akz Alam, P. Dasgupta, Debashis Saha","doi":"10.1145/2522548.2523134","DOIUrl":"https://doi.org/10.1145/2522548.2523134","url":null,"abstract":"Online Social Networks have become the new arena for people to stay in touch, pursue their interests and collaborate. In October 2012, Facebook reported a whopping 1 billion users which is testimony of the fact how online social networks have proliferated and made inroads into the real world. Some of the obvious advantages of social networks are (1) 24X7 availability allowing users to stay in virtual touch at any time of the day, (2) get in touch with people who have similar interests and collaborate with them and (3) the ability to be able to search for users to add to one's friend circle. The third advantage is the focus of this paper. With the increasing number of users on online social networks, it is important that when a user searches for another user, appropriate results are returned. This paper identifies three criteria -- proximity, similarity and interaction, which can be used to rank search results so that more appropriate results are presented to the searching user. Also, this algorithm allows the search ranking to be customized according to the nature of the online social network in question.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126384367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ComputePub Date : 2013-08-22DOI: 10.1145/2522548.2523138
Tanmay Sinha, V. Srikanth, M. Sain, Hoon-Jae Lee
{"title":"Trends and research directions for privacy preserving approaches on the cloud","authors":"Tanmay Sinha, V. Srikanth, M. Sain, Hoon-Jae Lee","doi":"10.1145/2522548.2523138","DOIUrl":"https://doi.org/10.1145/2522548.2523138","url":null,"abstract":"With advancements in hardware and software capabilities, cloud computing has evolved into a widely utilized paradigm for pay per use and robust computation. An unparalleled repository of user sensitive data that resides on the cloud poses severe threat to the privacy of individuals. Users authenticate, store and perform computations on their data using cloud services. From the cloud's perspective, it gathers additional user data via ubiquitous devices, mines this information to offer personalized services like recommendations and disseminates the results. However, the interactions between the cloud and user at each stage of this pipeline development is limited by privacy concerns. In recent years, much work has been done on designing privacy preserving approaches for improving cloud security and the trust network. A wide array of data mining, cryptography and information hiding techniques have been applied to cater to different aspects of providing risk free work environment in the cloud. Given the lack of management of this information, a systematic investigation is required to structurally organize the topics studied. This paper aims to clearly portray the stringent and urgent need for applying privacy preserving approaches to the cloud and highlight the relevant work that has been done along these lines. The key objective is to identify important areas of user-cloud interaction and demonstrate a survey on the state of the art algorithms that have led to improved cloud privacy in these areas The focus is on exploring criteria for the impact of such approaches on user cloud interaction. An understanding of the research issues associated with these sensitive areas of cloud computing may enable us to better leverage benefits of the cloud and reflect on future possibilities of exploration.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"547 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122589776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ComputePub Date : 2013-08-22DOI: 10.1145/2522548.2522602
A. Saxena, I. Jain, M. C. Gorantla
{"title":"An integrated framework for enhancing privacy in online social networks","authors":"A. Saxena, I. Jain, M. C. Gorantla","doi":"10.1145/2522548.2522602","DOIUrl":"https://doi.org/10.1145/2522548.2522602","url":null,"abstract":"In recent times online social networks (OSN) have become one of the most widely used Internet applications with a very large number of users. In an OSN, the users exchange information via text, pictures and videos with their peers/friends for their personal or business interests. Since the information that flows across an OSN is generally of personal in nature, it is important that the users get assurance regarding their information is kept private to a level that they desire. In this paper, we analyze the potential problems with centralized OSNs and Distributed OSNs and then suggest an integrated framework which combines the advantages of these two frameworks and at the same time eliminates their drawbacks. The proposal is to have a framework with the familiar interface and applications that of the centralized OSNs and access control over the personal data like that of Distributed OSN.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130912867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ComputePub Date : 2013-08-22DOI: 10.1145/2522548.2522606
N. Kumar, A. Mathuria, M. Das, Kanta Matsuura
{"title":"Improving security and efficiency of time-bound access to outsourced data","authors":"N. Kumar, A. Mathuria, M. Das, Kanta Matsuura","doi":"10.1145/2522548.2522606","DOIUrl":"https://doi.org/10.1145/2522548.2522606","url":null,"abstract":"In time-bound access control, access to the system resources by authorized users is limited to specific time periods. In 2012, Vimercati, Foresti, Jajodia and Livraga proposed a scheme for time-bound access control to outsourced data in cloud using hierarchical key derivation structure. We show that their scheme has a security flaw. A user, after access right revocation, can still have access to the resources associated to his revoked subscription interval. There is a scheme by Wang, Li, Owens and Bhargava for efficient revocation in data outsourcing scenario. The main advantage of their scheme is that it does not require data block re-encryption and updates when any user's access right changes. It has a disadvantage that any change in access right of a single user, requires the data owner to recompute and distribute access certificates to all the users who requires further data access. In order to mitigate the security flaw of Vimercati et al. scheme, we present a solution based on the data access mechanism proposed by Wang et al. such that any user's access right revocation will be independent of other user's data access. Our solution removes their drawback without sacrificing other desirable properties of the original scheme.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"379 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115304695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ComputePub Date : 2013-08-22DOI: 10.1145/2522548.2523133
Pratik Narang, Jagan Mohan Reddy, C. Hota
{"title":"Feature selection for detection of peer-to-peer botnet traffic","authors":"Pratik Narang, Jagan Mohan Reddy, C. Hota","doi":"10.1145/2522548.2523133","DOIUrl":"https://doi.org/10.1145/2522548.2523133","url":null,"abstract":"The use of anomaly-based classification of intrusions has increased significantly for Intrusion Detection Systems. Large number of training data samples and a good 'feature set' are two primary requirements to build effective classification models with machine learning algorithms. Since the amount of data available for malicious traffic will often be small compared to the available traces of benign traffic, extraction of 'good' features which enable detection of malicious traffic is a challenging area of work.\u0000 This research work presents preliminary results of comparison of performance of three different feature selection algorithms - Correlation based feature selection, Consistency based subset evaluation and Principal component analysis-on three different Machine learning techniques- namely Decision trees, Naïve Bayes classifier, and Bayesian Network classifier. These algorithms are evaluated for the detection of Peer-to-Peer (P2P) based botnet traffic.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115899008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ComputePub Date : 2013-08-22DOI: 10.1145/2522548.2523139
Praveen Ranjan Srivastava, R. Kapoor, Rajat Gupta
{"title":"Study of the effect of a rule based classifier modeled anti-corruption body in a neural network based environment","authors":"Praveen Ranjan Srivastava, R. Kapoor, Rajat Gupta","doi":"10.1145/2522548.2523139","DOIUrl":"https://doi.org/10.1145/2522548.2523139","url":null,"abstract":"A rigorous debate is going on the rules on which the Lokpal (an anti-corruption body) should work. In this paper rules have been defined on which an anti-corruption body will take decisions on a particular case. Three agents have been used -- citizen, bureaucrat and whistle blower to model the environment using neural network. External factors are defined which would affect the working of the Lokpal. The Lokpal body is modeled using rule-based classifier. The decisions of the above Lokpal model on corruption cases are studied. The effects of change in the external factors on the rate of corruption are discussed.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128810633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ComputePub Date : 2013-08-22DOI: 10.1145/2522548.2523140
R. Bhargava, B. Tripathy, Anurag Tripathy, Rajkamal Dhull, Ekta Verma, P. Swarnalatha
{"title":"Rough intuitionistic fuzzy C-means algorithm and a comparative analysis","authors":"R. Bhargava, B. Tripathy, Anurag Tripathy, Rajkamal Dhull, Ekta Verma, P. Swarnalatha","doi":"10.1145/2522548.2523140","DOIUrl":"https://doi.org/10.1145/2522548.2523140","url":null,"abstract":"Data clustering algorithms are used in many fields like anonymisation of databases, image processing, analysis of satellite images and medical data analysis. There are several C-Means clustering algorithms in the literature. Besides the hard C-Means, there are uncertainty based C-Means algorithms like the Fuzzy C-Means algorithm and its variants, the Rough C-Means algorithm, the Intuitionistic Fuzzy C- Means algorithm and the hybrid C-Means algorithms (Rough Fuzzy C-Means algorithm). In this paper we propose a new hybrid clustering algorithm called Rough Intuitionistic Fuzzy C-Means and evaluate its performance in comparison to the other algorithms mentioned above. We have applied these algorithms on numerical as well as image data of two different types and used some benchmarking indexes for the evaluation of their performance. The results show that the proposed algorithm outperforms the existing algorithms in almost all cases.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124186629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ComputePub Date : 2013-08-22DOI: 10.1145/2522548.2523135
S. Nirmala, Shah Maulik, S. Bhanu
{"title":"SLA achievement by negotiation in a cloud","authors":"S. Nirmala, Shah Maulik, S. Bhanu","doi":"10.1145/2522548.2523135","DOIUrl":"https://doi.org/10.1145/2522548.2523135","url":null,"abstract":"The performance of a computing cloud depends on its agile response to the user needs and in the quality of the service provided. SLA assurance will increase user's confidence in the system by guaranteeing the cloud resources needed to users at certain point in the future. Negotiation between the cloud provider and consumer is necessary to achieve SLA. Haizea is an open source lease manager which can act as a scheduler for OpenNebula. It uses resource leases as resource allocation abstraction and executes these leases by allocating virtual machines. Haizea does not support negotiation currently. This work implements negotiation process using Haizea to provide SLA based lease admission. The experiment results show that the proposed method increases system utilization and maximizes the number of leases accepted as compared to Haizea's default policies.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133451539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}