Optimal Elliptic Curve Cryptography-Based Effective Approach for Secure Data Storage in Clouds

2020 ◽  
Vol 11 (4) ◽  
pp. 65-81
Author(s):  
Anju Malik ◽  
Mayank Aggarwal ◽  
Bharti Sharma ◽  
Akansha Singh ◽  
Krishna Kant Singh

With the rapid development of cloud advancement, a data security challenge has emerged. In this paper, a technique based on elliptical cryptography and cuckoo search algorithm is proposed. With this technique, data owners securely store their data files in the cloud server. Initially the user sends a file storage request to store a file in a cloud server provider (CSP). The input file is checked whether it is sensitive or non-sensitive by the user. If the file is sensitive, then it would be split and stored in different virtual machines (VMs), and if the file is non-sensitive, then it would be assigned in a single VM. This approach was used for the first time as per the survey. To add further security, the sensitive data retrieval needs an encryption process that is supported by the proposed algorithm. If the data owner stores the sensitive data to cloud server, the data owner's document is encrypted by the double encryption technique. Here RSA and optimal elliptic curve cryptography (OECC) algorithm is used to encrypt the document with high security. The authors have used cuckoo search algorithm to identify the optimal key in ECC. This paper has proposed a novel cryptography approach for delivering mass distributed storage by which user's original data cannot be directly reached by cloud operators. Hence, this research has proved that the proposed work will give better securable data storage solving the security issues.

Author(s):  
G. Murugaboopathi ◽  
V. Gowthami

Privacy preservation in data publishing is the major topic of research in the field of data security. Data publication in privacy preservation provides methodologies for publishing useful information; simultaneously the privacy of the sensitive data has to be preserved. This work can handle any number of sensitive attributes. The major security breaches are membership, identity and attribute disclosure. In this paper, a novel approach based on slicing that adheres to the principle of k-anonymity and l-diversity is introduced. The proposed work withstands all the privacy threats by the incorporation of k-means and cuckoo-search algorithm. The experimental results with respect to suppression ratio, execution time and information loss are satisfactory, when compared with the existing approaches.


Security of data stored in the cloud databases is a challenging and complex issue to be addressed due to the presence of malicious attacks, data breaches and unsecured access points. In the past, many researchers proposed security mechanisms including access control, intrusion detection and prevention models, Encryption based storage methods and key management schemes. However, the role based access control policies that were developed to provide security for the data stored in cloud databases based on the sensitivity of the information are compromised by the attackers through the misuse of privileges gained by them from multiple roles. Therefore, it is necessary to propose more efficient mechanisms for securing the sensitive information through attribute based encryption by analyzing the association between the various attributes. For handling the security issue related to the large volume of cloud data effectively, the association rule mining algorithm has been extended with temporal constraints in this work in order to find the association among the attributes so that it is possible to form groups among the attributes as public attributes with insensitive data, group attributes with medium sensitive data and owner with highly sensitive attributes and data for enhancing the strength of attribute based encryption scheme. Based on the associations among the attributes and temporal constraints, it is possible to encrypt the sensitive data with stronger keys and algorithms. Hence, a new key generation and encryption algorithm is proposed in this paper by combining the Greatest common divisor and the Least common multiple between the primary key value and the first numeric non key attribute that is medium sensitive attributes and data present in the cloud database for providing secured storage through effective attribute based encryption. Moreover, a new intelligent algorithm called Elliptic Curve Cryptography with Base100 Table algorithm is also proposed in this paper for performing encryption and decryption operations over the most sensitive data for the data owners. From the experiments conducted in this work, it is observed that the proposed model enhances the data security by more than 5% when it is compared with other existing secured storage models available for cloud


2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.


Author(s):  
Yang Wang ◽  
Feifan Wang ◽  
Yujun Zhu ◽  
Yiyang Liu ◽  
Chuanxin Zhao

AbstractIn wireless rechargeable sensor network, the deployment of charger node directly affects the overall charging utility of sensor network. Aiming at this problem, this paper abstracts the charger deployment problem as a multi-objective optimization problem that maximizes the received power of sensor nodes and minimizes the number of charger nodes. First, a network model that maximizes the sensor node received power and minimizes the number of charger nodes is constructed. Second, an improved cuckoo search (ICS) algorithm is proposed. This algorithm is based on the traditional cuckoo search algorithm (CS) to redefine its step factor, and then use the mutation factor to change the nesting position of the host bird to update the bird’s nest position, and then use ICS to find the ones that maximize the received power of the sensor node and minimize the number of charger nodes optimal solution. Compared with the traditional cuckoo search algorithm and multi-objective particle swarm optimization algorithm, the simulation results show that the algorithm can effectively increase the receiving power of sensor nodes, reduce the number of charger nodes and find the optimal solution to meet the conditions, so as to maximize the network charging utility.


Sign in / Sign up

Export Citation Format

Share Document