Secure Encryption Research Articles

OSL-ABE: an optimal secure and lightweight attribute-based encryption method for blockchain-enabled IoT-based healthcare systems

OSL-ABE: an optimal secure and lightweight attribute-based encryption method for blockchain-enabled IoT-based healthcare systems

A plaintext-related and ciphertext feedback mechanism for medical image encryption based on a new one-dimensional chaotic system

Abstract In recent years, Plaintext-Related Image Encryption (PRIE) algorithms have been introduced, demonstrating a commendable level of plaintext sensitivity to resist chosen plaintext attack (CPA). However, these approaches suffer from several drawbacks, including inability to fully reconstruct the original image, limited practical value and excessive computational demands etc.. Moreover, the exponential expansion of medical data necessitates the formulation of more secure and efficient encryption algorithms. In this paper, firstly, a novel one-dimensional chaotic map, designated as 1D-SAM, which strikes an excellent balance between structural complexity and chaotic performance is proposed. The 1D-SAM achieve a larger chaotic range and an elevated Lyapunov exponent, signifying enhanced dynamical complexity. Subsequently, we devise a lightweight medical image encryption system leveraging the 1D-SAM and an innovative diffusion architecture, termed the plaintext-related and ciphertext feedback mechanism(PRCFM). This encryption system is a symmetric-key cryptosystem, eliminating the need for transmitting supplementary data beyond the secret keys to the recipient. Notably, the encrypted image maintains identical dimensions to its original counterpart and is fully recoverable. Complete simulation experiments were conducted on a personal computer equipped with MATLAB R2021a, OS Windows 11, 2.60GHz CPU and 16GB RAM. The experimental results indicate that our encryption system, employing a single permutation-diffusion round, efficiently encrypts a 512×512 image in approximately 0.2854 seconds. Leveraging the advantages of the PRCFM, our approach demonstrates superior plaintext sensitivity, achieving an average number of pixels changing rate (NPCR) of 99.6051 and a unified average changed intensity (UACI) of 33.4452. In summary, our work addresses key limitations of contemporary encryption frameworks, exhibiting acceptable performance in both encryption speed and security strength.

Scalable, Fast Light‐Responsive, and Excellent Color‐Retention Fiber‐Based Photochromic Wearables for Sustainable Photo‐Patterning and Information Security Encryption

AbstractFiber‐based photochromic wearables have attracted growing attention in sustainable photo‐patterning information displays, information security encryption, and optical data recording/storage. Molybdenum trioxide (MoO3) is one of the key photochromic materials that possesses good photochromic performance, nevertheless, it faces considerable challenges in preparing photochromic textiles with stable, scalable, and long color‐retention properties. In this work, a new kind of fiber‐based photochromic wearables is designed and developed by combining cotton fabric with a MoO3‐based self‐adhesive polymer network and long chain silyl group. The prepared photochromic wearable has exhibited excellent fatigue resistance and favorable reversibility (> 40 cycles), rapid light response (reach color saturation with a UV dose of 60 kJ m−2), outstanding color retention capability (> 90 days), and desirable biocompatibility (cell viability > 100%). In addition, the prepared photochromic textiles could maintain a fast light response and excellent color retention even after experiencing repeated washing (20 cycles). Moreover, the photo‐patterning photochromic wearables are verified by resisting the deterioration of acid solution, alkali solution, and sweat (pH 2.0–9.0) as well as keeping clear patterns under sunlight irradiation. As a demonstration of the application, fiber‐based photochromic wearables are made and employed for the sustainable applications of rewritable photo‐patterning and information security encryption.

A Novel Color Image Encryption Algorithm Based on Hybrid Two-Dimensional Hyperchaos and Genetic Recombination

The transition from text to images as the primary form of information transmission has recently increased the need for secure and effective encryption techniques due to the expanding information dimensions. The color picture encryption algorithm utilizing chaotic mapping is limited by a small chaotic range, unstable chaotic state, and lengthy encryption duration. This study integrates the Ackley function and the Styblinski–Tang function into a novel two-dimensional hyperchaotic map for optimization testing. A randomness test is run on the chaotic sequence created by the system to check that the new chaotic system can better sustain the chaotic state. This study introduces two techniques, genetic recombination and clock diffusion, to simultaneously disperse and mix images at the bit level. This study utilizes chaotic sequences in genetic recombination and clock drift to propose an image encryption technique. The data indicates that the method demonstrates high encryption efficiency. At the same time, the key also successfully passed the NIST randomness test, verifying its sensitivity and randomness. The algorithm’s dependability has been demonstrated and can be utilized for color image encryption.

Implementation of entropically secure encryption: Securing personal health data

AbstractEntropically secure encryption (ESE) offers unconditional security with shorter keys compared to the One‐Time Pad. Here, the first implementation of ESE for bulk encryption is presented. The main computational bottleneck for bulk ESE is a multiplication in a very large finite field. This involves multiplication of polynomials followed by modular reduction. A polynomial multiplication is implemented based on the gf2x library, with modifications that avoid inputs of vastly different length, thus improving speed. Additionally, a recently proposed efficient reduction algorithm that works for any polynomial degree is implemented. Two use cases are investigated: x‐ray images of patients and human genome data. Entropy estimation is conducted using compression methods whose results determine the key lengths required for ESE. The running times for all steps of the encryption are reported. The potential of ESE to be used in conjunction with quantum key distribution (QKD), in order to achieve full information‐theoretic security of QKD‐protected links for these use cases is discussed.

Multicolor emissive hyperbranched polysiloxanes from enhanced spatial electronic communication for security encryption and bacteria imaging

Unconventional fluorescent polymers with long-wavelength emission have attracted considerable attention due to their facile preparation, good biocompatibility, and excellent processability. However, their emission at long-wavelength is relative low. Herein, a series of aromatic amino acids functionalized hyperbranched polysiloxanes with deep red to cyan fluorescence were prepared. Experimental and theoretical calculation results show that the long-wavelength emission comes from the spatial electronic delocalization among conjugated π bonds and electron-rich functional groups. The balance between rigidity and flexibility is favorable for the strong long-wavelength emission. Moreover, the polymers’ fluorescence is sensitive to Fe3+ and OH– ions; and these polymers show potential applications in security encryption, fluorescent stamp inks and bacteria multicolor fluorescence imaging. This work provides an efficient method for the development of long-wavelength emissive unconventional fluorescence polymers

Redistributed invariant redundant fractional wavelet transform and its application in watermarking algorithm

In this paper, we introduce an invariant wavelet transform with multiple parameters in fractional domain and apply it to watermarking algorithm. First, we propose a new transform called redistributed invariant redundant fractional wavelet transform (RI-RFrWT) based on redistributed invariant integer wavelet transform (RI-IWT) and redundant fractional wavelet transform (RFrWT) which implements the extension of RI-IWT in the fractional domain. When the transform order of RI-RFrWT is 0, it degenerates to RI-IWT and has invariance. Second, RI-RFrWT is applied to the proposed optimized watermarking algorithm. This algorithm solves the problem that it is difficult for existing algorithms to show high robustness under both geometric and noise attacks. Third, a secure encryption algorithm based on Logisitic-adjusted-Sine map (LASM) and generalized Arnold transform (GAT) is designed to encrypt the information of watermark. Highly sensitive LASM and multi-parameter GAT improve the security of the watermarking algorithm. To improve the invisibility and robustness of the algorithm, particle swarm optimization (PSO) is also used to simultaneously improve the order of RI-RFrWT and embedding strength. Last, the simulation results demonstrate that the proposed watermarking method outperforms high invisibility, robustness and security. Compared with the relevant literature, it has obvious advantages in invisibility and resistance to geometric attacks and noise attacks.

Design and Implementation of a Smart Wireless Access Point for A Gas Station (SWAP-GS)

The gas distribution sector is a good fit for wireless communications, especially considering how often distribution facilities are located in distant areas. The underlying communications infrastructure needs to be extremely dependable, with a resilient system that links sensors and controls throughout a vast field area network, when working with accumulated and real-time data. The resulting detail assists managers in creating and modifying business processes, managing the station site fully, and increasing operational efficiency. A wireless gas station offers an architecture based on Wi-Fi standards for applications that track and collect data all the way down sto the sensor level. The goal of the research was to install a wireless infrastructure network at a service station. When used in a gas station, plant, enable users to access real-time information, exchange and share sensor readings from the access point, and develop a smart wireless access point system with higher secure encryption than the generic wireless network. The NodeMCU microcontroller, which broadcasts the real-time data to the clients, receives inputs from a temperature, pressure, and humidity sensor. This allows the system to do such activities. It was believed that the built wireless infrastructure will enhance the existing LAN infrastructures. A few basic prerequisites are taken into account. First and foremost, a microcontroller, a sensor unit, software design, and compliance with IEEE 802.11 standards were required.

A multi-medical image encryption algorithm based on ROI and DNA coding

Abstract With the rapid development of information technology in the field of electronic medicine, the confidentiality of medical images has received increasing attention. The research on the encryption of multiple medical images holds greater practical significance. In this paper, the encryption algorithm is designed specifically for the region of interest (ROI) in medical images. Different techniques and methods are used to encrypt ROI and region of non-interest (RONI) respectively. By combining improved Zigzag scrambling, DNA coding, and the Fisher-Yates shuffle, we place an emphasis on protecting the ROI, and achieve secure encryption for medical images of any number and size. In addition, a new one-dimensional chaotic system S-LCS with larger parameter space and better chaotic properties is proposed. In this encryption scheme, the information about the ROI serves as the secret key, and the initial values and parameters of the chaotic sequences required for encryption are calculated from this key. This strengthens the relationship between the key and the plaintext, enhancing the security of the key. Through testing and comparative analysis, it has been found that the encryption algorithm has high enough security, can resist various attacks, and has high encryption efficiency in the application scenario of multi-image encryption.

Research and Design of Data Encryption Circuit based on D Flip-Flop

Since information technology is developing so quickly, the problem of data security has become increasingly prominent. Data encryption technology, as an important means of securing data transmission, plays a vital role in resisting network attacks and protecting privacy. In this paper, a data encryption circuit based on D flip-flop is studied, aiming to improve the efficiency and security of data encryption. First, this paper introduces the basic principles of data encryption and analyzes the application of D flip-flop in encryption circuit. Subsequently, the design principle of Moore’s state machine is elaborated, and encryption circuit is designed with the use of the state graph and state table. Further, this paper demonstrates the logic circuit design process., including the derivation of D-flip-flop input Circuit construction and Boolean expressions. This research provides a hardware implementation design solution for the design of data encryption circuits, which is expected to play a role in improving encryption speed and enhancing security.

الاستراتيجيات الفعالة لإدارة المخاطر والتخفيف منها في مجال أمن الشركات في المملكة العربية السعودية

This study addresses risk management and the enhancement of cybersecurity in Saudi companies, a critical issue in the face of rapid digital transformation. The research aims to analyze the risk management strategies employed by Saudi companies and how these strategies enhance cybersecurity to protect vital data and assets. A multi-faceted research methodology was utilized, incorporating descriptive analysis to evaluate the current risk management situation, quantitative methods through surveys and questionnaires, and qualitative interviews with cybersecurity experts. The study focused on identifying the major risks faced by Saudi companies, whether technological, financial, or organizational, and the tools and technologies used to mitigate these risks. The results highlighted the effectiveness of preventive measures such as the use of security monitoring systems, encryption, and continuous employee training. The study also explored the challenges companies face in implementing cybersecurity strategies, particularly given the evolving nature of cyber threats. The study concluded that Saudi companies need to adopt integrated risk management strategies, which include raising employee awareness, collaborating with governmental and private entities, and utilizing artificial intelligence technologies to address future threats. The study also recommended continuous improvement and updating of cybersecurity policies to ensure the protection of digital assets and maintain business continuity in the face of cyber crises.

Overview of homomorphic encryption technology for data privacy

This study examines the overview of homomorphic encryption technology for data privacy. In the era of big data, the growing need to utilize vast amounts of information while ensuring privacy and security has become a significant challenge. Homomorphic encryption technology has gained attention as a solution for privacy-preserving data processing, allowing computations on encrypted data without exposing sensitive information. This study introduces the concept of data privacy preservation and explores the evaluation of homomorphic encrypted technology. The focus is on analyzing both partial and full homomorphic encryption methods, highlighting their respective characteristics, evaluation criteria, and the current state of research. Partial homomorphic encryption supports limited operations, while full homomorphic encryption enables unlimited computation on encrypted data, though both face challenges related to computational overhead and efficiency. Additionally, this paper addresses the ongoing issues and limitations associated with homomorphic encryption, such as its complexity, large encryption volumes, and difficulties in handling large-scale datasets. Despite these challenges, researchers continue to refine the technology and expand its applications in cloud computing, big data analytics, and privacy-preserving computing environments. This study also discussed potential future research avenues aimed at improving the scalability, efficiency, and security of homomorphic encryption to support broader, real-world applications. Ultimately, homomorphic encryption is positioned as a key enabler for secure data utilization in an increasingly privacy-conscious digital landscape.

Secure authentication and encryption via diffraction imaging-based encoding and vector decomposition

Abstract Traditional optical encryption systems have security risks due to their linearity and usually encounter problems such as the heavy burden of key transmission and storage. This paper proposes a novel security-enhanced optical image authentication and encryption framework that combines diffractive imaging-based encryption with the vector decomposition algorithm (VDA). Chaotic random phase masks (CRPMs) are used to encrypt data for authentication via VDA, and a pair of complementary binary matrix keys are utilized to extract information from the encrypted data to generate ciphertext. During the authentication and decryption processes, a sparse reference image is reconstructed from the ciphertext for verification. If the authentication is successful, image decryption can be executed using a key-assisted phase retrieval algorithm. The employment of nonlinear VDA, an additional layer of authentication, and the use of CRPMs and binary matrix keys enhance security and address key burden concerns. Simulation results demonstrate the feasibility, effectiveness, and security of the scheme.

Robust Carbon‐Dot Optical Disks for Orthogonal Amplitude‐Polarization Encryption Storage

AbstractHigh‐capacity steganography is crucial for the secure exchange of massive information. Exploring orthogonally optical recording can significantly improve encryption levels. However, due to the lack of robust media, the hidden data are easy to be cracked or destructed. Herein, carbon dots have the switchable memory function between optical transmittance and polarization state after receiving excitation power adjustment is discovered. A large‐area carbon‐based disk is further constructed which is measured to resist the high‐temperature damage at 423 K for more than 405 h and is estimated to remain stable at room‐temperature (301 K) beyond 2341 years. With the alternated arrangement of the dual functional carbon dots at one region of the disk, only by using an amplitude‐type holographic diffraction key can the polarized pattern be correctly read out. The ultra‐high secure encryption strategy also puts a bright way to the applications of 3D image hiding, permanent data preservation, and anti‐counterfeiting labels.

Selective Encryption Algorithm for Vectoral Geographic Data under Feature Point Grouping Strategy

Abstract. Selective encryption technology is a data security protection method that can balance encryption security and efficiency. Currently, there is ongoing research on applying this technology to vector geographic data. However, existing algorithms often use random selection methods for choosing objects to be encrypted, which results in lower security. To address this problem, we proposed a selective encryption algorithm for vector geographic data based on feature point grouping strategy. The study includes four steps: (1) Based on the user-input encryption ratio, calculate the feature point grouping thresholds for each element in the data. (2) Extract feature point sets for each element based on the grouping threshold. (3) Sort and group the feature point sets, reducing the smallest encryption unit to group objects within individual elements. (4) To reduce encryption costs and enhance the algorithm's resistance to attacks, perform frequency domain coefficient encryption and spatial domain coordinate value encryption in a stepwise manner on the group objects, ultimately producing the encryption results. The experiment showed that: (1) The decrypted encrypted data maintains consistency with the original data coordinates, achieving lossless decryption. (2) The correlation between encrypted data and the original data is significantly disrupted, resulting in a high level of randomness and thereby ensuring the algorithm's robust security. (3) The key space is substantial and highly sensitive, capable of withstanding brute force attacks. (4) The algorithm significantly improves encryption efficiency. (5) The algorithm displays resilience against deletion attacks and noise attacks. In conclusions, the proposed method enhances encryption efficiency while upholding a high level of security, thus it is an efficient selective encryption algorithm for vector geographic data.

Image encryption algorithm based on matrix projective combination-combination synchronization of an 11-dimensional time delayed hyperchaotic system

Abstract Secure image transmission is critical to protect sensitive data from unauthorized access, especially in an era of increasing digital threats. Chaotic systems with their inherent complexity and unpredictability, provide a promising solution for enhancing encryption security. To contribute to this field, we investigate a new 11-dimensional hyperchaotic system by taking advantage of its complex dynamical properties to strengthen security. The high dimensional of the system intensifies chaotic behaviors such as stability, attractors and sensitive to initial conditions, making it particularly suitable for encrypted transmission.
 Time delay is an important factor to be considered affecting the control and synchronization in nonlinear system. Additionally, time delays include the effects of past states, further increasing the unpredictability of the system. To explore these dynamics, we analyze the Lyapunov exponents, stability of equilibrium points, symmetry and dissipation. A matrix projective combination-combination synchronization scheme is proposed to synchronize four identical 11-dimensional hyperchaotic systems with time delay. Nonlinear active controllers designed based on Lyapunov stability theory are used to achieve this synchronization. This work advances an important idea for encryption and decryption algorithms, which is the secure transmission of images using affine encryption. In the affine encryption algorithm, the key is based on the solution of synchronized chaotic delayed systems and the private message of the sender and receiver. This proposed encryption and decryption algorithms have been applied on plain images. Numerical simulations and security analysis including key space, histogram, information entropy and correlation analysis are conducted to validate the theoretical results and encryption algorithm. Experimental analysis and comparisons with existing literature confirm the effectiveness and security of the proposed approach for cryptographic purposes.

Ciphertext only attack on QR code optical encryption system with spatially incoherent illumination using a neural network

Abstract Optical encryption methods attract a lot of attention owing to their high encryption speed and bandwidth. Recently, neural networks (NNs) have been used for cryptanalysis of optical encryption techniques. In this paper, we for the first time to our knowledge applied a NN for ciphertext only attack on an optical encryption system with spatially incoherent illumination. A NN was used to extract encryption keys from ciphertexts, which can be used to decrypt the plaintext QR codes. Additionally, an optically encrypted QR code was successfully decoded after using the key extracted by the trained NN, that has been processed to account for discrepancies between the numerical model and the optical setup. The results show the vulnerability of the existing optical encryption system with incoherent light to attacks of this type, which indicates the need for improved optical encryption security.

Addressing cybersecurity challenges in robotics: A comprehensive overview

As robotics technology becomes increasingly integrated into various sectors, ensuring the cybersecurity of robotic systems is paramount. This article provides an in-depth exploration of the cybersecurity challenges confronting robotics and offers strategies to address these concerns. With the growing connectivity and networking capabilities of robots, vulnerabilities such as unauthorized access, data breaches, and network attacks are significant threats [1]. Protecting sensitive data collected and processed by robots is crucial to preserving privacy and trust. Remote access features, while enhancing operational flexibility, also pose security risks if not adequately secured. Weak authentication mechanisms and insecure interfaces could allow malicious actors to compromise robot functionality. Furthermore, robots are susceptible to malware and cyber-attacks, including viruses, worms, and ransomware. To mitigate these risks, a comprehensive approach is necessary, incorporating secure design principles, robust authentication mechanisms, encryption techniques, and cybersecurity training. Collaboration among industry stakeholders, researchers, policymakers, and cybersecurity experts is essential to develop resilient robotic systems capable of withstanding evolving cyber threats. This article underscores the importance of addressing cybersecurity challenges in robotics to ensure the safety and security of robotic deployments across diverse domains. As robotics technology evolves and becomes integral across various sectors, prioritizing cybersecurity [2] is crucial to protect these systems from unauthorized access, data breaches, and network attacks. The interconnected nature and remote access features of robots pose significant vulnerabilities. Comprehensive measures, including secure design, encryption, and cybersecurity training, are essential. Collaboration among industry stakeholders, researchers, policymakers, and cybersecurity experts is vital for developing resilient robotic systems. This article highlights the urgent need to address cybersecurity challenges to ensure the safety and integrity of robotic deployments.

Vector geographic data commutative encryption and watermarking algorithm based on prediction differences

Commutative encryption and watermarking (CEW) is a seamless integration of encryption and watermarking technologies, overcoming the limitations of single security protection methods that may fail to provide comprehensive data protection. It is a research hotspot in the field of geographic information security. However, constructing or selecting stable features for vector point data to apply CEW algorithms remains a challenging problem. To address this, this paper utilizes space-filling curves to organize discrete points into line or polygon types and proposes a CEW algorithm for vector data based on prediction differences. Specifically, feature points are used to fit curves, providing independent operational spaces for watermarking and encryption. The segmented fitted curves are arbitrarily flipped to achieve perceptual encryption, while watermarks are embedded in the differences between the fitted curves and the actual data. Experimental results demonstrate that the proposed algorithm effectively addresses the issue of existing algorithms being unsuitable for point data. In simulated real-world scenarios, the extracted watermark information achieved NC values above 0.75, indicating strong robustness. Under conditions using existing lossless algorithms, the watermark capacity of the proposed method is thousands of times higher than that of existing algorithms, and it exhibits excellent encryption security, providing a new perspective for further research on lossless CEW.

Computational Differential Privacy for Encrypted Databases Supporting Linear Queries

Differential privacy is a fundamental concept for protecting individual privacy in databases while enabling data analysis. Conceptually, it is assumed that the adversary has no direct access to the database, and therefore, encryption is not necessary. However, with the emergence of cloud computing and the << on-cloud >> storage of vast databases potentially contributed by multiple parties, it is becoming increasingly necessary to consider the possibility of the adversary having (at least partial) access to sensitive databases. A consequence is that, to protect the on-line database, it is now necessary to employ encryption. At PoPETs'19, it was the first time that the notion of differential privacy was considered for encrypted databases, but only for a limited type of query, namely histograms. Subsequently, a new type of query, summation, was considered at CODASPY'22. These works achieve statistical differential privacy, by still assuming that the adversary has no access to the encrypted database. In this paper, we take an essential step further by assuming that the adversary can eventually access the encrypted data, making it impossible to achieve statistical differential privacy because the security of encryption (beyond the one-time pad) relies on computational assumptions. Therefore, the appropriate privacy notion for encrypted databases that we target is computational differential privacy, which was introduced by Beimel et al. at CRYPTO '08. In our work, we focus on the case of functional encryption, which is an extensively studied primitive permitting some authorized computation over encrypted data. Technically, we show that any randomized functional encryption scheme that satisfies simulation-based security and differential privacy of the output can achieve computational differential privacy for multiple queries to one database. Our work also extends the summation query to a much broader range of queries, specifically linear queries, by utilizing inner-product functional encryption. Hence, we provide an instantiation for inner-product functionalities by proving its simulation soundness and present a concrete randomized inner-product functional encryption with computational differential privacy against multiple queries. In terms of efficiency, our protocol is almost as practical as the underlying inner product functional encryption scheme. As evidence, we provide a full benchmark, based on our concrete implementation for databases with up to 1 000 000 entries. Our work can be considered as a step towards achieving privacy-preserving encrypted databases for a wide range of query types and considering the involvement of multiple database owners.