E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree

Abstract

Data security has become crucial to most enterprise and government applications due to the increasing amount of data generated, collected, and analyzed. Many algorithms have been developed to secure data storage and transmission. However, most existing solutions require multi-round functions to prevent differential and linear attacks. This results in longer execution times and greater memory consumption, which are not suitable for large datasets or delay-sensitive systems. To address these issues, this work proposes a novel algorithm that uses, on one hand, the reflection property of a balanced binary search tree data structure to minimize the overhead, and on the other hand, a dynamic offset to achieve a high security level. The performance and security of the proposed algorithm were compared to Advanced Encryption Standard and Data Encryption Standard symmetric encryption algorithms. The proposed algorithm achieved the lowest running time with comparable memory usage and satisfied the avalanche effect criterion with 50.1%. Furthermore, the randomness of the dynamic offset passed a series of National Institute of Standards and Technology (NIST) statistical tests.

ARTPHIL: Reversible De-identification of Free Text Using an Integrated Model

“…The proposed de-identification system ARTPHIL consists of two key components that are integrated to de-identify unstructured textual data as follow: 1) the core of the Philter package [9] for the PHI detection process onlynot for the replacement, and 2) the E-ART encryption algorithm [10] for replacement strategy. Fig.…”

“…However, The existing encryption standards rely on increasing the key size and the number of rounds to enhance security which could negatively affect the performance [29] [30]. E-ART is a new lightweight encryption algorithm that was proposed in [10] to address the speed requirement by modern application. It uses the concept of a balanced binary tree with ASCII conversion and random key generation.…”

“…To achieve our goal of developing reversible de-identification, all tokens marked as PHI, and unmarked tokens will be replaced with generated strings that can be retrieved. For this purpose, we used E-ART, the lightweight encryption algorithm proposed in [10]. This algorithm uses the idea of the balanced binary tree along with an ASCII table for character substitution; this increases searching efficiency and reduces processing time as reported in [10].…”

“…As a result, there is a need for a new reversible model for de-identifying unstructured data to reduce the risks for data subjects, address the requirements of preserving privacy while supporting data's use. This study addresses this need by integrating Philter [9], the information extracting tool, with the lightweight encryption algorithm E-ART [10]. This process's primary contribution is 1) a reversible, fast de-identification model ARTPHIL to de-identify unstructured textual health data cost-effectively without compromising security.…”

“…This results in data distortion and, hence, the substantial loss of knowledge within the data.To address this issue, this paper introduces the concept of reversible data deidentification methods to de-identify unstructured health data under the Health Insurance Portability and Accountability Act (HIPAA) guidelines. The model integrates Philter [9], the state-of-the-art tool for extracting personal identifiers from free-text, to detect confidential information and encrypt them with E-ART, lightweight encryption algorithm E-ART [10]. The performance of the proposed model ARTPHIL is evaluated using i2b2 data corpus in terms of recall, precision, F-measure and execution time.…”