Key Generation Model Research Articles

Reversible image hiding algorithm based on adaptive embedding mechanism

A reversible blind image hiding algorithm (ReBIHA) with help of an adaptive embedding mechanism and a compressive sensing technology is presented in this paper, of which can effectively hide the secret image through a natural meaningful carrier image. In the first phase, a new key generation model (KeyGM) is built by combining random numbers and the plaintext, followed by a newly designed four dimensional chaotic map (NewCM) with stronger pseudo-randomness. Then, the generated chaotic sequence is taken to produce a measurement matrix for compressive sensing. In the second phase, the plain image is sparsely processed, confused, encrypted and compressed to get measurements. Afterward, these measurements are subjected to diffusion and binary exchange to achieve a middle cipher image (MCI). In the third stage, a meaningful carrier image is randomly selected, and integer wavelet transform (IWT) is applied to it, getting one low-frequency and three high-frequency coefficients. Then, the pixels of MCI are subjected by splitting and symmetrically shifting transformation for three element matrices. Finally, these matrices are respectively embedded into the high-frequency coefficients through an adaptive mechanism to find replaceable elements, and a final carrier image hiding secrets (CiHS) can be achieved after performing an inverse IWT. The experimental results show that the proposed algorithm can avoid the extra transmission of original carrier image. Moreover, peak signal-to-noise ratio (PSNR) of reconstructed image can surpass 32 dB at compression ratio 0.5. Especially, the proposed adaptive embedding mechanism can not only achieve blind extraction of secrets well, but also ensure the visual quality for the original carrier image.

Polar code-based secure transmission with higher message rate combining channel entropy and computational entropy

The existing physical layer security schemes, which are based on the key generation model and the wire-tap channel model, achieve security by utilizing channel reciprocity entropy and noise entropy, respectively. In contrast, we propose a novel secure transmission framework that combines noise entropy with reciprocity entropy, achieved by inserting reciprocity entropy into the frozen bits of polar codes. Note that in real-world scenarios, when eavesdroppers employ polynomial-time attacks, the bit error rate (BER) increases due to the introduction of computational entropy. To achieve indistinguishability security, we convert the practical physical layer security metric, BER, into the average min-entropy, a widely accepted concept in cryptography. The simulation results demonstrate that the eavesdropper’s BER can be significantly increased without compromising the communication performance of the legitimate receiver. Under concrete parameters we selected, when compared to the joint scheme of physical layer key generation and one time pad, the modular semantically-secure scheme based on the wire-tap channel model, and the simple channel entropy combination scheme, our scheme achieves a message rate approximately 1.2 times, 3.8 times, and 1.4 times better, respectively. Experimental testing validates the feasibility of our scheme.

An Algorithm to Increase the Attached Complexity and Time Consumption for Iot Healthcare Applications Based on the Truncated Quantum Hashed Method

Internet of Things (IoT) implementations have been used in numerous healthcare domains. The majority of smart devices are connected, including the automatic environment in which such systems operate. Security and privacy have emerged as major challenges for IoT management. Recently published research has revealed the effectiveness of Elliptic Curve Cryptography (ECC) techniques are very useful for undertaking security research and evaluation of IoT applications and have numerous advantages over further techniques. The objective of this research paper is to suggest options for where to improve the encryption system in the ECC technique, with numerous optimization techniques to prepare the best enhancement of the light-weight algorithm. Our primary focus is on enhancing the Truncated Quantum Hashed Signature (TQHS) methods to increase the complexity of the adaptation and reduce the time utilization of the ECC encryption model. A hybrid data encryption architecture model integrating an ECC model with a TQHS-based architecture design to develop a lightweight encryption technology and the proposed Truncated Quantum Hashed Signature method integrates a random Hashed Signature methodology with a key generation model to improve security complexity. Second, from the standpoint of IoT security systems, Comparison and estimation of memory consumption and time complexity analyses to increase privacy and security. Lastly, we enhance the encryption system parameters in the ECC method. In the proposed work, we present a novel model of random key formation for the ECC to improve the model as a lightweight architecture.

A Rubik's Cube Cryptosystem-based Authentication and Session Key Generation Model Driven in Blockchain Environment for IoT Security

Over the past decade, IoT has gained huge momentum in terms of technological exploration, integration, and its various applications even after having a resource-bound architecture. It is challenging to run any high-end security protocol(s) on Edge devices. These devices are highly vulnerable toward numerous cyber-attacks. IoT network nodes need peer-to-peer security, which is possible if there exists proper mutual authentication among network devices. A secure session key needs to be established among source and destination nodes before sending the sensitive data. To generate these session keys, a strong cryptosystem is required to share parameters securely over a wireless network. In this article, we utilize a Rubik's cube puzzle-based cryptosystem to exchange parameters among peers and generate session key(s). Blockchain technology is incorporated in the proposed model to provide anonymity of token transactions, on the basis of which the network devices exchange services. A session key pool randomizer is used to avoid network probabilistic attacks. Our hybrid model is capable of generating secure session keys that can be used for mutual authentication and reliable data transferring tasks. Cyber-attacks resistance and performance results were verified using standard tools, which gave industry level promising results in terms of efficiency, light weightiness, and practical applications.

Image encryption approach using improved chaotic system incorporated with differential evolution and genetic algorithm

Meta-heuristic techniques are widely used to solve different complex real-life problems in recent scenarios. In this work, traditional key-generation mechanisms have been combined with meta-heuristic techniques to derive new key generation models in chaos-based image cryptography. Initially, one among the key-strings has been generated using the logistic map approach that is known for its ability to produce effective chaotic performance. In this paper, the chaotic effect of the key-string generated by the logistic map has further been enhanced by the application of differential evolution (DE), a population-based meta-heuristic optimization algorithm. This improved key sequence is used to produce chaotic a map which has been applied to images for diffusion operation. The confusion operation on the other hand is performed by the transposition process using another key-string produced by the application of another meta-heuristic technique, namely, Genetic Algorithm (GA). After thorough experimental works, the results have been compared with the state-of-the-art and it is observed that the approach proposed here provides strong cryptographic behavior in terms of information entropy, key sensitivity, robustness against noise, and hereby stands against all kinds of statistical and differential attacks including brute force.

Impersonation Attack Detection in Mobile Edge Computing by Levering SARSA Technique in Physical Layer Security

Smart health systems typically integrate sensor technology with the Internet of Things, enabling healthcare systems to monitor patients. These biomedical applications collect healthcare data through remote sensors and transfer the data to a centralized system for analysis. However, the communication between the edge node and the mobile user is susceptible to impersonation attacks in mobile edge computing (MEC) for the biomedical application. For this purpose, we propose a detection mechanism for medical and healthcare services, i.e., reinforcement learning for impersonation attacks. We construct a system model of MEC, a key generation model (KGM), and an impersonation attack model (IAM). In addition, we also design an impersonation attack detection algorithm based on the SARSA technique under the IAM. In our proposed work, the SARSA-based method outplays the detection of impersonation attacks in the dynamic environment compared to the traditional Q-learning technique. Finally, we evaluate the false alarm rate (FAR), miss detection rate (MDR), and average error rate (AER) in the hypothesis tests to compare the performance of our proposed method with the traditional Q-learning. In comparison to the classic Q-learning based technique, simulation experiments show that the suggested approach can avoid impersonation attacks in a dynamic environment for medical and healthcare services. The results also indicate that the SARSA technique has a high detection accuracy and low average error rate compared to the conventional Q-learning based approach.

An optimal swift key generation and distribution for QKD

Secured transmission between users is essential for communication system models. Recently, cryptographic schemes were introduced for secured transmission and secret transmission between cloud users. In a cloud environment, there are many security issues that occur among the cloud users such as, account hacking, data breaches, broken authentication, compromised credentials, and so on. Quantum mechanics has been implemented in cryptography that made it efficient for strong security concerns over outsourced data in a cloud environment. Therefore, the present research focuses on providing excellent security for cloud users utilizing a swift key generation model for QKD cryptography. The Quantum Key Distribution (QKD) is an entirely secure scheme known as Cloud QKDP. Initially, a random bit sequence is generated to synchronize the channel. An eavesdropper will not permit to synchronize parameters between them. In this key reconciliation technique, the random bit sequence is concatenated with the photon polarisation state. BB84 protocol is improved by optimizing its bit size using FireFly Optimization (FFO) at the compatibility state, and in the next state, both transmitter and receiver generate a raw key. Once the key is generated, it is then used for the transmission of messages between cloud users. Furthermore, a Python environment is utilized to execute the proposed architecture, and the accuracy rate of the proposed model attained 98 %, and the error rate is 2 %. This proves the performance of the proposed firefly optimization algorithm based swift key generation model for QKD performs better than previous algorithms.

A NEW TECHNIQUE FOR DETERMINING REGION OF INTEREST IN SELECTIVE VIDEO PROTECTION APPROACH

Today, the use of video communication in real-time applications is rising at a rapid rate and most of these videos require secure transmission like surveillance, video conferencing, video on demand, and medical and military imaging systems. The trade-off between data security and real-time performance is the main challenge in this field. This paper presents a protection approach for H.246 compression standard that provides a balancing between the security level and coding efficiency. A new technique of region selection for the motion information of the video is designed based on canny edge detection scaling which reduces the amount of encrypted data ,and a strong and fast stream encryption is presented using key generation model of chaos method and RC4 algorithm. The experimental results of the performance metrics confirmed the high perceptual and cryptographic security of the proposed approach against attacks and showed that all the requirements of compression efficiency are satisfied.

A lightweight authentication scheme for 5G mobile communications: a dynamic key approach

The security of modern IoT Industry 4.0, 5G, 6G, Mobile ad hoc (MANET), narrowband internet of things (NB-IoT) and wireless sensory (WSN) networks and the autonomous computing capabilities of individual devices and self-organizing, greatly influence their applications in smart connected world. To achieve the sufficient security and privacy, autonomous and dynamic adaptive key management scheme and mutual authentication protocols should be provided to validate legitimacies of large number of nodes, users, devices, and servers in 5G networks. To this end, we propose a lightweight cipher approach that enhances the security level of communications and enables authentication and access control scheme that is implemented on a multi-layer communication architecture designed for NB-IoT 5G networks and resolve heterogeneity and scalability issues. It is well known that establishing an efficient cryptographic key generation and management scheme for machine-to-machine (M2M) and device-to-device (D2D) communication for IoT networks in 5G, the purposes of encryption and decryption is severely constrained by computation resources and performance. As a part of the network security, the key management plays a vital role in it. When compared to other schemes in PKI such as public key, pairwise-key and group-based key management, the dynamic-key based security is efficient in resource utilization and scalable which are the two key performance factors for Cloud based IoT/wireless sensory networks. Usually most IoT networks use a less secure communication channel that employs session keys in order to encrypt the communication. Additionally, in most IoT networks the resource consumption is constrained which then results in existing dynamic key generation algorithms being infeasible to run. It is still a challenging problem to securely interconnect and operate IoT protocols between constrained embedded devices. We propose a novel dynamic key generation scheme that takes the entropy and performs various operations to continuously generate a large set of unique keys. This type of key generation model is predominantly suitable for the conditions where the IoT devices cannot rely on constant key negotiation with dedicated servers as well as those devices which cannot reuse existing keys for encryption purposes. Performance evaluation using simulation and case study demonstrates that our dynamic key establishment scheme ensures an enhanced security level while reducing the communication overhead and the average latency for different category of IoT applications in 5G networks.

Power Allocation and Beam Scheduling for Multi-User Massive MIMO Secret Key Generation

Secret key generation in multi-user massive multiple-input multiple-output (MIMO) communication suffers from high computation complexity, pilot overhead, and inter-user interference caused by the large dimension of the massive MIMO channel. To address these problems, this paper proposes a novel key generation approach that exploits the beam domain channel for channel feature extraction. The proposed approach can effectively reduce the channel feature dimension and mitigate the inter-user interference, via the well-designed power allocation and beam scheduling algorithms. Specifically, the multi-user key generation model is built and the design problem of channel feature extraction matrices is formulated as a sum key rate maximization problem. To tackle this problem, we derive an upper bound of the secret key rate and prove that the upper bound maximization is a convex optimization. After solving the upper bound maximization, the base station (BS) obtains the sum beams for all the users. To allocate the selected beams to each user, an efficient beam scheduling algorithm is proposed, which converges to a locally optimal solution with low computational complexity. Numerical results illustrate that in the proposed scheme, the bit disagreement ratio (BDR) of legitimate users achieves 10 -2 , while that of the eavesdropper tends to 0.5, confirming the feasibility and security of the proposed scheme.

Performance improvement of wireless secret key generation with colored noise for IoT

SummaryAchieving security in the Internet of things (IoT) networks by generating symmetric keys from the wireless channel parameters like received signal strength (RSS) is a promising approach. Despite the easy acquisition of the RSS signal, RSS‐based security is less explored for IoT. In this work, we analyze the performance of RSS‐based wireless physical layer key generation with correlated colored noise components and proposed a low complexity filtering approach to improve the performance for the IoT network. We started with providing a survey of various recent researches related to RSS‐based key generation and also discussed correlated colored noise components with a few of the recent works considering them. Further, we analyze various colored noise components in the time domain by the Allan variance and Ljung‐Box test. Furthermore, we develop a key generation model and proposed a moving window averaging‐based filtering followed by Lloyd max quantization to improve the BDR performance, degraded due to the presence of correlated colored noise components. The simulation results show that the proposed preprocessing technique has a considerable improvement in the BDR performance, and the keys generated have sufficient randomness, which is verified by NIST test.

Secret-Key Generation: Full-Duplex Versus Half-Duplex Probing

A secret-key agreement for in-band full-duplex (FD) technology can be regarded as a valuable method for establishing security at the physical layer level. In this paper, we study an FD system model in conjunction with a secret-key agreement. The legitimate users interact through two-way channel probing and one-way reconciliation. We first introduce two complementary key generation models for FD and half-duplex (HD) settings, and compare their performances by introducing the key-reconciliation function. Furthermore, we study the impact of probing-reconciliation tradeoff and the role of a strong eavesdropper, and analyze the system performance in the high-signal-to-noise ratio regime. We show that under certain conditions, the FD mode negatively affects the capabilities of the eavesdropper and offers several advantages in terms of secret-key rate over the conventional HD setups. Our analysis reveals that the perfect self-interference cancellation is not necessary to obtain performance gains over the HD mode.

Secret Key Generation With Limited Interaction

A basic two-terminal secret key generation model is considered, where the interactive communication rate between the terminals may be limited, and in particular may not be enough to achieve the maximum key rate. We first prove a multi-letter characterization of the key-communication rate region (where the number of auxiliary random variables depends on the number of rounds of the communication), and then provide an equivalent but simpler characterization in terms of concave envelopes in the case of unlimited number of rounds. Two extreme cases are given special attention. First, in the regime of very low communication rates, the key bits per interaction bit (KBIB) is expressed with a new “symmetric strong data processing constant”, which has a concave envelope characterization analogous to that of the conventional strong data processing constant. The symmetric strong data processing constant can be upper bounded by the supremum of the maximal correlation coefficient over a set of distributions, which allows us to determine the KBIB for binary symmetric sources, and conclude, in particular, that the interactive scheme is not more efficient than the one-way scheme at least in the low communication-rate regime. Second, a new characterization of the minimum interaction rate needed for achieving the maximum key rate (MIMK) is given, and we resolve a conjecture by Tyagi regarding the MIMK for (possibly nonsymmetric) binary sources. We also propose a new conjecture for binary symmetric sources that the interactive scheme is not more efficient than the one-way scheme at any communication rate.

Backup key generation model for one-time password security protocol

The use of one-time password (OTP) has ushered new life into the existing authentication protocols used by the software industry. It introduced a second layer of security to the traditional username-password authentication, thus coining the term, two-factor authentication. One of the drawbacks of this protocol is the unreliability of the hardware token at the time of authentication. This paper proposes a simple backup key model that can be associated with the real world applications’user database, which would allow a user to circumvent the second authentication stage, in the event of unavailability of the hardware token.

Multi-Key Generation Over a Cellular Model With a Helper

The problem of simultaneously generating multiple keys for a cellular source model with a helper is investigated. In the model considered, there are four terminals, $\mathcal {X}_{0}$ , $\mathcal {X}_{1}$ , $\mathcal {X}_{2}$ , and $\mathcal {X}_{3}$ , each of which observes one component of a vector source. Terminal $\mathcal {X}_{0}$ wishes to generate two secret keys $K_{1}$ and $K_{2}$ , respectively, with terminals $\mathcal {X}_{1}$ and $\mathcal {X}_{2}$ under the help of terminal $\mathcal {X}_{3}$ . All terminals are allowed to communicate over a public channel. An eavesdropper is assumed to have access to the public discussion. Both symmetric and asymmetric key generations are considered. In symmetric key generation models, model 1a (with a trusted helper) requires that the two keys are concealed from the eavesdropper, and model 1b (with an untrusted helper) further requires that the two keys are concealed from the helper in addition to the eavesdropper. The asymmetric key generation models 2a and 2b are the same as symmetric key generation models 1a and 1b, respectively, except that the key $K_{2}$ is further required to be concealed from terminal $\mathcal {X}_{1}$ . For all models studied, the key capacity region is established by designing a unified achievable strategy to achieve the cut-set outer bounds. We also study the problem of generating more than two keys and characterize its key capacity region when all the cellular terminals are required to generate independent keys with the base station.

Delay Analysis of Physical-Layer Key Generation in Dynamic Roadside-to-Vehicle Networks

Secret key generation by extracting the shared randomness in a wireless fading channel is a promising way to ensure wireless communication security. Previous studies only consider key generation in static networks, but real-world key establishments are usually dynamic. In this paper, for the first time, we investigate the pairwise key generation in dynamic wireless networks with a center node and random arrival users (e.g., roadside units (RSUs) with vehicles). We establish the key generation model for these kinds of networks. We propose a method based on discrete Markov chain to calculate the average time a user will spend on waiting and completing the key generation, called average key generation delay (AKGD). Our method can tackle both serial and parallel key generation scheduling under various conditions. We propose a novel scheduling method, which exploits wireless broadcast characteristic to reduce AKGD and probing energy. We conduct extensive simulations to show the effectiveness of our model and method. The analytical and simulation results match each other.

Secret key generation scheme based on MIMO received signal spaces}{Secret key generation scheme based on MIMO received signal spaces

Conventional secret key generation scheme cannot achieve high key generation rate when the channel characteristics change slowly. To solve this problem, a secret key generation model based on the MIMO received signal space is investigated in this paper. In this model, the legitimate transmitter and receiver distill secret keys from the received signal space, and improve the randomness of the received signals by controlling the variance of the transmitted signals, so that the update of the secret key is independent of the time variance of the wireless channel. Then a specific key generation scheme is proposed, in which the legitimate nodes can obtain the same received signal space, from which common vectors can be selected to distill the keys. In addition, an optimal power allocation method to maximize the key rate is presented. The results of the simulation confirm the effectiveness of this scheme.

상용 비디오 콘텐츠 보호를 위한 일회용 바이오메트릭 키 생성 및 인증 모델

Most peoples are used to prefer to view the video contents rather than the other contents since the video contents are more easy to understand with both their eyes and ears. As the wide spread use of smartphones, the demands for the contents services are increasing rapidly. To promote the contents business, it`s important to provide security of subscriber authentication and corresponding communication channels through which the contents are delivered. Generally, symmetric key encryption scheme is used to protect the contents in the channel, and the session key should be upadated periodically for the security reasons. In addition, to protect viewing paid contents by illegal users, the proxy authentication should not be allowed. In this paper, we propose biometric based user authentication and one time key generation models. The proposed model is consist of biometric template registration, session key generation and chanel encryption steps. We analyze the difference and benefits of our model with existing CAS models which are made for CATV contents protection, and also provides applications of our model in electronic commerce area.

Cryptographic Secrecy of Steganographic Matrix Embedding

Some information-hiding schemes are scrutinized in terms of their cryptographic secrecy. The schemes under study appeal to the so-called matrix embedding strategy, designed to optimize embedding capacity under distortion constraints, as opposed to any cryptographic measure. Nonetheless, we establish conditions under which a key equivocation function is optimal, and show that under reasonable key generation models, a perfect secrecy property is nearly satisfied, limited by a mutual information measure that decreases exponentially with the block length.