Search Results (71)

With the rapid development and convergence of systems science, cryptography, and data science, chaos-based image information security has emerged as a prominent research area, drawing considerable attention from researchers in computer science, physics, and related disciplines. This paper aims to review the fundamental concepts of chaos, as well as chaos-based image encryption, watermarking, and steganography. Building on this foundation, we analyze the evaluation standards, advancements, and applications of chaos-based image information security. Additionally, we propose several potential areas of focus for the future of chaos-based image information security, encouraging interested readers to pay attention to these crucial developments. Our analysis suggests that chaos can be effectively employed in plaintext image encryption, and that chaos-based watermarking and hiding techniques also hold promise. Full article

Differential cryptanalysis is one of the fundamental cryptanalysis techniques to evaluate the security of the block cipher. In many cases, resistance to differential cryptanalysis is proven through the upper bound of the differential characteristic probability, not the differential probability. Since the attacker uses a differential rather than a differential characteristic, resistance based on a differential characteristic tends to overestimate the security level of the block cipher. Such an overestimation is notably observed in lightweight block ciphers SKINNY, Midori, and CRAFT. In this paper, we examine the gap between the differential characteristics and the differential probability of lightweight block ciphers. We present practical methods for computing differential probability using a multistage graph. Using these methods, we count the exact number of maximum differential characteristics with fixed plaintext/ciphertext difference and activity pattern. By the exact number of maximum differential characteristics, we can calculate the probability that is closer to the real differential probability. In addition, by modifying the method, we compute a more accurate differential probability by considering the characteristics of the lower probability. We find differential distinguishers of 9-round Midori64 with probability $2^{-61.58}$, 9-round SKINNY64 with $2^{-58.67}$ and 14-round CRAFT with $2^{-60.32}$. Furthermore, we find a related-tweakey differential distinguisher of 11-round SKINNY64-64 with $2^{-55.93}$ and a related-tweak differential distinguisher of 17-round CRAFT with probability $2^{-63.37}$. Finally, we explain why these gaps are notable in Midori64, SKINNY64 and CRAFT by relating the S-box differential distribution table. Full article

Histograms are widely used for summarizing data distributions, detecting anomalies, and improving machine learning models’ accuracy. However, traditional histogram-based methods require access to raw data, raising privacy concerns, particularly in sensitive IoT applications. Encryption-based techniques offer potential solutions; however, they secure the data in transit or storage, requiring decryption during analysis, which exposes raw data to potential privacy risks. In this paper, we propose a method for constructing privacy-preserving histograms directly on homomorphically encrypted IoT data, leveraging the Fast Fully Homomorphic Encryption over the Torus (TFHE) scheme implemented in the Concrete framework. To overcome the challenges posed by homomorphic encryption, we redesign the traditional histogram construction algorithm, optimizing it for secure computation by addressing constraints related to nested loops and conditional statements. As an evaluation use case, we have considered an outlier detection mechanism based on histogram frequency counts, ensuring that all data and computations remain encrypted throughout the process. Our method achieves results consistent with plaintext-based outlier detection while maintaining reasonable computational overhead compared to those reported in the existing literature. Full article

This work presents an optical encryption process for various types of information related to 3D worlds (scenes) or 2D images, utilizing Computer-Generated Holograms (CGHs). It also introduces a modification to the Dual Random Phase Encoding (DRPE) encryption algorithm by incorporating pixel shuffling. This proposal enables the use of either a single key for both pixel shuffling and phase mask definition or two independent keys. The latter option is particularly advantageous in applications that require the involvement of two independent agents to retrieve the original plaintext. The dimension of the CGHs determines the size of the keys based on the random generation of values by cryptographically secure algorithms, so the use of arithmetic encryption is proposed for data compression. However, this proposal allows the use of other algorithms described in the literature to generate the shuffle and phase matrices. The complete workflow is described starting from the synthesis of a 3D scene, defined by a mesh of triangles with shape and appearance modeling, or 2D images of any level of geometric or visual complexity using computer graphics; its storage in a CGH, the encryption and decryption process, and finally, the results obtained in the laboratory and by simulation are shown. The similarity between different encryption levels is measured by the Pearson Coefficient to evaluate the results obtained. Full article

This paper explores advancements in the Gentry-Sahai-Waters (GSW) fully homomorphic encryption scheme (FHE), addressing challenges related to message data range limitations and ciphertext size constraints. We leverage the well-known parallelizing technology—the Chinese Remainder Theorem (CRT)—to tackle the message decomposition, significantly expanding the allowable input message range to the entire plaintext space. This approach enables unrestricted message selection in the GSW scheme and supports parallel homomorphic operations without intermediate decryption. Additionally, we adapt existing ciphertext compression techniques, such as the PVW-like scheme, to reduce the memory overhead associated with ciphertexts. Our experimental results demonstrate the effectiveness of combining the proposed CRT-based decomposition with the PVW-like compression in increasing the upper bound of message values and improving the scheme’s capacity for consecutive homomorphic operations. However, compression introduces a trade-off, necessitating a reduced message range due to error accumulation in successive HE operations. This research contributes to enhancing the practicality and efficiency of the GSW encryption scheme for complex computational scenarios while managing the balance between expanded message range, computational complexity, and storage requirements. Full article

In cryptography, techniques and tools developed in the subfield of linear cryptanalysis have previously successfully been used to allow attackers to break many sophisticated cryptographic ciphers. Since these linear cryptanalytic techniques require exploitable linear approximations to relate the input and output of vectorial Boolean functions, e.g., the plaintext, ciphertext, and key of the cryptographic function, finding these approximations is essential. For this purpose, the Correlation Extraction Algorithm (CEA), which leverages the emerging field of quantum computing, appears promising. However, there has been no comprehensive analysis of the CEA regarding finding an exploitable linear approximation for linear cryptanalysis. In this paper, we conduct a thorough theoretical analysis of the CEA. We aim to investigate its potential in finding a linear approximation with prescribed statistical characteristics. To support our theoretical work, we also present the results of a small empirical study based on a computer simulation. The analysis in this paper shows that an approach that uses the CEA to find exploitable linear approximations has an asymptotic advantage, reducing a linear factor to a logarithmic one in terms of time complexity, and an exponential advantage in terms of space complexity compared to a classical approach that uses the fast Walsh transform. Furthermore, we show that in specific scenarios, CEA can exponentially reduce the search space for exploitable linear approximations in terms of the number of input bits of the cipher. Neglecting the unresolved issue of efficiently checking the property of linear approximations measured by the CEA, our results indicate that the CEA can support the linear cryptanalysis of vectorial Boolean functions with relatively few (e.g., $n\le 32$) output bits. Full article

Accounts are an integral part of most modern information systems and provide their owners with the ability to authenticate within the system. This paper presents an analysis of existing methods for detecting simple account passwords in automated systems. Their advantages and disadvantages are listed. A method was developed to detect simple exploitable passwords that administrators can use to supplement other existing methods to increase the overall security of automated systems against threats from accounts potentially compromised by attackers. The method was based on the analysis of commands executed in automated or manual modes with the indication of credentials in plain text. Minimum password strength requirements are provided based on the security level. A special case was considered in which all passwords analyzed in this way were found explicitly in the system logs. We developed a unified definition of the classification of passwords into simple and strong, and also developed machine learning technology for their classification. The method offers a flexible adaptation to a specific system, taking into account the level of significance of the information being processed and the password policy adopted, expressed in the possibility of retraining the machine learning model. The experimental method using machine learning algorithms, namely the ensemble of decision trees, for classifying passwords into strong and potentially compromised by attackers based on flexible password strength criteria, showed high results. The performance of the method is also compared against other machine learning algorithms, specifically XGBoost, Random Forest, and Naive Bayes. The presented approach also solves the problem of detecting events related to the use and storage of credentials in plain text. We used the dataset of approximately 770,000 passwords, allowing the machine learning model to accurately classify 98% of the passwords by their significance levels. Full article

The design of a chaotic system and pseudo-random sequence generation method with excellent performance and its application in image encryption have always been attractive and challenging research fields. In this paper, a new model of parameter-variabled coupled chaotic system (PVCCS) is established by interaction coupling between parameters and states of multiple low-dimensional chaotic systems, and a new way to construct more complex hyperchaotic systems from simple low-dimensional systems is obtained. At the same time, based on this model and dynamical DNA codings and operations, a new pseudo-random sequence generation method (PSGM-3DPVCCS/DNA) is proposed, and it is verified that the generated pseudo-random sequence of PSGM-3DPVCCS/DNA has excellent random characteristics. Furthermore, this paper designs a novel pixel chain diffusion image encryption algorithm based on the proposed parameter-variabled coupled chaotic system (PVCCS) in which the hash value of plaintext image is associated with the initial key to participate in the encryption process so that the encryption key is closely associated with plaintext, which improves the security of the algorithm and effectively resists the differential cryptanalysis risk. In addition, an information hiding method is designed to hide the hash value of plaintext image in ciphertext image so that the hash value does not need to be transmitted in each encryption, and the initial key can be reused, which solves the key management problem in application and improves the application efficiency of the encryption algorithm. The experimental analysis shows that the chaotic system constructed in this paper is creative and universal and has more excellent chaotic characteristics than the original low-dimensional system. The sequence generated by the pseudo-random sequence generation method has excellent pseudo-random characteristics and security, and the image encryption algorithm can effectively resist differential cryptanalysis risk, showing advanced encryption performance. Full article

Revocable attribute-based encryption (RABE) provides greater flexibility and fine-grained access control for data sharing. However, the revocation process for most RABE schemes today is performed by the cloud storage provider (CSP). Since the CSP is an honest and curious third party, there is no guarantee that the plaintext data corresponding to the new ciphertext after revocation is the same as the original plaintext data. In addition, most attribute-based encryption schemes suffer from issues related to key escrow. To overcome the aforementioned issues, we present an efficient RABE scheme that supports data integrity while also addressing the key escrow issue. We demonstrate the security for our system, which is reduced to the decisional q-parallel bilinear Diffie-Hellman exponent (q-PBDHE) assumption and discrete logarithm (DL) assumption. The performance analysis illustrates that our scheme is efficient. Full article

As wireless communication scenarios grow more complicated, security issues are becoming increasingly prominent and severe. In the Internet of Things and vehicle-to-everything scenarios, conventional cryptographic technology faces numerous challenges. These include difficulties in secret key distribution and management, low update rates of secret keys, and vulnerability to quantum attacks. Physical layer secret key generation is considered a promising solution to security issues. The perfect secrecy proposed by Shannon can be achieved by combining secret key generation and the one-time pad when the length of secret keys is equal to that of plaintext. Hence, it is important to increase secret key generation rates. Intelligent reflecting surfaces demonstrate great advantages in improving the secret key generation performance. This paper provides a comprehensive review of current research efforts related to secret key generation assisted by intelligent reflecting surfaces, which is divided into three main categories: introducing the randomness of intelligent reflecting surfaces, optimizing the reflecting coefficients, and designing probing protocols. Comparative results of existing optimization approaches are provided and discussed. Furthermore, we emphasize the significance of selecting a random source of secret key generation from the perspective of information theory. Finally, two significant application scenarios, the Industrial Internet of Things and vehicle-to-everything, are discussed, and some challenges and opportunities are presented. Full article

Chaos-based image encryption has become a prominent area of research in recent years. In comparison to ordinary chaotic systems, fractional-order chaotic systems tend to have a greater number of control parameters and more complex dynamical characteristics. Thus, an increasing number of researchers are introducing fractional-order chaotic systems to enhance the security of chaos-based image encryption. However, their suggested algorithms still suffer from some security, practicality, and efficiency problems. To address these problems, we first constructed a new fractional-order 3D Lorenz chaotic system and a 2D sinusoidally constrained polynomial hyper-chaotic map (2D-SCPM). Then, we elaborately developed a multi-image encryption algorithm based on the new fractional-order 3D Lorenz chaotic system and 2D-SCPM (MIEA-FCSM). The introduction of the fractional-order 3D Lorenz chaotic system with the fourth parameter not only enables MIEA-FCSM to have a significantly large key space but also enhances its overall security. Compared with recent alternatives, the structure of 2D-SCPM is simpler and more conducive to application implementation. In our proposed MIEA-FCSM, multi-channel fusion initially reduces the number of pixels to one-sixth of the original. Next, after two rounds of plaintext-related chaotic random substitution, dynamic diffusion, and fast scrambling, the fused 2D pixel matrix is eventually encrypted into the ciphertext one. According to numerous experiments and analyses, MIEA-FCSM obtained excellent scores for key space ($2^{541}$), correlation coefficients (<0.004), information entropy (7.9994), NPCR (99.6098%), and UACI (33.4659%). Significantly, MIEA-FCSM also attained an average encryption rate as high as 168.5608 Mbps. Due to the superiority of the new fractional-order chaotic system, 2D-SCPM, and targeted designs, MIEA-FCSM outperforms many recently reported leading image encryption algorithms. Full article

Artificial intelligence (AI), once a phenomenon primarily in the world of science fiction, has evolved rapidly in recent years, steadily infiltrating into our daily lives. ChatGPT, a freely accessible AI-powered large language model designed to generate human-like text responses to users, has been utilized in several areas, such as the healthcare industry, to facilitate interactive dissemination of information and decision-making. Academic advising has been essential in promoting success among university students, particularly those from disadvantaged backgrounds. Unfortunately, however, student advising has been marred with problems, with the availability and accessibility of adequate advising being among the hurdles. The current study explores how AI-powered tools like ChatGPT might serve to make academic advising more accessible, efficient, or effective. The authors compiled a list of questions frequently asked by current and prospective students in a teacher education bachelor’s degree program in the United States. Then, the questions were typed into the free version of ChatGPT, and the answers generated were explored and evaluated for their content and delivery. ChatGPT generated surprisingly high-quality answers, written in an authoritative yet supportive tone, and it was particularly adept at addressing general and open-ended career-related questions, such as career outlook, in a clear, comprehensive, and supportive manner using plain language. We argue that AI-powered tools, such as ChatGPT, may complement but not necessarily replace human academic advisers and that these tools may very well serve to promote educational equity by empowering individuals from a wide range of backgrounds with the means to initiate effective methods of seeking academic advice. Full article

Over the past few years, chaotic image encryption has gained extensive attention. Nevertheless, the current studies on chaotic image encryption still possess certain constraints. To break these constraints, we initially created a two-dimensional enhanced logistic modular map (2D-ELMM) and subsequently devised a chaotic image encryption scheme based on vector-level operations and 2D-ELMM (CIES-DVEM). In contrast to some recent schemes, CIES-DVEM features remarkable advantages in several aspects. Firstly, 2D-ELMM is not only simpler in structure, but its chaotic performance is also significantly better than that of some newly reported chaotic maps. Secondly, the key stream generation process of CIES-DVEM is more practical, and there is no need to replace the secret key or recreate the chaotic sequence when handling different images. Thirdly, the encryption process of CIES-DVEM is dynamic and closely related to plaintext images, enabling it to withstand various attacks more effectively. Finally, CIES-DVEM incorporates lots of vector-level operations, resulting in a highly efficient encryption process. Numerous experiments and analyses indicate that CIES-DVEM not only boasts highly significant advantages in terms of encryption efficiency, but it also surpasses many recent encryption schemes in practicality and security. Full article

Multi-key Homomorphic Encryption (MKHE) scheme can homomorphically evaluate ciphertexts encrypted by different keys, which can effectively protect the privacy information of data holders in the joint computing of cloud services. Since the first full Homomorphic encryption scheme was proposed, bootstrapping is the only way to realize the arbitrary depth homomorphic computation of MKHE schemes. But bootstrap operation is quite expensive. In order to implement fast bootstrapping in MKHE schemes, previous works proposed multi-key TFHE schemes to implement low-latency bootstrapping and output a univariate function of messages after bootstrapping, called Programmable Bootstrapping (PBS). However, these schemes can only encrypt single-bit messages. PBS only outputs a function. And after a homomorphic operation, a bootstrap is required, which undoubtedly results in an increase in the cost of the whole multi-key homomorphic encryption operation. In this paper, we propose a MKHE scheme for multi-output PBS. For this purpose, we study the encryption method and homomorphic operation steps of MKHE, and add BFV homomorphic encryption multiplication and multi-key ciphertext relinearization. We separate the homomorphic operation from bootstrapping. We homomorphically evaluate test polynomials for multiple functions. In contrast to previous MKHE schemes, we support the output of multiple message-related functions with a single bootstrapping operation on the ciphertext. It is no longer limited to encrypting single-bit plaintext, and an effective ciphertext packaging technology is added. According to the analysis given in this paper, it is known that in the scenario of multi-party joint computation, the proposed scheme can be implemented with less bootstrapping when the same number of functions are homomorphically operated. This will effectively reduce the computational overhead. Full article

Key-dependent message (KDM) security identity-based encryption (IBE) schemes aim to solve the security risks caused by the dependency between plaintext and secret keys in traditional IBE schemes. However, current KDM-IBE schemes are only secure with respect to affine functions, which limits their security level when a message is derived from the evaluation of a polynomial function using the secret key. To address this issue, in this study, we propose a novel approach to construct a KDM-IBE scheme with respect to polynomial or even arbitrary functions that achieves maximum security based on the learning with errors (LWE) assumption. Our approach overcomes two major technical barriers to constructing KDM-IBE schemes with respect to polynomial functions. Compared to existing KDM-IBE schemes, our proposed scheme ensures the secrecy of the key-related plaintext, even when it is obtained using arbitrary functions, not just affine functions. Thus, our approach provides a more robust solution to the security risks inherent in traditional IBE schemes. Full article