Key Generation Algorithm Research Articles

A secret key establishment in frequency division duplex communication systems under active attacker

Most of the current research on generating a secret key from wireless fading channels relies on the channel reciprocity feature of the time division duplex link between legitimate entities so that they can acquire related information from the joint wireless connection. This paper investigates the challenge of generating a shared secret key in frequency division duplex communication systems, in which there is no reciprocity between the two nodes, in the presence of an active opponent. We suggest a key generation algorithm that depends on the product of two fading coefficients. We additionally look at the effects of an interfering adversary on the suggested key establishment scheme and solve the problem of evaluating the key rate for a scheme depending on virtual channel gain. We illustrate an adversary model using an optimal attacking strategy to minimize the rate of generating a shared secret key for our suggested algorithm. Additionally, we identify the suitable channel conditions for the non‐zero rate in the existence of an interfering adversary using simulation results.

A novel plaintext-related image encryption scheme using hyper-chaotic system

A novel and secure plaintext-related image encryption scheme is given in this paper using hyper-chaotic Lorenz system and hash function. In our scheme, we used the classical encryption architecture: permutation and diffusion. The initial conditions of hyper-chaotic Lorenz system which is employed in permutation and key stream generation algorithms are generated by information of the original image and initial key. Therefore, the encryption process has a strong relationship with plain image in the proposed scheme. So, our work performs excellently on resisting the known-plaintext attack. In addition, results of many widely used security analyses and comparisons with other works show that our work has outstanding security performance for the digital image communication.

Key generation for plain text in stream cipher via bi-objective evolutionary computing

Evolutionary algorithms are widely used to solve a wide variety of continuous, discrete and combinatorial optimization problems. Evolutionary multi-objective optimization problems seek Pareto front in order to negotiate the trade-off amongst various objective functions present in the problem. Much of the literature on cryptography focuses on making the inference problem harder, for securing the content. In this paper, we developed key generation algorithms using Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) in the bi-objective optimization framework and Improved Modified Harmony Search + Differential Evolution (IMHS+DE), Differential Evolution (DE) and Improved Modified Harmony Search (IMHS), in the single objective optimization framework. For encoding the keystream thus generated as well as the plain text we employed the Mutated Huffman Tree Coding algorithm. In the next phase, we encrypted the encoded keystream as well as the encoded plain text in order to generate the cipher text. We then decrypted the cipher text using the encoded key stream followed by the decoding of the deciphered text using the code tables. Following the literature, we generated random texts of varying lengths and code table sizes in order to demonstrate the effectiveness of our proposed method. The proposed algorithms are compared with the extant methods. In the case of bi-objective optimization set up, we also plotted the empirical attainment function (EAF) surface to summarize the effectiveness of the NSGA-II based key generation algorithm. Of particular significance is the highest entropy value yielded by the NSGA-II based algorithm, which in turn indicates the strength of the key generated by the NSGA-II.

HVDB: a hierarchical verifiable database scheme with scalable updates

The notion of verifiable database (VDB) plays an important role in secure outsourcing of data storage, which allows a client, typically a resource-constraint one, to outsource the large-scale databases to an untrusted server and make retrieval and update queries. For each query request, the server responds with a query result and a proof which is used to verify the result. Plenty of research work has been done on designing efficient VDB schemes in the past years. However, it seems that all of the existing VDB schemes are presented in the amortized model. That is, all existing VDB schemes require a prohibitively expensive pre-processing stage. As a result, the overhead for the initialization algorithm (e.g., the key generation algorithm) is too heavy to afford by the client. Furthermore, VDB schemes can only ensure the integrality of the whole database. However, it is incapable of verifying a segment of the database and localizing the tampered record efficiently when the database is tampered with. In this paper, we firstly propose a new primitive called Vector Commitment Tree (VCT), in which each node is a vector commitment (VC) of its q children. Then, we utilize VCT as a building block to propose a hierarchical verifiable database scheme (HVDB) with scalable updates, which supports the hierarchical verification and the tampered record localization. Besides, HVDB can also greatly reduce the burden of initialization algorithm of VDB schemes. Finally, the analysis and experimental results show that the proposed HVDB scheme can achieve the desired security requirements and improve the efficiency for practical application.

Centralized cloud information accountability with bat key generation algorithm (CCIA-BKGA) framework in cloud computing environment

In cloud storage, without any complexity, the nearby information stockpiling and support, the clients can indirectly keep up their information and appreciate the on-request superb applications and administrations from a shared pool of configurable computing resources. Nevertheless, the data integrity protection in cloud computing becomes a tedious task, because the client doesn’t have physical possession of the outsourced data, especially for the users with the restricted computing resources. The essential component of the cloud services is that, the clients’ information will be prepared remotely in obscure machines, where the clients have no rights on it. In order to rectify this issue, a novel highly centralized cloud information accountability with bat key generation algorithm (CCIA-BKGA) framework is suggested to maintain the concrete usage of the users’ data in the cloud. It will encircle the logging mechanism together with users’ data and policies. Before initiating the imploding processing the cloud server, first it required to convert the general information & sensitive information into an extensible markup language file format and get saved inside file. After that, Java ARchive (JAR) label setting has to be done which will be completed at the side of the data owner, then the label attributes will work according to the following functionality such as signature key value, and unique identifier. Use the JAR programmable has the capacity for both to produce a dynamic and traveling object, and to guarantee that any entrance to clients’ information will trigger verification and robotized logging facilities for local in the JARs. CCIA-BKGA structure is platform-independent and profoundly decentralized, it doesn’t request any obsessive validation or capacity framework set up and furthermore it gives the broad exploratory examinations which clarify the proficiency and adequacy of the proposed CCIA-BKGA system and existing methodologies.

Key Generation Algorithm Using Soft Set for Data Security in Internet of Things

Today, information security is a major challenge because of the new advances in the technologies as well as the explosive growth of the processing power and data storage capabilities in communication devices. This research incorporates the soft set with information security in the Internet of Things environment. This paper presents a new-fangled algorithm using soft set and soft spaces for generating key for information encryption. An algorithm SoftKeyGen for key generation is proposed using soft set and is proved with a mathematical illustration. The significance of the proposed algorithm is also presented.

Research on key techniques of cryptographic access control and properties optimisation in cloud storage

With the analysis of data privacy protection requirement from the users, we proposed cryptographic access control scheme and key distribution scheme based on ciphertext-policy attribute-based encryption (CP-ABE), and gave a hierarchy based on CP-ABE key generation algorithm. This scheme uses precise identity and hierarchal structure as the user attributes, and supports hierarchal key generation. As the cloud data are encrypted by the users, the data privacy protection can be effectively achieved in cloud storage against network attackers even if cloud service provider (CSP), suitable for the multi-user who has hierarchal structure attributes sharing cloud storage services environment. We also proposed two schemes for improving the usability of cloud storage system. The first one is that the metadata information of unstructured data are stored in cloud using non-relational database MongoDB, which can greatly improve the speed of data access. The second is data migration algorithm based on physical volume, which can migrate data to the matching devices automatically depending on user access frequency value. Experimental results showed that these programs were able to improve the storage efficiency of cloud storage system. The study is of theoretical significance and practical value to the similar systems.

Research on key techniques of cryptographic access control and properties optimisation in cloud storage

With the analysis of data privacy protection requirement from the users, we proposed cryptographic access control scheme and key distribution scheme based on ciphertext-policy attribute-based encryption (CP-ABE), and gave a hierarchy based on CP-ABE key generation algorithm. This scheme uses precise identity and hierarchal structure as the user attributes, and supports hierarchal key generation. As the cloud data are encrypted by the users, the data privacy protection can be effectively achieved in cloud storage against network attackers even if cloud service provider (CSP), suitable for the multi-user who has hierarchal structure attributes sharing cloud storage services environment. We also proposed two schemes for improving the usability of cloud storage system. The first one is that the metadata information of unstructured data are stored in cloud using non-relational database MongoDB, which can greatly improve the speed of data access. The second is data migration algorithm based on physical volume, which can migrate data to the matching devices automatically depending on user access frequency value. Experimental results showed that these programs were able to improve the storage efficiency of cloud storage system. The study is of theoretical significance and practical value to the similar systems.

Efficient secure system of data in cloud using steganography based cryptosystem with FSN

Data sharing is one of the most important functionality in cloud and one of the challenging problem is sharing data securely with others. Sharing the data with security and confidentiality on cloud with data integrity is discussed in this paper. We describe random key generation algorithm using that random sized public/master-secret key pair is created by data owner. The novelty is that data owner encrypts the data using feistal structure network along with the public key and the data index into an image and this is done by using steganography & then the data are uploaded in the Cloud Server. Aggregate Decryption Key (ADK) is mainly used to generate the Master- secret key where it is used for sharing the data to other users by transferring its ADK to those who are interested in accessing the contents through E-mail by the data owner. Original Data is downloaded only after Verification of ADK and the authentication that are done by 3D scan of finger print authentication.

DNA Cryptography and Deep Learning using Genetic Algorithm with NW algorithm for Key Generation.

Cryptography is not only a science of applying complex mathematics and logic to design strong methods to hide data called as encryption, but also to retrieve the original data back, called decryption. The purpose of cryptography is to transmit a message between a sender and receiver such that an eavesdropper is unable to comprehend it. To accomplish this, not only we need a strong algorithm, but a strong key and a strong concept for encryption and decryption process. We have introduced a concept of DNA Deep Learning Cryptography which is defined as a technique of concealing data in terms of DNA sequence and deep learning. In the cryptographic technique, each alphabet of a letter is converted into a different combination of the four bases, namely; Adenine (A), Cytosine (C), Guanine (G) and Thymine (T), which make up the human deoxyribonucleic acid (DNA). Actual implementations with the DNA don't exceed laboratory level and are expensive. To bring DNA computing on a digital level, easy and effective algorithms are proposed in this paper. In proposed work we have introduced firstly, a method and its implementation for key generation based on the theory of natural selection using Genetic Algorithm with Needleman-Wunsch (NW) algorithm and Secondly, a method for implementation of encryption and decryption based on DNA computing using biological operations Transcription, Translation, DNA Sequencing and Deep Learning.

High‐rate secret key generation aided by multiple relays for Internet of things

A multiple relays aided secret key generation algorithm is proposed to improve the generated secret key rate for Internet of things when the wireless channels change slowly. First, the two legitimate users and relays send training sequences in turn to estimate the channels. Then, the relays employ secure network coding technique to help the two legitimate users exploit the randomness of relay channels. Finally, the two legitimate users agree on a secret key without the help of relays. In addition, the optimal relays selection with optimal power allocation algorithm is present to further improve the secret key rate when relay selection is needed. The performances of the proposed algorithms are verified by Monte Carlo simulation results.

MuGKeG: Secure Multi-channel Group Key Generation Algorithm for Wireless Networks

The broadcast nature of communication channels in infrastructureless wireless networks poses challenges to security. In this paper, we propose a novel technique namely secure multi-channel group key generation (MuGKeG) algorithm. We utilize the available channels switching behaviour between multiple nodes to hide our key from eavesdropper. We provide descriptions for an illustrative base case of three users and one eavesdropper and expand it for the case of N users with C channels and M eavesdroppers. Repeated application of the MuGKeG algorithm on the order of $$O(\log {N})$$ allows scaling the size of the group in the order of millions. We provide an analytical closed-form solution for the entropy of the secret group key generated when eavesdroppers follow an optimal attack strategy, and verify it by ns-3 simulations. Comparison with previous state-of-the-art schemes suggests that MuGKeG can provide upto 20 kbps increase in secrecy rate with a scalable key size.

Double image compression and encryption scheme using logistic mapped convolution and cellular automata

Due to the availability and increased usage of multimedia applications, features such as compression and security has gained more importance. Here, we propose a key generation algorithm and a double image encryption scheme with combined compression and encryption. The keys for encryption are generated using a novel modified convolution and chaotic mapping technique. First, the four least significant bits of the two images were truncated and then combined after permutation using the proposed logistic mapping. Also, cellular automata based diffusion is performed on the resultant image to strengthen the security further. Here, both confusion and diffusion seem to be integrated thus improvising the encryption scheme. The performance results and the test of randomness of the key and the algorithm were found to be successful. Since two images are compressed and encrypted simultaneously, it is useful in real - time scenarios.

Energy Efficient Partial Permutation Encryption on Network Coded MANETs

Mobile Ad Hoc Networks (MANETs) are composed of a large number of devices that act as dynamic nodes with limited processing capabilities that can share data among each other. Energy efficient security is the major issue in MANETs where data encryption and decryption operations should be optimized to consume less energy. In this regard, we have focused on network coding which is a lightweight mechanism that can also be used for data confidentiality. In this paper, we have further reduced the cost of network coding mechanism by reducing the size of data used for permutation. The basic idea is that source permutes only global encoding vectors (GEVs) without permuting the whole message symbols which significantly reduces the complexity and transmission cost over the network. We have also proposed an algorithm for key generation and random permutation confusion key calculation. The proposed scheme achieves better performance in throughput, encryption time, and energy consumption as compared to previous schemes.

A Ciphertext-Policy Attribute-Based Encryption Based on an Ordered Binary Decision Diagram

Ciphertext-policy attribute-based encryption (CP-ABE) is widely used in many cyber physical systems and the Internet of Things for guaranteeing information security. In order to improve the performance and efficiency of CP-ABE, this paper makes a change to the access structure of describing access polices in CP-ABE, and presents a new CP-ABE system based on the ordered binary decision diagram (OBDD). The new system makes full use of both the powerful description ability and the high calculating efficiency of OBDD. First, in the access structure, the new system allows multiple occurrences of the same attribute in a strategy, supports both positive attribute and negative attribute in the description of access polices, and can describe free-form access polices by using Boolean operations. Second, in the key generation stage, the size of secret keys generated by the new system is constant and not affected by the number of attributes; furthermore, time complexity of the key generation algorithm is O(1). Third, in the encryption stage, both the time complexity of the encryption algorithm and the size of generated ciphertext are determined by the number of valid paths contained in the OBDD instead of the number of attributes occurring in access polices. Finally, in the decryption stage, the new system supports fast decryption and the time complexity of the decryption algorithm is only O(1). As a result, compared with existing CP-ABE schemes, the new system has better performance and efficiency. It is proved that the new CP-ABE system can also resist collision attack and chosen-plaintext attack under the decisional bilinear Diffie Hellman assumption.

Side‐channel analysis of the modular inversion step in the RSA key generation algorithm

SummaryThis paper studies the security of the RSA key generation algorithm with regard to side‐channel analysis and presents a novel approach that targets the simple power analysis (SPA) vulnerabilities that may exist in an implementation of the binary extended Euclidean algorithm (BEEA). The SPA vulnerabilities described, together with the properties of the values processed by the BEEA in the context of RSA key generation, represent a serious threat for an implementation of this algorithm. It is shown that an adversary can disclose the private key employing only one power trace with a success rate of 100 % – an improvement on the 25% success rate achieved by the best side‐channel analysis carried out on this algorithm. Two very different BEEA implementations are analyzed, showing how the algorithm's SPA leakages could be exploited. Also, two countermeasures are discussed that could be used to reduce those SPA leakages and prevent the recovery of the RSA private key. Copyright © 2016 John Wiley & Sons, Ltd.

Development of key generation algorithm using ECG biometrics for node security in wireless body area sensor network

Summary This paper investigates security and inter-node transmission energy for biosensors in a wireless body area sensor network (WBASN) system. Existing security solutions in WBASN have been observed to employ the pre-deployment of static authentication keys, which are unsecured and energy intensive. Electrocardiogram (ECG) biometric-based security scheme was developed using the peak location index (PLI) and inter-pulse-interval (IPI) of the heart beat. The fast Fourier transform method was used to process individually selected ECG datasets of diabetic patients and the differential equation method was used to extract the ECG biometric features (PLI and IPI). Energy model of Chipcon CC2420 specification was used to evaluate inter-node energy consumption performance. The research results showed that different PLI and IPI features were extracted from the ECG datasets and unpredictable authentication keys were generated. Node energy consumption performance evaluation showed a 25% reduction in energy consumption for successful inter-node transmission. The ECG feature keys generated were different and unpredictable at every instant, providing for inter-node communication security. Non-additional node energy for processing the authentication acknowledgment packets provided for inter-node energy consumption reduction. The developed algorithm has provided for secured inter-node communication with a 25% energy efficiency in node transmission energy consumption for a WBASN system.

User Identity based Authentication as a Service (UIDAaaS) for Public Cloud Environment

Objectives: In today's Technological World, Information Security is an essential aspect for the internet applications. Cloud computing is an increasing current class of services for any type of users of the internet. Authentication is a major security problem in the cloud system and internet. This paper proposes an Authentication Password Generation (APG) algorithm, Authentication Key Generation (AKG) and Authentication Verification Algorithm (Auth_V) for security in the cloud system. Methods/Statistical Analysis: Authentication is more important among other security parameters such as integrity, confidentiality and privacy. Authentication mechanism includes different cryptography techniques that can be used for securing the data in cloud systems. These proposed three algorithms are used in the authentication process of cloud environment. It executes the ASCII code of each value in the original data. Findings: Proposed APG, AKG and Auth_V authentication algorithms are implemented in .NET and deployed on the windows azures platform of cloud environment. These proposed authentication algorithms easily fit into any type of service in the cloud system. APG is used to create a password which generates the alphabets along the special characters. Application/Improvements: Security is more important in the cloud computing. The proposed APG, AKG and Auth_V algorithms have provided better authentication mechanism to the cloud user. These techniques are suitable for education, healthcare and agriculture based applications to securely access the data in a cloud computing environment.

An efficient key management scheme for user access control in outsourced databases

Recently, researches on key management scheme for user access control in outsourced databases have been actively done. Because outsourced databases require dealing with a lot of users and data resources, an efficient key management scheme for reducing the number of authentication keys is required. However, the existing schemes have a critical problem that the cost of key management is rapidly increasing as the number of keys becomes larger. To solve the problem, we propose an efficient key management scheme for user access control in outsourced databases. For this, we propose an Resource Set Tree(RST)-based key generation algorithm to reduce key generation cost by merging duplicated data resources. In addition, we propose a hierarchical Chinese Remainder Theorem(CRT)-based key assignment algorithm which can verify a user permission to gain accesses to outsourced databases. Our algorithm can reduce key update cost because the redistribution of authentication keys is not required. We also provide the analytic cost models of our algorithms and verify the correctness of the theoretical analysis by comparing them with experiment results. Finally, we show from the performance analysis that the proposed scheme outperforms the existing schemes in terms of both key generation cost and update cost.

Group Secret Key Generation in Wireless Networks: Algorithms and Rate Optimization

This paper investigates group secret key generation problems for different types of wireless networks, by exploiting physical layer characteristics of wireless channels. A new group key generation strategy with low complexity is proposed, which combines the well-established point-to-point pairwise key generation technique, the multisegment scheme, and the one-time pad. In particular, this group key generation process is studied for three types of communication networks: 1) the three-node network; 2) the multinode ring network; and 3) the multinode mesh network. Three group key generation algorithms are developed for these communication networks, respectively. The analysis shows that the first two algorithms yield optimal group key rates, whereas the third algorithm achieves the optimal multiplexing gain. Next, for the first two types of networks, we address the time allocation problem in the channel estimation step to maximize the group key rates. This non-convex max–min time allocation problem is first reformulated into a series of geometric programming, and then, a single-condensation-method-based iterative algorithm is proposed. Numerical results are also provided to validate the performance of the proposed key generation algorithms and the time allocation algorithm.