With the rapid advancement in exploring perceptual interactions and digital twins,metaverse technology has emerged to transcend the constraints of space-time and reality,facilitating remote AI-based collaboration.In t...With the rapid advancement in exploring perceptual interactions and digital twins,metaverse technology has emerged to transcend the constraints of space-time and reality,facilitating remote AI-based collaboration.In this dynamic metasystem environment,frequent information exchanges necessitate robust security measures,with Authentication and Key Agreement(AKA)serving as the primary line of defense to ensure communication security.However,traditional AKA protocols fall short in meeting the low-latency requirements essential for synchronous interactions within the metaverse.To address this challenge and enable nearly latency-free interactions,a novel low-latency AKA protocol based on chaotic maps is proposed.This protocol not only ensures mutual authentication of entities within the metasystem but also generates secure session keys.The security of these session keys is rigorously validated through formal proofs,formal verification,and informal proofs.When confronted with the Dolev-Yao(DY)threat model,the session keys are formally demonstrated to be secure under the Real-or-Random(ROR)model.The proposed protocol is further validated through simulations conducted using VMware workstation compiled in HLPSL language and C language.The simulation results affirm the protocol’s effectiveness in resisting well-known attacks while achieving the desired low latency for optimal metaverse interactions.展开更多
Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions,vulnerabilities,and assaults.Complex security systems,such as Intrusion Detection Systems(IDS),a...Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions,vulnerabilities,and assaults.Complex security systems,such as Intrusion Detection Systems(IDS),are essential due to the limitations of simpler security measures,such as cryptography and firewalls.Due to their compact nature and low energy reserves,wireless networks present a significant challenge for security procedures.The features of small cells can cause threats to the network.Network Coding(NC)enabled small cells are vulnerable to various types of attacks.Avoiding attacks and performing secure“peer”to“peer”data transmission is a challenging task in small cells.Due to the low power and memory requirements of the proposed model,it is well suited to use with constrained small cells.An attacker cannot change the contents of data and generate a new Hashed Homomorphic Message Authentication Code(HHMAC)hash between transmissions since the HMAC function is generated using the shared secret.In this research,a chaotic sequence mapping based low overhead 1D Improved Logistic Map is used to secure“peer”to“peer”data transmission model using lightweight H-MAC(1D-LM-P2P-LHHMAC)is proposed with accurate intrusion detection.The proposed model is evaluated with the traditional models by considering various evaluation metrics like Vector Set Generation Accuracy Levels,Key Pair Generation Time Levels,Chaotic Map Accuracy Levels,Intrusion Detection Accuracy Levels,and the results represent that the proposed model performance in chaotic map accuracy level is 98%and intrusion detection is 98.2%.The proposed model is compared with the traditional models and the results represent that the proposed model secure data transmission levels are high.展开更多
A substitution box(S-Box)is a crucial component of contemporary cryptosystems that provide data protection in block ciphers.At the moment,chaotic maps are being created and extensively used to generate these SBoxes as...A substitution box(S-Box)is a crucial component of contemporary cryptosystems that provide data protection in block ciphers.At the moment,chaotic maps are being created and extensively used to generate these SBoxes as a chaotic map assists in providing disorder and resistance to combat cryptanalytical attempts.In this paper,the construction of a dynamic S-Box using a cipher key is proposed using a novel chaotic map and an innovative tweaking approach.The projected chaotic map and the proposed tweak approach are presented for the first time and the use of parameters in their workingmakes both of these dynamic in nature.The tweak approach employs cubic polynomials while permuting the values of an initial S-Box to enhance its cryptographic fort.Values of the parameters are provided using the cipher key and a small variation in values of these parameters results in a completely different unique S-Box.Comparative analysis and exploration confirmed that the projected chaoticmap exhibits a significant amount of chaotic complexity.The security assessment in terms of bijectivity,nonlinearity,bits independence,strict avalanche,linear approximation probability,and differential probability criteria are utilized to critically investigate the effectiveness of the proposed S-Box against several assaults.The proposed S-Box’s cryptographic performance is comparable to those of recently projected S-Boxes for its adaption in real-world security applications.The comparative scrutiny pacifies the genuine potential of the proposed S-Box in terms of its applicability for data security.展开更多
Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly...Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly hundreds of billions of devices will be linked together.These smart devices will be able to gather data,process it,and even come to decisions on their own.Security is the most essential thing in these situations.In IoT infrastructure,authenticated key exchange systems are crucial for preserving client and data privacy and guaranteeing the security of data-in-transit(e.g.,via client identification and provision of secure communication).It is still challenging to create secure,authenticated key exchange techniques.The majority of the early authenticated key agreement procedure depended on computationally expensive and resource-intensive pairing,hashing,or modular exponentiation processes.The focus of this paper is to propose an efficient three-party authenticated key exchange procedure(AKEP)using Chebyshev chaotic maps with client anonymity that solves all the problems mentioned above.The proposed three-party AKEP is protected from several attacks.The proposed three-party AKEP can be used in practice for mobile communications and pervasive computing applications,according to statistical experiments and low processing costs.To protect client identification when transferring data over an insecure public network,our three-party AKEP may also offer client anonymity.Finally,the presented procedure offers better security features than the procedures currently available in the literature.展开更多
Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shami...Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman(RSA)is presented in this paper.In the first stage,a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence,Lyapunov exponent,and Shannon entropy.In the second stage,combined with the public key RSA algorithm,a new key acquisition mathematical model(MKA)is constructed to obtain the initial keys for the 3D-ILM.Consequently,the key stream can be produced depending on the plain image for a higher security.Moreover,a novel process model(NPM)for the input of the 3D-ILM is built,which is built to improve the distribution uniformity of the chaotic sequence.In the third stage,to encrypt the plain image,a pre-process by exclusive OR(XOR)operation with a random matrix is applied.Then,the pre-processed image is performed by a permutation for rows,a downward modulo function for adjacent pixels,a permutation for columns,a forward direction XOR addition-modulo diffusion,and a backward direction XOR addition-modulo diffusion to achieve the final cipher image.Moreover,experiments show that the the proposed algorithm has a better performance.Especially,the number of pixels change rate(NPCR)is close to ideal case 99.6094%,with the unified average changing intensity(UACI)close to 33.4634%,and the information entropy(IE)close to 8.展开更多
The current research work proposed a novel optimization-based 2D-SIMM(Two-Dimensional Sine Iterative chaotic map with infinite collapse Mod-ulation Map)model for image encryption.The proposed 2D-SIMM model is derived o...The current research work proposed a novel optimization-based 2D-SIMM(Two-Dimensional Sine Iterative chaotic map with infinite collapse Mod-ulation Map)model for image encryption.The proposed 2D-SIMM model is derived out of sine map and Iterative Chaotic Map with Infinite Collapse(ICMIC).In this technique,scrambling effect is achieved with the help of Chaotic Shift Transform(CST).Chaotic Shift Transform is used to change the value of pixels in the input image while the substituted value is cyclically shifted according to the chaotic sequence generated by 2D-SIMM model.These chaotic sequences,generated using 2D-SIMM model,are sensitive to initial conditions.In the proposed algorithm,these initial conditions are optimized using JAYA optimization algorithm.Correlation coefficient and entropy are considered asfitness functions in this study to evaluate the best solution for initial conditions.The simulation results clearly shows that the proposed algorithm achieved a better performance over existing algorithms.In addition,the VLSI implementation of the proposed algorithm was also carried out using Xilinx system generator.With optimization,the correlation coefficient was-0.014096 and without optimization,it was 0.002585.展开更多
This paper proposes a secure approach for encryption and decryption of digital images with chaotic map lattices. In the proposed encryption process, eight different types of operations are used to encrypt the pixels o...This paper proposes a secure approach for encryption and decryption of digital images with chaotic map lattices. In the proposed encryption process, eight different types of operations are used to encrypt the pixels of an image and one of them will be used for particular pixels decided by the outcome of the chaotic map lattices. To make the cipher more robust against any attacks, the secret key is modified after encrypting each block of sixteen pixels of the image. The experimental results and security analysis show that the proposed image encryption scheme achieves high security and efficiency.展开更多
In order to solve the problem of patient information security protection in medical images,whilst also taking into consideration the unchangeable particularity of medical images to the lesion area and the need for med...In order to solve the problem of patient information security protection in medical images,whilst also taking into consideration the unchangeable particularity of medical images to the lesion area and the need for medical images themselves to be protected,a novel robust watermarking algorithm for encrypted medical images based on dual-tree complex wavelet transform and discrete cosine transform(DTCWT-DCT)and chaotic map is proposed in this paper.First,DTCWT-DCT transformation was performed on medical images,and dot product was per-formed in relation to the transformation matrix and logistic map.Inverse transformation was undertaken to obtain encrypted medical images.Then,in the low-frequency part of the DTCWT-DCT transformation coefficient of the encrypted medical image,a set of 32 bits visual feature vectors that can effectively resist geometric attacks are found to be the feature vector of the encrypted medical image by using perceptual hashing.After that,different logistic initial values and growth parameters were set to encrypt the watermark,and zero-watermark technology was used to embed and extract the encrypted medical images by combining cryptography and third-party concepts.The proposed watermarking algorithm does not change the region of interest of medical images thus it does not affect the judgment of doctors.Additionally,the security of the algorithm is enhanced by using chaotic mapping,which is sensitive to the initial value in order to encrypt the medical image and the watermark.The simulation results show that the pro-posed algorithm has good homomorphism,which can not only protect the original medical image and the watermark information,but can also embed and extract the watermark directly in the encrypted image,eliminating the potential risk of decrypting the embedded watermark and extracting watermark.Compared with the recent related research,the proposed algorithm solves the contradiction between robustness and invisibility of the watermarking algorithm for encrypted medical images,and it has good results against both conventional attacks and geometric attacks.Under geometric attacks in particular,the proposed algorithm performs much better than existing algorithms.展开更多
A digital image encryption scheme using chaotic map lattices has been proposed recently. In this paper, two fatal flaws of the cryptosystem are pointed out. According to these two drawbacks, cryptanalysts could recove...A digital image encryption scheme using chaotic map lattices has been proposed recently. In this paper, two fatal flaws of the cryptosystem are pointed out. According to these two drawbacks, cryptanalysts could recover the plaintext by applying the chosen plaintext attack. Therefore, the proposed cryptosystem is not secure enough to be used in the image transmission system. Experimental results show the feasibility of the attack. As a result, we make some improvements to the encryption scheme, which can completely resist our chosen plaintext attack.展开更多
In the most recent decades,a major number of image encryption plans have been proposed.The vast majority of these plans reached a highsecurity level;however,their moderate speeds because of their complicated processes...In the most recent decades,a major number of image encryption plans have been proposed.The vast majority of these plans reached a highsecurity level;however,their moderate speeds because of their complicated processes made them of no use in real-time applications.Inspired by this,we propose another efficient and rapid image encryption plan dependent on the Trigonometric chaotic guide.In contrast to the most of current plans,we utilize this basic map to create just a couple of arbitrary rows and columns.Moreover,to additionally speed up,we raise the processing unit from the pixel level to the row/column level.The security of the new plot is accomplished through a substitution permutation network,where we apply a circular shift of rows and columns to break the solid connection of neighboring pixels.At that point,we join the XOR operation with modulo function to cover the pixels values and forestall any leaking of data.High-security tests and simulation analyses are carried out to exhibit that the scheme is very secure and exceptionally quick for real-time image processing at 80 fps(frames per second).展开更多
This paper presents a new scheme to achieve generalized synchronization(GS) between different discrete-time chaotic(hyperchaotic) systems.The approach is based on a theorem,which assures that GS is achieved when a...This paper presents a new scheme to achieve generalized synchronization(GS) between different discrete-time chaotic(hyperchaotic) systems.The approach is based on a theorem,which assures that GS is achieved when a structural condition on the considered class of response systems is satisfied.The method presents some useful features:it enables exact GS to be achieved in finite time(i.e.,dead-beat synchronization);it is rigorous,systematic,and straightforward in checking GS;it can be applied to a wide class of chaotic maps.Some examples of GS,including the Grassi-Miller map and a recently introduced minimal 2-D quadratic map,are illustrated.展开更多
We propose a new fractional two-dimensional triangle function combination discrete chaotic map (2D-TFCDM) with the discrete fractional difference. Moreover, the chaos behaviors of the proposed map are observed and t...We propose a new fractional two-dimensional triangle function combination discrete chaotic map (2D-TFCDM) with the discrete fractional difference. Moreover, the chaos behaviors of the proposed map are observed and the bifurcation diagrams, the largest Lyapunov exponent plot, and the phase portraits are derived, respectively. Finally, with the secret keys generated by Menezes-Vanstone elliptic curve cryptosystem, we apply the discrete fractional map into color image encryption. After that, the image encryption algorithm is analyzed in four aspects and the result indicates that the proposed algorithm is more superior than the other algorithms.展开更多
A new synchronization scheme for chaotic(hyperchaotic) maps with different dimensions is presented.Specifically,given a drive system map with dimension n and a response system with dimension m,the proposed approach ...A new synchronization scheme for chaotic(hyperchaotic) maps with different dimensions is presented.Specifically,given a drive system map with dimension n and a response system with dimension m,the proposed approach enables each drive system state to be synchronized with a linear response combination of the response system states.The method,based on the Lyapunov stability theory and the pole placement technique,presents some useful features:(i) it enables synchronization to be achieved for both cases of n 〈 m and n 〉 m;(ii) it is rigorous,being based on theorems;(iii) it can be readily applied to any chaotic(hyperchaotic) maps defined to date.Finally,the capability of the approach is illustrated by synchronization examples between the two-dimensional H′enon map(as the drive system) and the three-dimensional hyperchaotic Wang map(as the response system),and the three-dimensional H′enon-like map(as the drive system) and the two-dimensional Lorenz discrete-time system(as the response system).展开更多
A well known chaotic mapping in symbol space is a shift mapping.However,other chaotic mappings in symbol space exist too.The basic change is to consider the process not only at a set of times which are equally spaced,...A well known chaotic mapping in symbol space is a shift mapping.However,other chaotic mappings in symbol space exist too.The basic change is to consider the process not only at a set of times which are equally spaced,say at unit time apart(a shift mapping),but at a set of times which are not equally spaced,say if the unit time can not be fixed.The increasing mapping as a generalization of the shift mapping and the k-switch mapping are introduced.The increasing and k-switch mappings are chaotic.展开更多
In three-party password authenticated key exchange (AKE) protocol, since two users use their passwords to establish a secure session key over an insecure communication channel with the help of the trusted server, su...In three-party password authenticated key exchange (AKE) protocol, since two users use their passwords to establish a secure session key over an insecure communication channel with the help of the trusted server, such a protocol may suffer the password guessing attacks and the server has to maintain the password table. To eliminate the shortages of password- based AKE protocol, very recently, according to chaotic maps, Lee et al. [2015 Nonlinear Dyn. 79 2485] proposed a first three-party-authenticated key exchange scheme without using passwords, and claimed its security by providing a well- organized BAN logic test. Unfortunately, their protocol cannot resist impersonation attack, which is demonstrated in the present paper. To overcome their security weakness, by using chaotic maps, we propose a biometrics-based anonymous three-party AKE protocol with the same advantages. Further, we use the pi calculus-based formal verification tool ProVerif to show that our AKE protocol achieves authentication, security and anonymity, and an acceptable efficiency.展开更多
Three-party password-based key agreement protocols allow two users to authenticate each other via a public channel and establish a session key with the aid of a trusted server. Recently, Farash et al. [Farash M S, Att...Three-party password-based key agreement protocols allow two users to authenticate each other via a public channel and establish a session key with the aid of a trusted server. Recently, Farash et al. [Farash M S, Attari M A 2014 "An efficient and provably secure three-party password-based authenticated key exchange protocol based on Chebyshev chaotic maps", Nonlinear Dynamics 77(7): 399-411] proposed a three-party key agreement protocol by using the extended chaotic maps. They claimed that their protocol could achieve strong security. In the present paper, we analyze Farash et al.'s protocol and point out that this protocol is vulnerable to off-line password guessing attack and suffers communication burden. To handle the issue, we propose an efficient three-party password-based key agreement protocol using extended chaotic maps, which uses neither symmetric cryptosystems nor the server's public key. Compared with the relevant schemes, our protocol provides better performance in terms of computation and communication. Therefore, it is suitable for practical applications.展开更多
To ensure the safe transmission of image information in communication, and improve the security performance of image encryption algorithm, we proposed a color image encryption algorithm with higher security based on c...To ensure the safe transmission of image information in communication, and improve the security performance of image encryption algorithm, we proposed a color image encryption algorithm with higher security based on chaotic system. Firstly, the 2-dimensional Cubic ICMIC modulation map(2D-CIMM) is designed, which has simple form, easy to construct, and high Spectral Entropy(SE) complexity. Secondly, the hash values of the original image are used to update the initial values of the 2D-CIMM map in real time, which increases the sensitivity of the image encryption algorithm to the plaintext and improves the finite precision effect. Finally, the permutation and diffusion processes of the encryption algorithm based on bit-level are performed. In addition, simulation and performance analysis show that the proposed algorithm has higher security.展开更多
The commercialization of the fifth-generation(5G)wireless network has begun.Massive devices are being integrated into 5G-enabled wireless sensor networks(5GWSNs)to deliver a variety of valuable services to network use...The commercialization of the fifth-generation(5G)wireless network has begun.Massive devices are being integrated into 5G-enabled wireless sensor networks(5GWSNs)to deliver a variety of valuable services to network users.However,there are rising fears that 5GWSNs will expose sensitive user data to new security vulnerabilities.For secure end-to-end communication,key agreement and user authentication have been proposed.However,when billions of massive devices are networked to collect and analyze complex user data,more stringent security approaches are required.Data integrity,nonrepudiation,and authentication necessitate special-purpose subtree-based signature mechanisms that are pretty difficult to create in practice.To address this issue,this work provides an efficient,provably secure,lightweight subtreebased online/offline signature procedure(SBOOSP)and its aggregation(Agg-SBOOSP)for massive devices in 5G WSNs using conformable chaotic maps.The SBOOSP enables multi-time offline storage access while reducing processing time.As a result,the signer can utilize the pre-stored offline information in polynomial time.This feature distinguishes our presented SBOOSP from previous online/offline-signing procedures that only allow for one signature.Furthermore,the new procedure supports a secret key during the pre-registration process,but no secret key is necessary during the offline stage.The suggested SBOOSP is secure in the logic of unforgeability on the chosen message attack in the random oracle.Additionally,SBOOSP and Agg-SBOOSP had the lowest computing costs compared to other contending schemes.Overall,the suggested SBOOSP outperforms several preliminary security schemes in terms of performance and computational overhead.展开更多
Chaotic encryption is one of hot topics in cryptography, which has received increasing attention. Among many encryption methods, chaotic map is employed as an important source of pseudo-random numbers(PRNS). Although ...Chaotic encryption is one of hot topics in cryptography, which has received increasing attention. Among many encryption methods, chaotic map is employed as an important source of pseudo-random numbers(PRNS). Although the randomness and the butterfly effect of chaotic map make the generated sequence look very confused, its essence is still the deterministic behavior generated by a set of deterministic parameters. Therefore, the unceasing improved parameter estimation technology becomes one of potential threats for chaotic encryption, enhancing the attacking effect of the deciphering methods. In this paper, for better analyzing the cryptography, we focus on investigating the condition of chaotic maps to resist parameter estimation. An improved particle swarm optimization(IPSO) algorithm is introduced as the estimation method. Furthermore, a new piecewise principle is proposed for increasing estimation precision. Detailed experimental results demonstrate the effectiveness of the new estimation principle, and some new requirements are summarized for a secure chaotic encryption system.展开更多
This paper proposed a novel fragile watermarking scheme based on singular value decomposition (SVD) and 2D chaotic mapping. It obtains chaotic initial values from the image blocks singular value decomposition and the ...This paper proposed a novel fragile watermarking scheme based on singular value decomposition (SVD) and 2D chaotic mapping. It obtains chaotic initial values from the image blocks singular value decomposition and the user’s key, then uses the chaotic mapping to get the chaotic sequence and inserts the sequence into the LSBs of the image blocks to get the watermarked image blocks. The paper reconstructed the watermarked image from all the embedded blocks. The analysis and experimental results show that the scheme is pretty fragile to tampering, and it can localize the tampering position accurately, reach 3×3 blocks.展开更多
基金This work has received funding from National Natural Science Foundation of China(No.42275157).
文摘With the rapid advancement in exploring perceptual interactions and digital twins,metaverse technology has emerged to transcend the constraints of space-time and reality,facilitating remote AI-based collaboration.In this dynamic metasystem environment,frequent information exchanges necessitate robust security measures,with Authentication and Key Agreement(AKA)serving as the primary line of defense to ensure communication security.However,traditional AKA protocols fall short in meeting the low-latency requirements essential for synchronous interactions within the metaverse.To address this challenge and enable nearly latency-free interactions,a novel low-latency AKA protocol based on chaotic maps is proposed.This protocol not only ensures mutual authentication of entities within the metasystem but also generates secure session keys.The security of these session keys is rigorously validated through formal proofs,formal verification,and informal proofs.When confronted with the Dolev-Yao(DY)threat model,the session keys are formally demonstrated to be secure under the Real-or-Random(ROR)model.The proposed protocol is further validated through simulations conducted using VMware workstation compiled in HLPSL language and C language.The simulation results affirm the protocol’s effectiveness in resisting well-known attacks while achieving the desired low latency for optimal metaverse interactions.
文摘Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions,vulnerabilities,and assaults.Complex security systems,such as Intrusion Detection Systems(IDS),are essential due to the limitations of simpler security measures,such as cryptography and firewalls.Due to their compact nature and low energy reserves,wireless networks present a significant challenge for security procedures.The features of small cells can cause threats to the network.Network Coding(NC)enabled small cells are vulnerable to various types of attacks.Avoiding attacks and performing secure“peer”to“peer”data transmission is a challenging task in small cells.Due to the low power and memory requirements of the proposed model,it is well suited to use with constrained small cells.An attacker cannot change the contents of data and generate a new Hashed Homomorphic Message Authentication Code(HHMAC)hash between transmissions since the HMAC function is generated using the shared secret.In this research,a chaotic sequence mapping based low overhead 1D Improved Logistic Map is used to secure“peer”to“peer”data transmission model using lightweight H-MAC(1D-LM-P2P-LHHMAC)is proposed with accurate intrusion detection.The proposed model is evaluated with the traditional models by considering various evaluation metrics like Vector Set Generation Accuracy Levels,Key Pair Generation Time Levels,Chaotic Map Accuracy Levels,Intrusion Detection Accuracy Levels,and the results represent that the proposed model performance in chaotic map accuracy level is 98%and intrusion detection is 98.2%.The proposed model is compared with the traditional models and the results represent that the proposed model secure data transmission levels are high.
文摘A substitution box(S-Box)is a crucial component of contemporary cryptosystems that provide data protection in block ciphers.At the moment,chaotic maps are being created and extensively used to generate these SBoxes as a chaotic map assists in providing disorder and resistance to combat cryptanalytical attempts.In this paper,the construction of a dynamic S-Box using a cipher key is proposed using a novel chaotic map and an innovative tweaking approach.The projected chaotic map and the proposed tweak approach are presented for the first time and the use of parameters in their workingmakes both of these dynamic in nature.The tweak approach employs cubic polynomials while permuting the values of an initial S-Box to enhance its cryptographic fort.Values of the parameters are provided using the cipher key and a small variation in values of these parameters results in a completely different unique S-Box.Comparative analysis and exploration confirmed that the projected chaoticmap exhibits a significant amount of chaotic complexity.The security assessment in terms of bijectivity,nonlinearity,bits independence,strict avalanche,linear approximation probability,and differential probability criteria are utilized to critically investigate the effectiveness of the proposed S-Box against several assaults.The proposed S-Box’s cryptographic performance is comparable to those of recently projected S-Boxes for its adaption in real-world security applications.The comparative scrutiny pacifies the genuine potential of the proposed S-Box in terms of its applicability for data security.
文摘Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly hundreds of billions of devices will be linked together.These smart devices will be able to gather data,process it,and even come to decisions on their own.Security is the most essential thing in these situations.In IoT infrastructure,authenticated key exchange systems are crucial for preserving client and data privacy and guaranteeing the security of data-in-transit(e.g.,via client identification and provision of secure communication).It is still challenging to create secure,authenticated key exchange techniques.The majority of the early authenticated key agreement procedure depended on computationally expensive and resource-intensive pairing,hashing,or modular exponentiation processes.The focus of this paper is to propose an efficient three-party authenticated key exchange procedure(AKEP)using Chebyshev chaotic maps with client anonymity that solves all the problems mentioned above.The proposed three-party AKEP is protected from several attacks.The proposed three-party AKEP can be used in practice for mobile communications and pervasive computing applications,according to statistical experiments and low processing costs.To protect client identification when transferring data over an insecure public network,our three-party AKEP may also offer client anonymity.Finally,the presented procedure offers better security features than the procedures currently available in the literature.
基金the National Natural Science Foundation of China(Grant No.61972103)the Natural Science Foundation of Guangdong Province of China(Grant No.2023A1515011207)+3 种基金the Special Project in Key Area of General University in Guangdong Province of China(Grant No.2020ZDZX3064)the Characteristic Innovation Project of General University in Guangdong Province of China(Grant No.2022KTSCX051)the Postgraduate Education Innovation Project of Guangdong Ocean University of China(Grant No.202263)the Foundation of Guangdong Provincial Engineering and Technology Research Center of Far Sea Fisheries Management and Fishing of South China Sea.
文摘Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman(RSA)is presented in this paper.In the first stage,a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence,Lyapunov exponent,and Shannon entropy.In the second stage,combined with the public key RSA algorithm,a new key acquisition mathematical model(MKA)is constructed to obtain the initial keys for the 3D-ILM.Consequently,the key stream can be produced depending on the plain image for a higher security.Moreover,a novel process model(NPM)for the input of the 3D-ILM is built,which is built to improve the distribution uniformity of the chaotic sequence.In the third stage,to encrypt the plain image,a pre-process by exclusive OR(XOR)operation with a random matrix is applied.Then,the pre-processed image is performed by a permutation for rows,a downward modulo function for adjacent pixels,a permutation for columns,a forward direction XOR addition-modulo diffusion,and a backward direction XOR addition-modulo diffusion to achieve the final cipher image.Moreover,experiments show that the the proposed algorithm has a better performance.Especially,the number of pixels change rate(NPCR)is close to ideal case 99.6094%,with the unified average changing intensity(UACI)close to 33.4634%,and the information entropy(IE)close to 8.
文摘The current research work proposed a novel optimization-based 2D-SIMM(Two-Dimensional Sine Iterative chaotic map with infinite collapse Mod-ulation Map)model for image encryption.The proposed 2D-SIMM model is derived out of sine map and Iterative Chaotic Map with Infinite Collapse(ICMIC).In this technique,scrambling effect is achieved with the help of Chaotic Shift Transform(CST).Chaotic Shift Transform is used to change the value of pixels in the input image while the substituted value is cyclically shifted according to the chaotic sequence generated by 2D-SIMM model.These chaotic sequences,generated using 2D-SIMM model,are sensitive to initial conditions.In the proposed algorithm,these initial conditions are optimized using JAYA optimization algorithm.Correlation coefficient and entropy are considered asfitness functions in this study to evaluate the best solution for initial conditions.The simulation results clearly shows that the proposed algorithm achieved a better performance over existing algorithms.In addition,the VLSI implementation of the proposed algorithm was also carried out using Xilinx system generator.With optimization,the correlation coefficient was-0.014096 and without optimization,it was 0.002585.
基金supported by the National Natural Science Foundation of China (Grant Nos. 61001099 and 10971120)the Foundation for the Author of National Excellent Doctoral Dissertation of China (Grant No. 200444)
文摘This paper proposes a secure approach for encryption and decryption of digital images with chaotic map lattices. In the proposed encryption process, eight different types of operations are used to encrypt the pixels of an image and one of them will be used for particular pixels decided by the outcome of the chaotic map lattices. To make the cipher more robust against any attacks, the secret key is modified after encrypting each block of sixteen pixels of the image. The experimental results and security analysis show that the proposed image encryption scheme achieves high security and efficiency.
基金supported by the Key Research Project of Hainan Province[ZDYF2018129]the Higher Education Research Project of Hainan Province(Hnky2019-73)+3 种基金the National Natural Science Foundation of China[61762033]the Natural Science Foundation of Hainan[617175]the Special Scientific Research Project of Philosophy and Social Sciences of Chongqing Medical University[201703]the Key Research Project of Haikou College of Economics[HJKZ18-01].
文摘In order to solve the problem of patient information security protection in medical images,whilst also taking into consideration the unchangeable particularity of medical images to the lesion area and the need for medical images themselves to be protected,a novel robust watermarking algorithm for encrypted medical images based on dual-tree complex wavelet transform and discrete cosine transform(DTCWT-DCT)and chaotic map is proposed in this paper.First,DTCWT-DCT transformation was performed on medical images,and dot product was per-formed in relation to the transformation matrix and logistic map.Inverse transformation was undertaken to obtain encrypted medical images.Then,in the low-frequency part of the DTCWT-DCT transformation coefficient of the encrypted medical image,a set of 32 bits visual feature vectors that can effectively resist geometric attacks are found to be the feature vector of the encrypted medical image by using perceptual hashing.After that,different logistic initial values and growth parameters were set to encrypt the watermark,and zero-watermark technology was used to embed and extract the encrypted medical images by combining cryptography and third-party concepts.The proposed watermarking algorithm does not change the region of interest of medical images thus it does not affect the judgment of doctors.Additionally,the security of the algorithm is enhanced by using chaotic mapping,which is sensitive to the initial value in order to encrypt the medical image and the watermark.The simulation results show that the pro-posed algorithm has good homomorphism,which can not only protect the original medical image and the watermark information,but can also embed and extract the watermark directly in the encrypted image,eliminating the potential risk of decrypting the embedded watermark and extracting watermark.Compared with the recent related research,the proposed algorithm solves the contradiction between robustness and invisibility of the watermarking algorithm for encrypted medical images,and it has good results against both conventional attacks and geometric attacks.Under geometric attacks in particular,the proposed algorithm performs much better than existing algorithms.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 61173183, 60973152, and 60573172)the Doctoral Program Foundation of Institution of Higher Education of China (Grant No. 20070141014)+2 种基金the Program for Excellent Talents in Universities of Liaoning Province, China (Grant No. LR2012003)the Natural Science Foundation of Liaoning Province, China (Grant No. 20082165)the Fundamental Research Funds for the Central Universities of China (Grant No. DUT12JB06)
文摘A digital image encryption scheme using chaotic map lattices has been proposed recently. In this paper, two fatal flaws of the cryptosystem are pointed out. According to these two drawbacks, cryptanalysts could recover the plaintext by applying the chosen plaintext attack. Therefore, the proposed cryptosystem is not secure enough to be used in the image transmission system. Experimental results show the feasibility of the attack. As a result, we make some improvements to the encryption scheme, which can completely resist our chosen plaintext attack.
基金This research work was partially funded by the Chiang Mai University.
文摘In the most recent decades,a major number of image encryption plans have been proposed.The vast majority of these plans reached a highsecurity level;however,their moderate speeds because of their complicated processes made them of no use in real-time applications.Inspired by this,we propose another efficient and rapid image encryption plan dependent on the Trigonometric chaotic guide.In contrast to the most of current plans,we utilize this basic map to create just a couple of arbitrary rows and columns.Moreover,to additionally speed up,we raise the processing unit from the pixel level to the row/column level.The security of the new plot is accomplished through a substitution permutation network,where we apply a circular shift of rows and columns to break the solid connection of neighboring pixels.At that point,we join the XOR operation with modulo function to cover the pixels values and forestall any leaking of data.High-security tests and simulation analyses are carried out to exhibit that the scheme is very secure and exceptionally quick for real-time image processing at 80 fps(frames per second).
文摘This paper presents a new scheme to achieve generalized synchronization(GS) between different discrete-time chaotic(hyperchaotic) systems.The approach is based on a theorem,which assures that GS is achieved when a structural condition on the considered class of response systems is satisfied.The method presents some useful features:it enables exact GS to be achieved in finite time(i.e.,dead-beat synchronization);it is rigorous,systematic,and straightforward in checking GS;it can be applied to a wide class of chaotic maps.Some examples of GS,including the Grassi-Miller map and a recently introduced minimal 2-D quadratic map,are illustrated.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61072147 and 11271008)
文摘We propose a new fractional two-dimensional triangle function combination discrete chaotic map (2D-TFCDM) with the discrete fractional difference. Moreover, the chaos behaviors of the proposed map are observed and the bifurcation diagrams, the largest Lyapunov exponent plot, and the phase portraits are derived, respectively. Finally, with the secret keys generated by Menezes-Vanstone elliptic curve cryptosystem, we apply the discrete fractional map into color image encryption. After that, the image encryption algorithm is analyzed in four aspects and the result indicates that the proposed algorithm is more superior than the other algorithms.
文摘A new synchronization scheme for chaotic(hyperchaotic) maps with different dimensions is presented.Specifically,given a drive system map with dimension n and a response system with dimension m,the proposed approach enables each drive system state to be synchronized with a linear response combination of the response system states.The method,based on the Lyapunov stability theory and the pole placement technique,presents some useful features:(i) it enables synchronization to be achieved for both cases of n 〈 m and n 〉 m;(ii) it is rigorous,being based on theorems;(iii) it can be readily applied to any chaotic(hyperchaotic) maps defined to date.Finally,the capability of the approach is illustrated by synchronization examples between the two-dimensional H′enon map(as the drive system) and the three-dimensional hyperchaotic Wang map(as the response system),and the three-dimensional H′enon-like map(as the drive system) and the two-dimensional Lorenz discrete-time system(as the response system).
基金supported by Latvian Scientific(09.1220)ESF Project(2009/0223/1DP/1.1.1.2.0/09APIA/VIAA/008)
文摘A well known chaotic mapping in symbol space is a shift mapping.However,other chaotic mappings in symbol space exist too.The basic change is to consider the process not only at a set of times which are equally spaced,say at unit time apart(a shift mapping),but at a set of times which are not equally spaced,say if the unit time can not be fixed.The increasing mapping as a generalization of the shift mapping and the k-switch mapping are introduced.The increasing and k-switch mappings are chaotic.
基金supported by the Natural Science Foundation of Zhejiang Province,China(Grant No.LZ12F02005)the Major State Basic Research Development Program of China(Grant No.2013CB834205)the National Natural Science Foundation of China(Grant No.61070153)
文摘In three-party password authenticated key exchange (AKE) protocol, since two users use their passwords to establish a secure session key over an insecure communication channel with the help of the trusted server, such a protocol may suffer the password guessing attacks and the server has to maintain the password table. To eliminate the shortages of password- based AKE protocol, very recently, according to chaotic maps, Lee et al. [2015 Nonlinear Dyn. 79 2485] proposed a first three-party-authenticated key exchange scheme without using passwords, and claimed its security by providing a well- organized BAN logic test. Unfortunately, their protocol cannot resist impersonation attack, which is demonstrated in the present paper. To overcome their security weakness, by using chaotic maps, we propose a biometrics-based anonymous three-party AKE protocol with the same advantages. Further, we use the pi calculus-based formal verification tool ProVerif to show that our AKE protocol achieves authentication, security and anonymity, and an acceptable efficiency.
基金Project supported by the National Natural Science Foundation of China(Grant No.61462033)
文摘Three-party password-based key agreement protocols allow two users to authenticate each other via a public channel and establish a session key with the aid of a trusted server. Recently, Farash et al. [Farash M S, Attari M A 2014 "An efficient and provably secure three-party password-based authenticated key exchange protocol based on Chebyshev chaotic maps", Nonlinear Dynamics 77(7): 399-411] proposed a three-party key agreement protocol by using the extended chaotic maps. They claimed that their protocol could achieve strong security. In the present paper, we analyze Farash et al.'s protocol and point out that this protocol is vulnerable to off-line password guessing attack and suffers communication burden. To handle the issue, we propose an efficient three-party password-based key agreement protocol using extended chaotic maps, which uses neither symmetric cryptosystems nor the server's public key. Compared with the relevant schemes, our protocol provides better performance in terms of computation and communication. Therefore, it is suitable for practical applications.
基金the National Natural Science Foundation of China (Grant Nos. 61161006 and 61573383)
文摘To ensure the safe transmission of image information in communication, and improve the security performance of image encryption algorithm, we proposed a color image encryption algorithm with higher security based on chaotic system. Firstly, the 2-dimensional Cubic ICMIC modulation map(2D-CIMM) is designed, which has simple form, easy to construct, and high Spectral Entropy(SE) complexity. Secondly, the hash values of the original image are used to update the initial values of the 2D-CIMM map in real time, which increases the sensitivity of the image encryption algorithm to the plaintext and improves the finite precision effect. Finally, the permutation and diffusion processes of the encryption algorithm based on bit-level are performed. In addition, simulation and performance analysis show that the proposed algorithm has higher security.
基金We extend our gratitude to the Deanship of Scientific Research at King Khalid University for funding this work through the research groups programunder grant number R.G.P.1/72/42The work of Agbotiname Lucky Imoize is supported by the Nigerian Petroleum Technology Development Fund(PTDF)and the German Academic Exchange Service(DAAD)through the Nigerian-German Postgraduate Program under Grant 57473408.
文摘The commercialization of the fifth-generation(5G)wireless network has begun.Massive devices are being integrated into 5G-enabled wireless sensor networks(5GWSNs)to deliver a variety of valuable services to network users.However,there are rising fears that 5GWSNs will expose sensitive user data to new security vulnerabilities.For secure end-to-end communication,key agreement and user authentication have been proposed.However,when billions of massive devices are networked to collect and analyze complex user data,more stringent security approaches are required.Data integrity,nonrepudiation,and authentication necessitate special-purpose subtree-based signature mechanisms that are pretty difficult to create in practice.To address this issue,this work provides an efficient,provably secure,lightweight subtreebased online/offline signature procedure(SBOOSP)and its aggregation(Agg-SBOOSP)for massive devices in 5G WSNs using conformable chaotic maps.The SBOOSP enables multi-time offline storage access while reducing processing time.As a result,the signer can utilize the pre-stored offline information in polynomial time.This feature distinguishes our presented SBOOSP from previous online/offline-signing procedures that only allow for one signature.Furthermore,the new procedure supports a secret key during the pre-registration process,but no secret key is necessary during the offline stage.The suggested SBOOSP is secure in the logic of unforgeability on the chosen message attack in the random oracle.Additionally,SBOOSP and Agg-SBOOSP had the lowest computing costs compared to other contending schemes.Overall,the suggested SBOOSP outperforms several preliminary security schemes in terms of performance and computational overhead.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61161006 and 61573383)the Key Innovation Project of Graduate of Central South University(Grant No.2018ZZTS009)the Postdoctoral Innovative Talents Support Program(Grant No.BX20180386)。
文摘Chaotic encryption is one of hot topics in cryptography, which has received increasing attention. Among many encryption methods, chaotic map is employed as an important source of pseudo-random numbers(PRNS). Although the randomness and the butterfly effect of chaotic map make the generated sequence look very confused, its essence is still the deterministic behavior generated by a set of deterministic parameters. Therefore, the unceasing improved parameter estimation technology becomes one of potential threats for chaotic encryption, enhancing the attacking effect of the deciphering methods. In this paper, for better analyzing the cryptography, we focus on investigating the condition of chaotic maps to resist parameter estimation. An improved particle swarm optimization(IPSO) algorithm is introduced as the estimation method. Furthermore, a new piecewise principle is proposed for increasing estimation precision. Detailed experimental results demonstrate the effectiveness of the new estimation principle, and some new requirements are summarized for a secure chaotic encryption system.
文摘This paper proposed a novel fragile watermarking scheme based on singular value decomposition (SVD) and 2D chaotic mapping. It obtains chaotic initial values from the image blocks singular value decomposition and the user’s key, then uses the chaotic mapping to get the chaotic sequence and inserts the sequence into the LSBs of the image blocks to get the watermarked image blocks. The paper reconstructed the watermarked image from all the embedded blocks. The analysis and experimental results show that the scheme is pretty fragile to tampering, and it can localize the tampering position accurately, reach 3×3 blocks.