Selective Encryption Algorithm Research Articles

A Chaos-based Tunable Selective Encryption Algorithm for H.265/HEVC with Semantic Understanding

A Chaos-based Tunable Selective Encryption Algorithm for H.265/HEVC with Semantic Understanding

Reversibly selective encryption for medical images based on coupled chaotic maps and steganography

The security and confidentiality of medical images are of utmost importance due to frequent issues such as leakage, theft, and tampering during transmission and storage, which seriously impact patient privacy. Traditional encryption techniques applied to entire images have proven to be ineffective in guaranteeing timely encryption and preserving the privacy of organ regions separated from the background. In response, this study proposes a specialized and efficient local image encryption algorithm for the medical field. The proposed encryption algorithm focuses on the regions of interest (ROI) within massive medical images. Initially, the Laplacian of Gaussian operator and the outer boundary tracking algorithm are employed to extract the binary image and achieve ROI edge extraction. Subsequently, the image is divided into ROI and ROB (regions outside ROI). The ROI is transformed into a row vector and rearranged using the Lorenz hyperchaotic system. The rearranged sequence is XOR with the random sequence generated by the Henon chaotic map. Next, the encrypted sequence is arranged according to the location of the ROI region and recombined with the unencrypted ROB to obtain the complete encrypted image. Finally, the least significant bit algorithm controlled by the key is used to embed binary image into the encrypted image to ensure lossless decryption of the medical images. Experimental verification demonstrates that the proposed selective encryption algorithm for massive medical images offers relatively ideal security and higher encryption efficiency. This algorithm addresses the privacy concerns and challenges faced in the medical field and contributes to the secure transmission and storage of massive medical images.

A robust VVC video encryption scheme based on the dynamical chaotification model

With the considerable surge of video assets, the demand for video content security has undergone substantial growth. Since the advent of H.264/AVC and H.265/HEVC, selective encryption algorithms (SEAs) have become a focus. However, there is little research based on the H.266/VVC. To fill the gap, a VVC encryption scheme is proposed in this paper. Considering that most existing SEAs are easily cracked under cryptographic attacks, a dynamical chaotification model (DCM) is designed to resist chosen-plaintext attack (CPA). Additionally, given that a majority of existing SEAs are incapable of decrypting correctly in the case of packet loss, each slice is encrypted independently to enhance robustness. Firstly, the three-dimensional (3D) DCM is designed based on the exponential feedback and the boundary function. Secondly, the dynamical parameter in the 3D-DCM is updated by the encoding parameters in the VVC encoder. Then the initial values and other model parameters of the 3D-DCM are scrambled by the hash values of the slice headers (SHs). Finally, the texture, motion, and structure information of VVC videos are encrypted using the iterative output of the 3D-DCM. In particular, three exclusive elements in H.266/VVC are selected in the RSES, including matrix-based intra prediction (MIP), cross-component linear model prediction (CCLM), and multiple transform selection (MTS). Experimental results demonstrate the outstanding performance of the proposed RSES in robustness and resistance to CPA, while gratifying bit rate and real-time requirements. Therefore, it is a promising encryption scheme in cryptographic applications.

A variable dimensional chaotic map-based medical image encryption algorithm with multi-mode.

Since the COVID-19 pandemic, telemedicine or non-face-to-face medicine has increased significantly. In practice, various types of medical images are essential to achieve effective telemedicine. Medical image encryption algorithms play an irreplaceable role in the fast and secure transmission and storage of these medical images. However, most of the existing medical image encryption algorithms are full encryption algorithms, which are inefficient and time-consuming, so they are not suitable for emergency medical scenarios. To improve the efficiency of encryption, a small number of works have focused on partial or selective encryption algorithms for medical images, in which different levels of encryption strategies were adopted for different information content regions of medical images. However, these encryption algorithms have inadequate security more or less. In this paper, based on the Logistic map, we designed an improved variable dimension map. Then, an encryption algorithm for medical images was proposed based on it. This algorithm has two modes: (1) full encryption mode and (2) semi-full encryption mode, which can better adapt to different medical scenarios, respectively. In full encryption mode, all pixels of medical images are encrypted by using the confusion-diffusion structure. In semi-full encryption mode, the region of interest of medical images is extracted. The confusion was first adopted to encrypt the region of interest, and then, the diffusion was adopted to encrypt the entire image. In addition, no matter which encryption mode is used, the algorithm provides the function of medical image integrity verification. The proposed algorithm was simulated and analyzed to evaluate its effectiveness. The results show that in semi-full encryption mode, the algorithm has good security performance and lower time consumption; while in full encryption mode, the algorithm has better security performance and is acceptable in time.

Fast selective encryption algorithms based on moments and chaos theory

In this work, we introduce a novel selective encryption scheme based on chaos theory and momentstransforms, two moments families were considered namely Tchebichef and Hahn. The goal is to propose afast and secure encryption scheme that can be deployed in real world scenarios. The proposed algorithmsoperate in the transform domains of Tchebichef and Hahn moments. We encrypt only the most significantcoefficients of the moments transforms. First, we down sample the computed moments’ matrices coefficients,then we use two logistic maps for confusion and diffusion of the down-sampled Tchebichef’s and Hahn’scoefficients, the resulting matrix is the encrypted image. This approach improves drastically the timeperformance of the encryption algorithm while keeping a “good” security level. In order to prove theperformance of our algorithms, we run different experiments and test the algorithms on different criteria:MSE, correlation coefficient, differential analysis, entropy and time performance. The presented results provethat the encryption algorithms proposed are secure and outperform state-of-the-art algorithms.

A Format Compliant Framework for HEVC Selective Encryption After Encoding

The security protection of Ultra-High-Definition (UHD) video is facing grand challenges due to changeable application scenarios. The video business is highly dependent on the video format structure, which makes the format compliance of the encryption algorithm essential. Existing HEVC Selective Encryption (SE) algorithms are difficult to encrypt with format compliance while independent from the encoding, which limits their practical application. In order to realize the format compliant encryption on encoded bitstream, this paper first proposes a non-diffusion rule by analyzing the coding format specification of High Efficiency Video Coding (HEVC). Following the non-diffusion rule, a Bit Flipping (BF) method and a Bit Insertion-Deletion (BID) method are proposed based on the lower bound mapping of the bypass syntax element bit coding interval. Then, considering the various binarization methods and the correlation between syntax elements when decoding, this paper proposes the Validity Principle (VP) and Independence Principle (IP) of format compliant encryption. Focusing on the binary bits of the primary bypass elements in HEVC, the encryptability of them is analyzed in detail, and the corresponding format compliant encryption schemes based on BF, BID methods are constructed. Based on the above, a Format Compliance Encryption (FCE) framework after encoding is formulated. The flexibility, security, and adaptability of the framework are analyzed. Finally, through experiments from the aspects of format compliance, encryption speed, and perception effect, the proposed methods, schemes, and framework are format compliance while ensuring the basic performance and security requirements.

A plain-image correlative semi-selective medical image encryption algorithm using enhanced 2D-logistic map.

Modern medical examinations have produced a large number of medical images. It is a great challenge to transmit and store them quickly and securely. Existing solutions mainly use medical image encryption algorithms, but these encryption algorithms, which were developed for ordinary images, are time-consuming and must cope with insufficient security considerations when encrypting medical images. Compared with ordinary images, medical images can be divided into the region of interest and the region of background. In this paper, based on this characteristic, a plain-image correlative semi-selective medical image encryption algorithm using the enhanced two dimensional Logistic map was proposed. First, the region of interest of a plain medical image is permuted at the pixel level, then for the whole medical image, substitution is performed pixel by pixel. An ideal compromise between encryption speed and security can be achieved by full-encrypting the region of interest and semi-encrypting the region of background. Several main types of medical images and some normal images were selected as the samples for simulation, and main image cryptanalysis methods were used to analyze the results. The results showed that the cipher-images have a good visual quality, high information entropy, low correlation between adjacent pixels, as well as uniformly distribute histogram. The algorithm is sensitive to the initial key and plain-image, and has a large keyspace and low time complexity. The time complexity is lower when compared with the current medical image full encryption algorithm, and the security performance is better when compared with the current medical image selective encryption algorithm.

Visual Protection Using RC5 Selective Encryption in Telemedicine

The dissemination of the COVID-19 viruses now extends the usage of video consultations to share perspectives and virtual medical consultations, save expenses and health procedures, track the success of care proposals with detail, consistency, and ease from moment to time. The research aims to study the security of video consultations. We will also present the advantages and disadvantages of video consultations and the complications of their implementation. This paper mainly proposes a practical, high-efficiency video encoding technique for the new video encoding technique (HEVC) used in video consultations. The technology offered uses the RC5 block encryption algorithm for encrypting the sensitive bits of HEVC with low complexity, short encoding times in real-time implementations, format-compliant HEVC, and constant bitrate. In addition, this paper presents experimental results comparing the proposed HEVC RC5-based selective encryption (SE) algorithm with the other algorithms used in various operating modes using the Advanced Encryption Standard (AES). Also, this paper provides the security analysis of the proposed HEVC RC5-based SE algorithm for video consultation, including; the correlation analysis between the ciphered video and the original one, the histogram of the ciphered video, and the cipher cycle analysis. The security analysis results ensured that the proposed HEVC RC5-based SE algorithm for video consultation is safe and stable.

Cryptanalysis of Start Code-Based Encryption Method for HEVC

We propose a cryptanalysis for MPEG high efficiency video coding bitstream encryption based on the start code. Today, most digital video data are transmitted over an open Internet network in an encrypted state for security and privacy. In general, video services must guarantee real-time communications; therefore, it is necessary to reduce the computational complexity required to encrypt video data. Consequently, many selective encryption algorithms that selectively encrypt a highly sensitive part of the entire video data have been studied. Recently, we proposed a selective encryption algorithm based on the start code for high efficiency video coding, which dramatically reduces the computational complexity of encryption. In this paper, we studied the cryptanalysis of the encryption algorithm based on the start code and found a security vulnerability for a ciphertext-only attack. The proposed method presents a method to restore the encrypted first byte of the network abstraction layer unit header by analyzing the unencrypted high efficiency video coding bitstream. The first byte of the network abstraction layer unit header can be restored using the unencrypted parts, such as the order, syntax element, and length of the network abstraction layer unit. The experimental results demonstrated the security vulnerability by breaking the start code based encryption algorithm that is difficult to recover using the brute-force attack with only one to six recovery attempts using the proposed ciphertext-only attack.

HEVC Video Encryption Algorithm Based on Integer Dynamic Coupling Tent Mapping

A selective encryption algorithm is proposed to improve the efficiency of high efficiency video coding (HEVC) video encryption and ensure the security of HEVC videos. The algorithm adopts the integer dynamic coupling tent mapping optimization model as the pseudo-random sequence generator, and multi-core parallelization is used as the sequence generation mechanism. The binstrings during the process of context adaptive binary arithmetic coding are selected for encryption, which conforms to the features of invariable binstream and compatible format in terms of video encryption. Performance tests for six types of standard videos with different resolutions were performed. The results indicated that the encryption algorithm has a large key space and benefits from a high encryption effect.

Secure Health Data Sharing for Medical Cyber-Physical Systems for the Healthcare 4.0.

The recent spades of cyber attacks have compromised end-users' data security and privacy in Medical Cyber-Physical Systems (MCPS) in the era of Health 4.0. Traditional standard encryption algorithms for data protection are designed based on a viewpoint of system architecture rather than a viewpoint of end-users. As such encryption algorithms are transferring the protection on the data to the protection on the keys, data safety, and privacy will be compromised once the key is exposed. In this paper, we propose a secure data storage and sharing method consisted of a selective encryption algorithm combined with fragmentation and dispersion to protect the data safety and privacy even when both transmission media (e.g. cloud servers) and keys are compromised. This method is based on a user-centric design that protects the data on a trusted device such as the end-users' smartphone and lets the end-user control the access for data sharing. We also evaluate the performance of the algorithm on a smartphone platform to prove efficiency.

Start Code-Based Encryption and Decryption Framework for HEVC

In this article, we propose a new selective encryption and decryption framework based on the start code for high efficiency video coding. There is a growing need to encrypt video information to protect video content from privacy invasion and intellectual property infringement caused by information leakage. Although encrypting an entire video is a straightforward approach, the cost to encrypting a large amount of video data is substantial, considering the resulting computational complexity. Consequently, selective encryption algorithms have been actively researched in recent years and have contributed to reducing the computational complexity. However, existing selective encryption algorithms have certain drawbacks. For instance, it is difficult to separate the video encryption algorithm from the video compression algorithm because the encryption framework is based on the syntax elements. Further, a partial reconstruction of the encrypted video bitstream is often unavoidable. To solve these problems, the proposed method encrypts the bitstream based on the start code rather than on the syntax elements. Encrypting the bitstream partially, based on the start code, makes it easy to separate the video encryption algorithm from the video compression algorithm. Furthermore, encrypting the part adjacent to the start code protects the video content, as video reconstruction using a video decoder is impossible, unless the correct start code is returned to the bitstream. The experimental results show that the proposed method reduced the encryption and decryption times by approximately 97% and 98%, respectively, compared to the encryption and decryption of the entire video bitstream.

Image Encryption using Jumbling-Salting Algorithm

With the advent of digital world today, securing images across internet has become an important issue. There exist many image security techniques viz. steganography, encryption, watermarking etc. Image Encryption is one of such fruitful technique which encrypts an image using random secret key and stores the encrypted image on the server. There are many challenges of implementing image encryption algorithms such as higher computational complexity, loss of information during encryption, universality and applicability of algorithm, less scalability etc. Many image encryption algorithms are selective image encryption algorithm which works for specific part of image. It consists of encrypting only a subset of the data. The aim of selective encryption is to reduce the amount of data to encrypt while preserving a sufficient level of security. The selective encryption algorithms have a problem of scalability and data loss. The paper proposes a new algorithm Jumbling-Salting for images. The algorithm was earlier used in encryption passwords, text files, DNS, payment gateway data etc. An application is developed which incorporates the Jumbling salting encryption stategy for images.

Performance Analysis of a Selective Encryption Algorithm for securing Text data over Mobile Ad hoc networks

In recent era security is very much desired for the messages transmitted through the network. The study shows that, even though many approaches have been proposed towards security till date, still the security loopholes also emerging, so constant advancement is crucial for data security. Since all nodes in the network work together as a team to transmit the data, the network may prone to active or passive attacks such as Eavesdropping, Jamming, traffic analysis, Denial of Service, monitoring etc. The research paper introduces a new selective encryption method termed as Selective Significant Data Encryption (SSDE). The SSDE presents adequate protection to the data encryption process by picking up only the significant content from the complete message by referring Natural Language Processing (NLP). As a result, the encryption time overhead will get reduced, and overall performance will improve. Symmetric key algorithms are generally proficient and quick cryptosystem compared to other techniques, so Blowfish system is used for encryption/decryption process. The proposed research work is compared with many conventional methods and found that this approach is more superior to other traditional means.

A Tunable Selective Encryption Scheme for H.265/HEVC Based on Chroma IPM and Coefficient Scrambling

Designing selective encryption (SE) schemes for H.265/HEVC has been attracted much attention with the advent of H.265/HEVC codec in the past two decades. However, the most SE algorithms for H.265/HEVC encrypt the syntax elements in the bypass mode to keep the bit rate. Moreover, the edge region of the video data is not sufficiently protected. To produce large visual distortion and edge loss, a tunable SE scheme for H.265/HEVC based on the chroma intra prediction mode (IPM) and coefficient scrambling is proposed. First, a pseudo-random number sequence is generated by AES-CTR. Then, the prediction, residual, and reconstruction information in the H.265/HEVC encoding process is encrypted by a pseudo-random sequence. It encrypts the syntax elements of context-based adaptive binary arithmetic coding (CABAC) in the bypass mode. Some syntax elements, including chroma IPM in the regular mode, are encrypted as well. To further protect the edge information, a coefficient scrambling is adopted. The edge information of each frame is extracted and the transform units (TUs) are classified according to it. Then, the coefficients of the TUs containing edge are scrambled. Finally, a sign used for marking the type of each TU is embedded into a coefficient. The experimental results and analysis show that the proposed scheme has better visual distortion and subjective evaluation results compared with some existing H.265/HEVC SE algorithms. Meanwhile, users can flexibly use the proposed SE scheme according to encryption performance and bit rate requirements, which is attractive in the scenario of protecting video in cloud servers.

Research on image selective encryption and compression algorithm under hyperchaotic system

Research on image selective encryption and compression algorithm under hyperchaotic system

Securing JPEG-2000 images in constrained environments: a dynamic approach

This paper presents an efficient and lightweight format-compliant selective encryption algorithm for secure JPEG 2000 coding. The proposed encryption scheme is dynamic in nature, where the key is changed for every input image. Furthermore, an amount of 4% of bytes from each packet data is selected to follow the encryption process. Moreover, to achieve the desired security, two rounds of substitution–diffusion processes are applied to the selected bytes. Experimental analysis has proved that this amount of encrypted data ensures a hard image distortion, while significantly preserve the communication bandwidth. In addition, compression analysis and extensive security tests have demonstrated: (1) the robustness of the proposed selective encryption approach against the most known types of attacks, (2) the preservation of the main compression properties (i.e., compression friendliness and format-compliant), and most importantly, and (3) the efficiency in term of execution time compared to others similar JPEG-2000 images encryption schemes.

CABAC-based selective encryption for HEVC using RC6 in different operation modes

This paper proposes a selective encryption (SE) algorithm for the almost recently video compressing technique that is called High-Efficiency Video Coding (HEVC). The improvement of our HEVC SE algorithm is to secure real-time HEVC streaming using low computational overhead, same bit rate and ensuring the video format compliance. This contribution is achieved with low computational RC6 algorithm to encrypt subset of binstrings that is binarized using the bypass binary arithmetic coding mode in the context adaptive binary arithmetic coding (CABAC) process of HEVC. This binstrings subset is the non-zero discrete cosine transform (DCT) coefficients sign bits, motion vector difference (MVD) sign bits, remaining absolute values suffix of DCT, MVD absolute values suffix, Sample adaptive offset (SAO) sign bit, residual size, reference picture index and the delta Quantization Parameter (QP). Also, this paper investigates the performance evaluation of using the RC6 with its operation modes within the proposed HEVC CABAC SE. This investigation is done for choosing the best operation mode for RC6 to be suitable for being used in the HEVC real-time application. The security analysis like histogram analysis, correlation coefficients test and key sensitivity test are presented to make sure the protection of HEVC CABAC SE algorithm against brute force and statistical attacks. The performance analysis results prove that the HEVC CABAC SE is highly secure and can be used in real-time HEVC applications.

Selective Encryption Algorithm for 3D Printing Model Based on Clustering and DCT Domain

Three-dimensional (3D) printing is applied to many areas of life, but 3D printing models are stolen by pirates and distributed without any permission from the original providers. Moreover, some special models and anti-weapon models in 3D printing must be secured from the unauthorized user. Therefore, 3D printing models must be encrypted before being stored and transmitted to ensure access and to prevent illegal copying. This paper presents a selective encryption algorithm for 3D printing models based on clustering and the frequency domain of discrete cosine transform. All facets are extracted from 3D printing model, divided into groups by the clustering algorithm, and all vertices of facets in each group are transformed to the frequency domain of a discrete cosine transform. The proposed algorithm is based on encrypting the selected coefficients in the frequency domain of discrete cosine transform to generate the encrypted 3D printing model. Experimental results verified that the proposed algorithm is very effective for 3D printing models. The entire 3D printing model is altered after the encryption process. The decrypting error is approximated to be zero. The proposed algorithm provides a better method and more security than previous methods.

Infrared image selective encryption algorithm based on multi-feature difference detection and joint control mapping

Infrared image selective encryption algorithm based on multi-feature difference detection and joint control mapping