Log files are primary source of information for identifying the System threats and problems that occur in the System at any point of time. These threats and problem in the system can be identified by analyzing the log file and finding the patterns for possible suspicious behavior. The concern administrator can then be provided with appropriate alter or warning regarding these security threats and problems in the system, which are generated after the log files are analyzed. Based upon this alters or warnings the administrator can take appropriate actions. Many tools or approaches are available for this purpose, some are proprietary and some are open source. This paper presents a new approach which uses a MapReduce algorithm for the purpose of log file analysis, providing appropriate security alerts or warning. The results of this system can then be compared with the tools available.

No abstract

The cloud computing paradigm is being used because there is no need to setup additional IT infrastructure such as hardware and software, its low up-front cost. Security and privacy of data is important in day to today life especially for applications that uses cloud computing such as social media. Customer information that is stored at Cloud is crucial that needs to be protected against potential intruders. There is threat to maintain the data in transit and data at cloud due to different possible attacks. Due to this there is growing need of privacy and security of data. In this paper, the privacy and issues, privacy preservation techniques are addressed. In addition to this, in order to protect the data, the secret sharing algorithm is implemented and analyzed. The shamir’s secret sharing (k,n) algorithm is used to split the data into n partial shares which can be distributed in cloud. The user collects at least k partial shares to reconstruct the complete data. It is observed that if the file size is increased, the data recovery time is also increased. The paper concludes with privacy preservation guidelines.

No abstract

In cloud computing, immediate access of resources is important due to cost incurred to customer by pay per use model of cloud computing. Usually resource is protected by using cryptography technique. The resource may be shared by multiple members in group. There can be overlapping members to access the multiple resources. Group key management is important to form the group key to access the resource. Group key formation time is crucial for immediate access of protected resource in cloud computing. Thus ternary tree based approach is proposed to form the key for overlapping members accessing resources. Membership event such as join and leave also considered. Through the analysis, it is found that computational overhead is reduced by 23% if ternary key trees are combined than independent ternary key trees. It is also observed that combined ternary key tree outperforms the combined binary key tree approach for group key formation by considering overlapping members. Security requirement analysis of group membership for key formation is also provided in the paper.Copyright c 2017 Institute of Advanced Engineering and Science.All rights reserved.Corresponding Author: Amar Buchade Research Scholar College of Engineering, Pune Savitribai Phule Pune University amar.buchade@gmail.com INTRODUCTIONIn recent days, the use of cloud computing is increasing. Usage of cloud based social media applications whatsapp, twitter, facebook and collaborative applications, Pay TV [1] systems are increasing. Many governments have initiated digital move including cashless transactions, m-wallet etc. Thus security is major concern over the usage of many cloud based applications. Obviously there is important role of cryptographic algorithm to secure the resource. Resource can be considered as data, applications, storage, CPU, virtual machine etc. Thus key management plays significance role to access the resources from cloud computing.In cloud computing, it is important to have instant (on demand) access of resources. It is important to form the group key within a time for immediate access of resources. For collaborative environment, group key among the members needs to be formed to protect the access of resources in cloud computing. There can be member accessing multiple resources. Such member in group/s is called overlapping member. Thus in this paper, the problem of overlapping members accessing multiple resources is proposed.Group key can be formed by TGDH approach [2], [3]. Presently for group key formation separate key trees are formed even if member has access to multiple resources. This approach leads to computational overhead to form the group key.We preferred ternary key tree approach over binary tree based approach for group key formation because as the number of members increased in ternary key tree, the height is also reduced compared to binary. Hence computational cost for forming group key is also reduced. The novelty of the approach is that it is computational efficient that the other approaches.