A Novel Approach For Privacy Preservation In Blockchain Network Using Tensor Product And A Hybrid Swarm Intelligence

2021 ◽  
Vol 12 (4) ◽  
pp. 0-0
Keyword(s):  
Tensor Product ◽  
Swarm Intelligence ◽  
Privacy Preservation ◽  
Information Loss ◽  
Data Matrix ◽  
Sensitive Information ◽  
Hybrid Swarm ◽  
Novel Approach ◽  
Block Chain ◽  
Minimal Information

Therefore, block chain-based technique is developed for privacy protection using tensor product and a hybrid swarm intelligence based coefficient generation. Initially, the block chain data with mixed attributes was subjected to the privacy preservation process, in which the raw data matrix and solitude and utility (SU) coefficient were multiplied through the tensor product. Thus, the derivation of the SU coefficient, which handles both sensitive information and utility, was formulated as a searching problem. Then, the proposed algorithm was introduced to evaluate the SU coefficient. The performance of the developed technique was evaluated by means of accuracy and information loss. The achieved results have shown that the developed hybrid sward intelligence reached a maximal accuracy of 0.840 and minimal information loss of 0.159 using dataset-2, compared to the existing system.

Exponential Ant-Lion Rider Optimization for Privacy Preservation in Cloud Computing

2021 ◽  
pp. 1-19
Author(s):  
Nagaraju Pamarthi ◽  
N. Nagamalleswara Rao
Keyword(s):  
Cloud Computing ◽  
Optimization Algorithm ◽  
Privacy Preservation ◽  
Fitness Function ◽  
Information Loss ◽  
Superior Performance ◽  
Data Matrix ◽  
Sensitive Information ◽  
Bilinear Map ◽  
Ant Lion

The innovative trend of cloud computing is outsourcing data to the cloud servers by individuals or enterprises. Recently, various techniques are devised for facilitating privacy protection on untrusted cloud platforms. However, the classical privacy-preserving techniques failed to prevent leakage and cause huge information loss. This paper devises a novel methodology, namely the Exponential-Ant-lion Rider optimization algorithm based bilinear map coefficient Generation (Exponential-AROA based BMCG) method for privacy preservation in cloud infrastructure. The proposed Exponential-AROA is devised by integrating Exponential weighted moving average (EWMA), Ant Lion optimizer (ALO), and Rider optimization algorithm (ROA). The input data is fed to the privacy preservation process wherein the data matrix, and bilinear map coefficient Generation (BMCG) coefficient are multiplied through Hilbert space-based tensor product. Here, the bilinear map coefficient is obtained by multiplying the original data matrix and with modified elliptical curve cryptography (MECC) encryption to maintain data security. The bilinear map coefficient is used to handle both the utility and the sensitive information. Hence, an optimization-driven algorithm is utilized to evaluate the optimal bilinear map coefficient. Here, the fitness function is newly devised considering privacy and utility. The proposed Exponential-AROA based BMCG provided superior performance with maximal accuracy of 94.024%, maximal fitness of 1, and minimal Information loss of 5.977%.

scholarly journals Enhancement of k-anonymity algorithm for privacy preservation in social media

2018 ◽  
Vol 7 (2.18) ◽  
pp. 40
Author(s):  
Aanchal Sharma ◽  
Sudhir Pathak
Keyword(s):  
Social Network ◽  
Privacy Preservation ◽  
Research Work ◽  
Information Loss ◽  
Data Publishing ◽  
Similar Degree ◽  
Sensitive Information ◽  
Social Network Data ◽  
Traditional Research ◽  
The Social

In recent times, more and more social data is transmitted in different ways. Protecting the privacy of social network data has turn out to be an essential issue. Hypothetically, it is assumed that the attacker utilizes the similar information used by the genuine user. With the knowledge obtained from the users of social networks, attackers can easily attack the privacy of several victims. Thus, assuming the attacks or noise node with the similar environment information does not resemble the personalized privacy necessities, meanwhile, it loses the possibility to attain better utility by taking benefit of differences of users’ privacy necessities. The traditional research on privacy-protected data publishing can only deal with relational data and even cannot applied to the data of social networking. In this research work, K-anonymity is used for providing the security of the sensitive information from the attacker in the social network. K-anonymity provides security from attacker by making the graph and developing nodes degree. The clusters are made by grouping the similar degree into one group and the process is repeated until the noisy node is identified. For measuring the efficiency the parameters named as Average Path Length (APL) and information loss are measured. A reduction of 0.43% of the information loss is obtained.  

Protecting ECG Signals with Hybrid Swarm Intelligence Algorithm

2021 ◽  
pp. 47-60
Author(s):  
Ayushi Kirar ◽  
Siddharth Bhalerao ◽  
Om Prakash Verma ◽  
Irshad Ahmad Ansari
Keyword(s):  
Swarm Intelligence ◽  
Hybrid Swarm ◽  
Ecg Signals ◽  
Intelligence Algorithm ◽  
Swarm Intelligence Algorithm

Artificial Bee Colony-Based Approach for Privacy Preservation of Medical Data

2021 ◽  
pp. 1203-1221
Author(s):  
Shivlal Mewada ◽  
Sita Sharan Gautam ◽  
Pradeep Sharma
Keyword(s):  
Privacy Preservation ◽  
Artificial Bee Colony ◽  
Model Simulation ◽  
Privacy Preserving ◽  
Global Network ◽  
Sensitive Information ◽  
Healthcare Applications ◽  
Efficient Manner ◽  
Bee Colony ◽  
Proposed Model

A large amount of data is generated through healthcare applications and medical equipment. This data is transferred from one piece of equipment to another and sometimes also communicated over a global network. Hence, security and privacy preserving are major concerns in the healthcare sector. It is seen that traditional anonymization algorithms are viable for sanitization process, but not for restoration task. In this work, artificial bee colony-based privacy preserving model is developed to address the aforementioned issues. In the proposed model, ABC-based algorithm is adopted to generate the optimal key for sanitization of sensitive information. The effectiveness of the proposed model is tested through restoration analysis. Furthermore, several popular attacks are also considered for evaluating the performance of the proposed privacy preserving model. Simulation results of the proposed model are compared with some popular existing privacy preserving models. It is observed that the proposed model is capable of preserving the sensitive information in an efficient manner.

Use of Purpose and Role Based Access Control Mechanisms to Protect Data Within RDBMS

2020 ◽  
Vol 8 (1) ◽  
pp. 82-91
Author(s):  
Suraj Krishna Patil ◽  
Sandipkumar Chandrakant Sagare ◽  
Alankar Shantaram Shelar
Keyword(s):  
Access Control ◽  
Privacy Preservation ◽  
Original Data ◽  
Sensitive Information ◽  
Role Based Access Control ◽  
Control Mechanisms ◽  
Sensitive Data ◽  
Access To Resources ◽  
Key Factor ◽  
Role Based

Privacy is the key factor to handle personal and sensitive data, which in large chunks, is stored by database management systems (DBMS). It provides tools and mechanisms to access and analyze data within it. Privacy preservation converts original data into some unknown form, thus protecting personal and sensitive information. Different access control mechanisms such as discretionary access control, mandatory access control is used in DBMS. However, they hardly consider purpose and role-based access control in DBMS, which incorporates policy specification and enforcement. The role based access control (RBAC) regulates the access to resources based on the roles of individual users. Purpose based access control (PuBAC) regulates the access to resources based on purpose for which data can be accessed. It regulates execution of queries based on purpose. The PuRBAC system uses the policies of both, i.e. PuBAC and RBAC, to enforce within RDBMS.

scholarly journals Opposition Intensity-Based Cuckoo Search Algorithm for Data Privacy Preservation

2019 ◽  
Vol 29 (1) ◽  
pp. 1441-1452 ◽  
Author(s):  
G.K. Shailaja ◽  
C.V. Guru Rao
Keyword(s):  
Data Mining ◽  
Data Privacy ◽  
Privacy Preservation ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Original Data ◽  
Cuckoo Search Algorithm ◽  
Research Issues ◽  
Novel Approach ◽  
Two Phases

Abstract Privacy-preserving data mining (PPDM) is a novel approach that has emerged in the market to take care of privacy issues. The intention of PPDM is to build up data-mining techniques without raising the risk of mishandling of the data exploited to generate those schemes. The conventional works include numerous techniques, most of which employ some form of transformation on the original data to guarantee privacy preservation. However, these schemes are quite multifaceted and memory intensive, thus leading to restricted exploitation of these methods. Hence, this paper intends to develop a novel PPDM technique, which involves two phases, namely, data sanitization and data restoration. Initially, the association rules are extracted from the database before proceeding with the two phases. In both the sanitization and restoration processes, key extraction plays a major role, which is selected optimally using Opposition Intensity-based Cuckoo Search Algorithm, which is the modified format of Cuckoo Search Algorithm. Here, four research issues, such as hiding failure rate, information preservation rate, and false rule generation, and degree of modification are minimized using the adopted sanitization and restoration processes.

Sign in / Sign up

Export Citation Format

Share Document