Chaotic Map-Based Authentication and Key Agreement Protocol with Low-Latency for Metasystem

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.

Intrusion Detection Model Using Chaotic MAP for Network Coding Enabled Mobile Small Cells

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.

VLSI Implementation of Optimized 2D SIMM Chaotic Map for Image Encryption

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.

Securing 3D Point and Mesh Fog Data Using Novel Chaotic Cat Map

With the rapid evolution of Internet technology,fog computing has taken a major role in managing large amounts of data.The major concerns in this domain are security and privacy.Therefore,attaining a reliable level of confidentiality in the fog computing environment is a pivotal task.Among different types of data stored in the fog,the 3D point and mesh fog data are increasingly popular in recent days,due to the growth of 3D modelling and 3D printing technologies.Hence,in this research,we propose a novel scheme for preserving the privacy of 3D point and mesh fog data.Chaotic Cat mapbased data encryption is a recently trending research area due to its unique properties like pseudo-randomness,deterministic nature,sensitivity to initial conditions,ergodicity,etc.To boost encryption efficiency significantly,in this work,we propose a novel Chaotic Cat map.The sequence generated by this map is used to transform the coordinates of the fog data.The improved range of the proposed map is depicted using bifurcation analysis.The quality of the proposed Chaotic Cat map is also analyzed using metrics like Lyapunov exponent and approximate entropy.We also demonstrate the performance of the proposed encryption framework using attacks like brute-force attack and statistical attack.The experimental results clearly depict that the proposed framework produces the best results compared to the previous works in the literature.

Asymmetric image encryption algorithm based on a new three-dimensional improved logistic chaotic map

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.

An Efficient Three-Party Authenticated Key Exchange Procedure Using Chebyshev Chaotic Maps with Client Anonymity

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.

Dynamic S-Box Generation Using Novel Chaotic Map with Nonlinearity Tweaking

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.

Multi-objective optimization design of anti-roll torsion bar using improved beluga whale optimization algorithm

Purpose – This study aims to reduce the redundant weight of the anti-roll torsion bar brought by thetraditional empirical design and improving its strength and stiffness.Design/methodology/approach – Based on the finite element approach coupled with the improved belugawhale optimization (IBWO) algorithm, a collaborative optimization method is suggested to optimize the designof the anti-roll torsion bar structure and weight. The dimensions and material properties of the torsion bar weredefined as random variables, and the torsion bar’s mass and strength were investigated using finite elements.Then, chaotic mapping and differential evolution (DE) operators are introduced to improve the beluga whaleoptimization (BWO) algorithm and run case studies.Findings – The findings demonstrate that the IBWO has superior solution set distribution uniformity,convergence speed, solution correctness and stability than the BWO. The IBWO algorithm is used to optimizethe anti-roll torsion bar design. The error between the optimization and finite element simulation results wasless than 1%. The weight of the optimized anti-roll torsion bar was lessened by 4%, the maximum stress wasreduced by 35% and the stiffness was increased by 1.9%.Originality/value – The study provides a methodological reference for the simulation optimization process ofthe lateral anti-roll torsion bar.

Prediction Model of Wax Deposition Rate in Waxy Crude Oil Pipelines by Elman Neural Network Based on Improved Reptile Search Algorithm

A hard problem that hinders the movement of waxy crude oil is wax deposition in oil pipelines.To ensure the safe operation of crude oil pipelines,an accurate model must be developed to predict the rate of wax deposition in crude oil pipelines.Aiming at the shortcomings of the ENN prediction model,which easily falls into the local minimum value and weak generalization ability in the implementation process,an optimized ENN prediction model based on the IRSA is proposed.The validity of the new model was confirmed by the accurate prediction of two sets of experimental data on wax deposition in crude oil pipelines.The two groups of crude oil wax deposition rate case prediction results showed that the average absolute percentage errors of IRSA-ENN prediction models is 0.5476% and 0.7831%,respectively.Additionally,it shows a higher prediction accuracy compared to the ENN prediction model.In fact,the new model established by using the IRSA to optimize ENN can optimize the initial weights and thresholds in the prediction process,which can overcome the shortcomings of the ENN prediction model,such as weak generalization ability and tendency to fall into the local minimum value,so that it has the advantages of strong implementation and high prediction accuracy.

Prediction on Failure Pressure of Pipeline Containing Corrosion Defects Based on ISSA-BPNNModel

Oil and gas pipelines are affected by many factors,such as pipe wall thinning and pipeline rupture.Accurate prediction of failure pressure of oil and gas pipelines can provide technical support for pipeline safety management.Aiming at the shortcomings of the BP Neural Network(BPNN)model,such as low learning efficiency,sensitivity to initial weights,and easy falling into a local optimal state,an Improved Sparrow Search Algorithm(ISSA)is adopted to optimize the initial weights and thresholds of BPNN,and an ISSA-BPNN failure pressure prediction model for corroded pipelines is established.Taking 61 sets of pipelines blasting test data as an example,the prediction model was built and predicted by MATLAB software,and compared with the BPNN model,GA-BPNN model,and SSA-BPNN model.The results show that the MAPE of the ISSA-BPNN model is 3.4177%,and the R2 is 0.9880,both of which are superior to its comparison model.Using the ISSA-BPNN model has high prediction accuracy and stability,and can provide support for pipeline inspection and maintenance.

A Novel Robust Watermarking Algorithm for Encrypted Medical Image Based on DTCWT-DCT and Chaotic Map

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.

Applying and Comparison of Chaotic-Based Permutation Algorithms for Audio Encryption

This research presents,and claries the application of two permutation algorithms,based on chaotic map systems,and applied to a le of speech signals.They are the Arnold cat map-based permutation algorithm,and the Baker’s chaotic map-based permutation algorithm.Both algorithms are implemented on the same speech signal sample.Then,both the premier and the encrypted le histograms are documented and plotted.The speech signal amplitude values with time signals of the original le are recorded and plotted against the encrypted and decrypted les.Furthermore,the original le is plotted against the encrypted le,using the spectrogram frequencies of speech signals with the signal duration.These permutation algorithms are used to shufe the positions of the speech les signals’values without any changes,to produce an encrypted speech le.A comparative analysis is introduced by using some of sundry statistical and experimental analyses for the procedures of encryption and decryption,e.g.,the time of both procedures,the encrypted audio signals histogram,the correlation coefcient between specimens in the premier and encrypted signals,a test of the Spectral Distortion(SD),and the Log-Likelihood Ratio(LLR)measures.The outcomes of the different experimental and comparative studies demonstrate that the two permutation algorithms(Baker and Arnold)are sufcient for providing an efcient and reliable voice signal encryption solution.However,the Arnold’s algorithm gives better results in most cases as compared to the results of Baker’s algorithm.

A Color Image Encryption Algorithm Based on 2D-CIMM Chaotic Map

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.

Double Encryption Using Trigonometric Chaotic Map and XOR of an Image

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).

SBOOSP for Massive Devices in 5G WSNs Using Conformable Chaotic Maps

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.

Robust Watermarking Algorithm for Medical Images Based on Non-Subsampled Shearlet Transform and Schur Decomposition

With the development of digitalization in healthcare,more and more information is delivered and stored in digital form,facilitating people’s lives significantly.In the meanwhile,privacy leakage and security issues come along with it.Zero watermarking can solve this problem well.To protect the security of medical information and improve the algorithm’s robustness,this paper proposes a robust watermarking algorithm for medical images based on Non-Subsampled Shearlet Transform(NSST)and Schur decomposition.Firstly,the low-frequency subband image of the original medical image is obtained by NSST and chunked.Secondly,the Schur decomposition of low-frequency blocks to get stable values,extracting the maximum absolute value of the diagonal elements of the upper triangle matrix after the Schur decom-position of each low-frequency block and constructing the transition matrix from it.Then,the mean of the matrix is compared to each element’s value,creating a feature matrix by combining perceptual hashing,and selecting 32 bits as the feature sequence.Finally,the feature vector is exclusive OR(XOR)operated with the encrypted watermark information to get the zero watermark and complete registration with a third-party copyright certification center.Experimental data show that the Normalized Correlation(NC)values of watermarks extracted in random carrier medical images are above 0.5,with higher robustness than traditional algorithms,especially against geometric attacks and achieve watermark information invisibility without altering the carrier medical image.

An Improved Honey Badger Algorithm through Fusing Multi-Strategies

TheHoney Badger Algorithm(HBA)is a novelmeta-heuristic algorithm proposed recently inspired by the foraging behavior of honey badgers.The dynamic search behavior of honey badgers with sniffing and wandering is divided into exploration and exploitation in HBA,which has been applied in photovoltaic systems and optimization problems effectively.However,HBA tends to suffer from the local optimum and low convergence.To alleviate these challenges,an improved HBA(IHBA)through fusing multi-strategies is presented in the paper.It introduces Tent chaotic mapping and composite mutation factors to HBA,meanwhile,the random control parameter is improved,moreover,a diversified updating strategy of position is put forward to enhance the advantage between exploration and exploitation.IHBA is compared with 7 meta-heuristic algorithms in 10 benchmark functions and 5 engineering problems.The Wilcoxon Rank-sum Test,Friedman Test and Mann-WhitneyU Test are conducted after emulation.The results indicate the competitiveness and merits of the IHBA,which has better solution quality and convergence traits.The source code is currently available from:https://github.com/zhaotao789/IHBA.

Efficient Hardware Design of a Secure Cancellable Biometric Cryptosystem

Biometric security is a growing trend,as it supports the authentication of persons using confidential biometric data.Most of the transmitted data in multi-media systems are susceptible to attacks,which affect the security of these sys-tems.Biometric systems provide sufficient protection and privacy for users.The recently-introduced cancellable biometric recognition systems have not been investigated in the presence of different types of attacks.In addition,they have not been studied on different and large biometric datasets.Another point that deserves consideration is the hardware implementation of cancellable biometric recognition systems.This paper presents a suggested hybrid cancellable biometric recognition system based on a 3D chaotic cryptosystem.The rationale behind the utilization of the 3D chaotic cryptosystem is to guarantee strong encryption of biometric templates,and hence enhance the security and privacy of users.The suggested cryptosystem adds significant permutation and diffusion to the encrypted biometric templates.We introduce some sort of attack analysis in this paper to prove the robustness of the proposed cryptosystem against attacks.In addition,a Field Programmable Gate Array(FPGA)implementation of the pro-posed system is introduced.The obtained results with the proposed cryptosystem are compared with those of the traditional encryption schemes,such as Double Random Phase Encoding(DRPE)to reveal superiority,and hence high recogni-tion performance of the proposed cancellable biometric recognition system.The obtained results prove that the proposed cryptosystem enhances the security and leads to better efficiency of the cancellable biometric recognition system in the presence of different types of attacks.

Securing Healthcare Data in IoMT Network Using Enhanced Chaos Based Substitution and Diffusion

Patient privacy and data protection have been crucial concerns in Ehealthcare systems for many years.In modern-day applications,patient data usually holds clinical imagery,records,and other medical details.Lately,the Internet of Medical Things(IoMT),equipped with cloud computing,has come out to be a beneficial paradigm in the healthcare field.However,the openness of networks and systems leads to security threats and illegal access.Therefore,reliable,fast,and robust security methods need to be developed to ensure the safe exchange of healthcare data generated from various image sensing and other IoMT-driven devices in the IoMT network.This paper presents an image protection scheme for healthcare applications to protect patients’medical image data exchanged in IoMT networks.The proposed security scheme depends on an enhanced 2D discrete chaotic map and allows dynamic substitution based on an optimized highly-nonlinear S-box and diffusion to gain an excellent security performance.The optimized S-box has an excellent nonlinearity score of 112.The new image protection scheme is efficient enough to exhibit correlation values less than 0.0022,entropy values higher than 7.999,and NPCR values around 99.6%.To reveal the efficacy of the scheme,several comparison studies are presented.These comparison studies reveal that the novel protection scheme is robust,efficient,and capable of securing healthcare imagery in IoMT systems.

Dual Image Cryptosystem Using Henon Map and Discrete Fourier Transform

This paper introduces an efficient image cryptography system.The pro-posed image cryptography system is based on employing the two-dimensional(2D)chaotic henon map(CHM)in the Discrete Fourier Transform(DFT).The proposed DFT-based CHM image cryptography has two procedures which are the encryption and decryption procedures.In the proposed DFT-based CHM image cryptography,the confusion is employed using the CHM while the diffu-sion is realized using the DFT.So,the proposed DFT-based CHM image crypto-graphy achieves both confusion and diffusion characteristics.The encryption procedure starts by applying the DFT on the image then the DFT transformed image is scrambled using the CHM and the inverse DFT is applied to get the final-ly encrypted image.The decryption procedure follows the inverse procedure of encryption.The proposed DFT-based CHM image cryptography system is exam-ined using a set of security tests like statistical tests,entropy tests,differential tests,and sensitivity tests.The obtained results confirm and ensure the superiority of the proposed DFT-based CHM image cryptography system.These outcomes encourage the employment of the proposed DFT-based CHM image cryptography system in real-time image and video applications.