A Probing Model of Secret Key Generation Based on Channel Autocorrelation Function

Secret key generation(SKG)is a promising solution to the problem of wireless communications security.As the first step of SKG,channel probing affects it significantly.Although there have been some probing schemes,there is a lack of research on the optimization of the probing process.This study investigates how to optimize correlated parameters to maximize the SKG rate(SKGR)in the time-division duplex(TDD)mode.First,we build a probing model which includes the effects of transmitting power,the probing period,and the dimension of sample vectors.Based on the model,the analytical expression of the SKGR is given.Next,we formulate an optimization problem for maximizing the SKGR and give an algorithm to solve it.We conclude the SKGR monotonically increases as the transmitting power increases.Relevant mathematical proofs are given in this study.From the simulation results,increasing appropriately the probing period and the dimension of the sample vector could increase the SKGR dramatically compared to a yardstick,which indicates the importance of optimizing the parameters related to the channel probing phase.

Physical-Layer Secret Key Generation for Dual-Task Scenarios

Physical-layer secret key generation(PSKG)provides a lightweight way for group key(GK)sharing between wireless users in large-scale wireless networks.However,most of the existing works in this field consider only group communication.For a commonly dual-task scenario,where both GK and pairwise key(PK)are required,traditional methods are less suitable for direct extension.For the first time,we discover a security issue with traditional methods in dual-task scenarios,which has not previously been recognized.We propose an innovative segment-based key generation method to solve this security issue.We do not directly use PK exclusively to negotiate the GK as traditional methods.Instead,we generate GK and PK separately through segmentation which is the first solution to meet dual-task.We also perform security and rate analysis.It is demonstrated that our method is effective in solving this security issue from an information-theoretic perspective.The rate results of simulation are also consistent with the our rate derivation.

Fast Secret Key Generation Based on Dynamic Private Pilot from Static Wireless Channels

In static or quasi-static wireless channel environments, secret key generation(SKG) based on wireless channels is vulnerable to active attacks due to the openness and invariance of public pilot, especially man-inthe-middle(MITM) attacks, where attacker acts as a transparent relay to manipulate channel measurements and derive the generated keys. In order to fight against this attack, a dynamic private pilot is designed, where both private pilot and secret key are derived from the characteristics of wireless channels and private to third party. In static or quasi-static environments, we use singular value decomposition techniques to reconstitute the wireless channels to improve the randomness of the wireless channels. Private pilot can encrypt and authenticate the wireless channels, which can make channel state information intercepted by MITM attacker reduced to zero and the SKG rate close to that without attacks. Results of analysis and simulation show the proposed SKG scheme can withdraw the MITM attacks.

Secret Key Generation Based on Two-Way Randomness for TDD-SISO System

A novel secret key generation(SKG)method based on two-way randomness is proposed for TDD-SISO system.The legitimate transceivers mutually transmit their own random signal via reciprocal wireless channel,then the multiplication of transmitted and received signal is used as common randomness to generate secret keys.In quasi-static channel,the theoretical SKG rates(SKGRs)of the three SKG methods,namely wireless channel based,one-way randomness and two-way randomness,are derived and compared.Further,two practical SKG schemes based on twoway randomness,Scheme-1bit and Scheme-3bit,are completely designed and simulated.Generally,Scheme-1bit applies to low signal to noise ratio(SNR)scenarios and achieves 0.13~0.86bit/T_s SKGR and 10^(-2)~10^(-5) level secret key outage probability(SKOP),while Scheme-3bit fits high SNR situation and obtains 0.93~1.35bit/T_s SKGR and 10^(-3)~10^(-4) level SKOP.At last,the national institute of standards and technology(NIST)test is conducted to evaluate the secret key randomness(SKRD)and the test results show that both of the proposed schemes have passed the test.

Power Allocation Strategy for Secret Key Generation Method in Wireless Communications

Secret key generation(SKG)is an emerging technology to secure wireless communication from attackers.Therefore,the SKG at the physical layer is an alternate solution over traditional cryptographic methods due to wireless channels’uncertainty.However,the physical layer secret key generation(PHY-SKG)depends on two fundamental parameters,i.e.,coherence time and power allocation.The coherence time for PHY-SKG is not applicable to secure wireless channels.This is because coherence time is for a certain period of time.Thus,legitimate users generate the secret keys(SKs)with a shorter key length in size.Hence,an attacker can quickly get information about the SKs.Consequently,the attacker can easily get valuable information from authentic users.Therefore,we considered the scheme of power allocation to enhance the secret key generation rate(SKGR)between legitimate users.Hence,we propose an alternative method,i.e.,a power allocation,to improve the SKGR.Our results show 72%higher SKGR in bits/sec by increasing power transmission.In addition,the power transmission is based on two important parameters,i.e.,epsilon and power loss factor,as given in power transmission equations.We found out that a higher value of epsilon impacts power transmission and subsequently impacts the SKGR.The SKGR is approximately 40.7%greater at 250 from 50 mW at epsilon=1.The value of SKGR is reduced to 18.5%at 250 mW when epsilonis 0.5.Furthermore,the transmission power is also measured against the different power loss factor values,i.e.,3.5,3,and 2.5,respectively,at epsilon=0.5.Hence,it is concluded that the value of epsilon and power loss factor impacts power transmission and,consequently,impacts the SKGR.

Never Lost Keys:A Novel Key Generation Scheme Based on Motor Imagery EEG in End-Edge-Cloud System

Biometric key is generated from the user’s unique biometric features,and can effectively solve the security problems in cryptography.However,the current prevailing biometric key generation techniques such as fingerprint recognition and facial recognition are poor in randomness and can be forged easily.According to the characteristics of Electroencephalographic(EEG)signals such as the randomness,nonlinear and non-stationary etc.,it can significantly avoid these flaws.This paper proposes a novel method to generate keys based on EEG signals with end-edgecloud collaboration computing.Using sensors to measure motor imagery EEG data,the key is generated via pre-processing,feature extraction and classification.Experiments show the total time consumption of the key generation process is about 2.45s.Our scheme is practical and feasible,which provides a research route to generate biometric keys using EEG data.

Physical-Layer Key Generation Based on Multipath Channel Diversity Using Dynamic Metasurface Antennas

Physical layer key generation(PKG)technology leverages the reciprocal channel randomness to generate the shared secret keys.The low secret key capacity of the existing PKG schemes is due to the reduction in degree-of-freedom from multipath fading channels to multipath combined channels.To improve the wireless key generation rate,we propose a multipath channel diversity-based PKG scheme.Assisted by dynamic metasurface antennas(DMA),a two-stage multipath channel parameter estimation algorithm is proposed to efficiently realize super-resolution multipath parameter estimation.The proposed algorithm first estimates the angle of arrival(AOA)based on the reconfigurable radiation pattern of DMA,and then utilizes the results to design the training beamforming and receive beamforming to improve the estimation accuracy of the path gain.After multipath separation and parameter estimation,multi-dimensional independent path gains are utilized for generating secret keys.Finally,we analyze the security and complexity of the proposed scheme and give an upper bound on the secret key capacity in the high signal-to-noise ratio(SNR)region.The simulation results demonstrate that the proposed scheme can greatly improve the secret key capacity compared with the existing schemes.

Efficient and Robust Two-Party RSA Key Generation

An efficient two party RSA secret key sharing generation scheme based on a homomorphic encryption, which is semantically secure under the prime residuosity assumption, is proposed in this paper. At the stage of computing RSA modulo N, an initial distributed primality test protocol is used to reduce the computation complexity and increase the probability of N being a two-prime product. On the other aspect, the homomorphic encryption based sharing conversion protocols is devised and adopted in multi-party computing modulus N and secret key d. Comparing to any sharing conversion protocols based on oblivious transfer protocol, the homomorphic encryption based sharing conversion protocols are of high performance. Our scheme resists the passive attack and since a method of verifying the sharing was introduced in, the scheme can resists any cheating behaviors too. Security proof, computation complexity and communication complexity analysis are given at last.

k-PARTY SHARED RSA KEY GENERATION

This letter presents a k-party RSA key sharing scheme and the related algorithms are presented. It is shown that the shared key can be generated in such a collaborative way that the RSA modulus is publicly known but none of the parties is able to decrypt the enciphered message individually.

Remote Sensing Image Encryption Using Optimal Key Generation-Based Chaotic Encryption

The Internet of Things(IoT)offers a new era of connectivity,which goes beyond laptops and smart connected devices for connected vehicles,smart homes,smart cities,and connected healthcare.The massive quantity of data gathered from numerous IoT devices poses security and privacy concerns for users.With the increasing use of multimedia in communications,the content security of remote-sensing images attracted much attention in academia and industry.Image encryption is important for securing remote sensing images in the IoT environment.Recently,researchers have introduced plenty of algorithms for encrypting images.This study introduces an Improved Sine Cosine Algorithm with Chaotic Encryption based Remote Sensing Image Encryption(ISCACE-RSI)technique in IoT Environment.The proposed model follows a three-stage process,namely pre-processing,encryption,and optimal key generation.The remote sensing images were preprocessed at the initial stage to enhance the image quality.Next,the ISCACERSI technique exploits the double-layer remote sensing image encryption(DLRSIE)algorithm for encrypting the images.The DLRSIE methodology incorporates the design of Chaotic Maps and deoxyribonucleic acid(DNA)Strand Displacement(DNASD)approach.The chaotic map is employed for generating pseudorandom sequences and implementing routine scrambling and diffusion processes on the plaintext images.Then,the study presents three DNASD-related encryption rules based on the variety of DNASD,and those rules are applied for encrypting the images at the DNA sequence level.For an optimal key generation of the DLRSIE technique,the ISCA is applied with an objective function of the maximization of peak signal to noise ratio(PSNR).To examine the performance of the ISCACE-RSI model,a detailed set of simulations were conducted.The comparative study reported the better performance of the ISCACE-RSI model over other existing approaches.

Analysis and Application of Endogenous Wireless Security Principle for Key Generation

The open and broadcast nature of wireless channels leads to the inherent security problem of information leakage in wireless communication.We can utilize endogenous security functions to resolve this problem.The fundamental solution is channel-based mechanisms,like physical layer secret keys.Unfortunately,current investigations have not fully exploited the randomness of wireless channels,making secret key rates not high.Consequently,user data can be encrypted by reducing the data rate to match the secret key rate.Based on the analysis of the endogenous wireless security principle,we proposed that the channel-based endogenous secret key rate can nearly match the maximum data rate in the fast-fading environments.After that,we validated the proposition in an instantiation system with multiple phase shift keying(MPSK)inputs from the perspectives of both theoretical analysis and simulation experiments.The results indicate that it is possible to accomplish the onetime pad without decreasing the data rate via channelbased endogenous keys.Besides,we can realize highspeed endogenously secure transmission by introducing independent channels in the domains of frequency,space,or time.The conclusions derived provide a new idea for wireless security and promote the application of the endogenous security theory.

Fast key generation for Gentry-style homomorphic encryption

The key issue of original implementation for Gentry-style homomorphic encryption scheme is the so called slow key generation algorithm. Ogura proposed a key generation algorithm for Gentry-style somewhat homomorphic scheme that controlled the bound of the evaluation circuit depth by using the relation between the evaluation circuit depth and the eigenvalues of the primary matrix. However, their proposed key generation method seems to exclude practical application. In order to address this problem, a new key generation algorithm based on Gershgorin circle theorem was proposed. The authors choose the eigenvalues of the primary matrix from a desired interval instead of selecting the module. Compared with the Ogura＇s work, the proposed key generation algorithm enables one to create a more practical somewhat homomorphic encryption scheme. Furthermore, a more aggressive security analysis of the approximate shortest vector problem（SVP） against lattice attacks is given. Experiments indicate that the new key generation algorithm is roughly twice as efficient as the previous methods.

An Improved Ring Signature Scheme without Trusted Key Generation Center for Wireless Sensor Network

Security of wireless sensor network （WSN） is a considerable challenge, because of limitation in energy, communication bandwidth and storage. ID-based cryptosystem without checking and storing certificate is a suitable way used in WSN. But key escrow is an inherent disadvantage for traditional ID-based cryptosystem, i.e., the dishonest key generation center （KGC） can forge the signature of any node and on the other hand the node can deny the signature actually signed by him/herself. To solving this problem, we propose an ID-based ring signature scheme without trusted KGC. We also present the accurate secure proof to prove that our scheme is secure against existential forgery on adaptively chosen message and ID attacks assuming the complexity of computational Diffie-Hellman （CDH） problem. Compared with other ring signature schemes, we think proposed scheme is more efficient.

Batch Private Keys Generation for RSA in Security Communication Systems

RSA public key cryptosystem is extensively used in information security systems. However, key generation for RSA cryptosystem requires multiplicative inversion over finite field, which has higher computational complexity, compared with either multiplication in common sense or modular multiplication over finite field. In order to improve the performance of key generation, we propose a batch private keys generation method in this paper. The method derives efficiency from cutting down multiplicative inversions over finite field. Theoretical analysis shows that the speed of batch private keys generation for s users is faster than that of s times solo private key generation. It is suitable for applications in those systems with large amount of users.

Pattern-reconfigurable antenna-assisted secret key generation from multipath fading channels

Physical layer key generation(PKG)technology leverages reciprocal channel randomness to generate shared secret keys.However,multipath fading at the receiver may degrade the correlation between legitimate uplink and downlink channels,resulting in a low key generation rate(KGR).In this paper,we propose a PKG scheme based on the pattern-reconfigurable antenna(PRA)to boost the secret key capacity.First,we propose a reconfigurable intelligent surface(RIS)based PRA architecture with the capability of flexible and reconfigurable antenna patterns.Then,we present the PRA-based PKG protocol to improve the KGR via mitigation of the effects of multipath fading.Specifically,a novel algorithm for estimation of the multipath channel parameters is proposed based on atomic norm minimization.Thereafter,a novel optimization method for the matching reception of multipath signals is formulated based on the improved binary particle swarm optimization(BPSO)algorithm.Finally,simulation results show that the proposed scheme can resist multipath fading and achieve a high KGR compared to existing schemes.Moreover,our findings indicate that the increased degree of freedom of the antenna patterns can significantly increase the secret key capacity.

Physical layer secret key generation scheme used in 60 GHz band

The technology of 60 GHz radio is considered promising for providing fast connectivity and gigabit data rate. One of the main challenges to its secure indoor transmission is how to generate secret keys between communication devices. To investigate this issue, The authors develop an efficient mechanism of secret key generation exploiting multipath relative delay based on 60 GHz standard channel models. The comparison of key-mismatch probability between line-of-sight （LOS） and non-line-of-sight （NLOS） environments is considered. Verification of the proposed scheme is conducted. Simulation shows that the number of extracted multipath components proportionally did affect key generation rate and key-mismatch probability. It also indicates that communicating transceivers have a slightly lower key-mismatch probability in NLOS condition than in LOS condition. Moreover, in comparison to the existing approach of using received signal amplitude as a common random source, the mechanism can achieve better performance in key agreement.

A High Consistency Wireless Key Generation Scheme for Vehicular Communication Based on Wiener Filter Extrapolation

Secret key generation from wireless channel is an emerging technology for communication network security,which exploits the reciprocity and time variability of wireless channels to generate symmetrical keys between the communication parties.Compared to the existing asymmetric key distribution methods,secret key generation from wireless channel has low complexity and high security,making it especially suitable for distributed networks.In vehicular communications,the reciprocity of wireless channel is degraded due to the movement of vehicular.This paper proposes a high consistency wireless key generation scheme for vehicular communication,especially applied to LTE-V2X(LTE vehicle to everything)systems.A channel reciprocity enhancement method is designed based on Wiener filter extrapolation,which can efficiently reduce the mismatch between the channels at the receiver and significantly reduce key disagreement rate.A real experimental system based on vehicle and universal software radio peripheral(USRP)platform is setup to verify the secret key generation in LTE-V2X systems.The effectiveness of the proposed method is verified in simulations and extensive practical tests.

Improved Channel Reciprocity for Secure Communication in Next Generation Wireless Systems

To secure the wireless connection between devices with low computational power has been a challenging problem due to heterogeneity in operating devices,device to device communication in Internet of Things(IoTs)and 5G wireless systems.Physical layer key generation(PLKG)tackles this secrecy problem by introducing private keys among two connecting devices through wireless medium.In this paper,relative calibration is used as a method to enhance channel reciprocity which in turn increases the performance of the key generation process.Channel reciprocity based key generation is emerged as better PLKG methodology to obtain secure wireless connection in IoTs and 5G systems.Circulant deconvolution is proposed as a promising technique for relative calibration to ensure channel reciprocity in comparison to existing techniques Total Least Square(TLS)and Structured Total Least Square(STLS).The proposed deconvolution technique replicates the performance of the STLS by exploiting the possibility of higher information reuse and its lesser computational complexity leads to less processing time in comparison to the STLS.The presented idea is validated by observing the relation between signalto-noise ratio(SNR)and the correlation coefficient of the corresponding channel measurements between communicating parties.

Decision Tree Based Key Management for Secure Group Communication

Group communication is widely used by most of the emerging network applications like telecommunication,video conferencing,simulation applications,distributed and other interactive systems.Secured group communication plays a vital role in case of providing the integrity,authenticity,confidentiality,and availability of the message delivered among the group members with respect to communicate securely between the inter group or else within the group.In secure group communications,the time cost associated with the key updating in the proceedings of the member join and departure is an important aspect of the quality of service,particularly in the large groups with highly active membership.Hence,the paper is aimed to achieve better cost and time efficiency through an improved DC multicast routing protocol which is used to expose the path between the nodes participating in the group communication.During this process,each node constructs an adaptive Ptolemy decision tree for the purpose of generating the contributory key.Each of the node is comprised of three keys which will be exchanged between the nodes for considering the group key for the purpose of secure and cost-efficient group communication.The rekeying process is performed when a member leaves or adds into the group.The performance metrics of novel approach is measured depending on the important factors such as computational and communicational cost,rekeying process and formation of the group.It is concluded from the study that the technique has reduced the computational and communicational cost of the secure group communication when compared to the other existing methods.

A Key Management Scheme Using(p,q)-Lucas Polynomials in Wireless Sensor Network

Wireless Sensor Network(WSN)has witnessed an unpredictable growth for the last few decades.It has many applications in various critical sectors such as real-time monitoring of nuclear power plant,disaster management,environment,military area etc.However,due to the distributed and remote deployment of sensor nodes in such networks,they are highly vulnerable to different security threats.The sensor network always needs a proficient key management scheme to secure data because of resourceconstrained nodes.Existing polynomial based key management schemes are simple,but the computational complexity is a big issue.Lucas polynomials,Fibonacci polynomials,Chebychev polynomials are used in Engineering,Physics,Combinatory and Numerical analysis etc.In this paper,we propose a key management scheme using(p,q)-Lucas polynomial to improve the security of WSN.In(p,q)-Lucas polynomial,p represents a random base number while q represents a substitute value of x in the polynomial.The value of p is unique,and q is different according to communication between nodes.Analysis of the proposed method on several parameters such as computational overhead,efficiency and storage cost have been performed and compared with existing related schemes.The analysis demonstrates that the proposed(p,q)-Lucas polynomial based key management scheme outperforms over other polynomials in terms of the number of keys used and efficiency.