Search

This research proposes a new image encryption method to improve the security of image encryption by integrating a multi-chaotic system and mixed pixel-bit level encryption. In the face of the growing use of communications and computer technology, as well as the need to protect sensitive information, this method utilizes chaotic algorithms to increase encryption security. Experimental results show increased security and resistance to various attacks, validating the method's effectiveness in protecting digital images. The measurement tools used include histograms, information entropy, adjacent pixel correlation coefficient, key sensitivity analysis, and robustness testing. In conclusion, this method offers an effective and robust approach to image encryption, providing an important contribution to the field of information security. [ABSTRACT FROM AUTHOR]

The Quantum Key Distribution (QKD) network approach has emerged as a promising solution and has garnered significant interest across various domains. QKD networks can be broadly categorized into two main types: those based on measurement-device-dependent (MDD) protocols and those based on measurement-device-independent (MDI) protocols. A novel network scheme is proposed combining these two protocols to guarantee end-to-end secure communication. It comprises two interconnected networks — the first uses a measurement-device-dependent protocol to connect routers with nearby nodes, while the second employs a measurement-device-independent protocol to interconnect the routers. In the first network, the process begins with Alice (Router) generating two types of weak quantum signals — the first has intensity, frequency and polarization or phase randomly varied, while the second with different delay times. Alice randomly transmits either signal states carrying information or decoy states with varying properties to the receivers (Bobs) over the quantum channels. She also sends a synchronization signal along with the quantum signals. At the receiver end, the synchronization pulse timestamps the incoming quantum signals. Each Bob then randomly shifts the frequencies of the received signals and measures their phase/polarization of the first signal and measures the delay times of the second signal. The secret key is derived by combining the frequency, the delay time and the phase/polarization information of the quantum signals, resulting in longer key lengths. Encoding information across multiple degrees of freedom enables extended key generation for secure communication. However, between the routers, MDI-QKD protocols are used to securely share the keys. This hybrid approach aims to ensure secure end-to-end communication across the network. [ABSTRACT FROM AUTHOR]

Dual‐polarization programmable metasurfaces can flexibly manipulate electromagnetic (EM) waves while providing approximately twice the information capacity. Therefore, they hold significant applications in next‐generation communication systems. However, there are three challenges associated with the existing dual‐polarization programmable metasurfaces. This article aims to propose a novel design to address them. First, the design overcomes the challenge of element‐ and polarization‐independent controls, enabling more powerful manipulations of EM waves. Second, by using more energy‐efficient tunable components and reducing their number, the design can be nearly passive (maximum power consumption of 27.7 mW), leading to a significant decrease in the cost and power consumption of the system (at least two orders of magnitude lower than the power consumption of conventional programmable metasurfaces). Third, the design can operate in a broad bandwidth, which is attractive for practical engineering applications. Both the element and array of the metasurface are meticulously designed, and their performance has been carefully studied. The experiments demonstrate that 2D wide‐angle beam scanning can be realized. Moreover, secure communication based on directional information modulation can be implemented by exploiting the metasurface and an efficient discrete optimization algorithm, showing its programmable, multiplexing, broadband, green, and secure features. [ABSTRACT FROM AUTHOR]

Introduction: As the main means of information exchange within vehicles, the safety of the controller area network bus directly affects the safe operation of the vehicle and the safety of passengers' lives and property. Methods: To enhance its secure communication function, this study utilizes advanced encryption standard algorithms and improves the S-box of the algorithm to solve problems such as extended processing time. A secure communication system for the local area network bus of the vehicle controller is designed based on optimized advanced encryption standard algorithms. Results and Discussion: The results showed that when the file size was 200MB, the encryption and decryption time spent by the research method was 469.8 s and 528.5 s, respectively, which are significantly lower than traditional methods. In the simulation results, under both non-encrypted and encrypted transmission, the information remained intact throughout the entire transmission process. This indicated that the optimization algorithm effectively reduced encryption processing time and system resource consumption while ensuring data confidentiality and integrity. The new system meets the security requirements of the local area network bus of vehicle-mounted controllers. Conclusion: This study not only enhances the security of in-vehicle networks but also promotes the application and development of related encryption technologies in the field of vehicle networking. It provides strong technical support for the further development of vehicle networking and the safe operation of intelligent vehicles. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) equipped with mobile edge computing (MEC) servers and featuring flexible deployment capabilities can help to reduce the computing pressure on ground user networks. However, the majority of ground users are hindered by their limited battery life, preventing them from working without interruption. To maximize the service lifetime of ground users, UAVs transmit energy to them first and then collect offload tasks afterwards. This approach allows users to work without interruption while transmitting UAVs with computing tasks which can then be processed with the help of MEC servers. This helps to reduce the pressure on ground user networks, ensuring that they remain reliable and efficient. Therefore, we propose an optimization problem that aims to maximize the minimum security offloading rate of the system. This problem involves multiple variables, so conventional methods are not suitable for solving it. Our proposed scheme utilizes block coordinate descent (BCD) and successive convex approximation (SCA) algorithms, which can better optimize the user offloading decision, energy transfer duration, and user transmit power. Numerical results demonstrate that our scheme is more effective than the two benchmark schemes in improving the system performance. [ABSTRACT FROM AUTHOR]

As the Internet of Things (IoT) continues to proliferate, the demand for efficient and secure data processing at the network edge has grown exponentially. Fog computing, a paradigm that extends cloud capabilities to the edge of the network, plays a pivotal role in meeting these requirements. In this context, the reliable and trustworthy forwarding of data is of paramount importance. This paper presents an innovative mechanism designed to ensure the trustworthiness of data forwarding in the context of MQTT (Message Queuing Telemetry Transport), a widely adopted IoT communication protocol. Our proposed mechanism leverages the inherent advantages of MQTT to establish a robust and secure data-forwarding scheme. It integrates fog computing resources seamlessly into the MQTT ecosystem, enhancing data reliability and security. The mechanism employs trust models to evaluate the credibility of IoT devices and fog nodes involved in data forwarding, enabling informed decisions at each stage of the transmission process. Key components of the mechanism include secure communication protocols, authentication mechanisms, and data integrity verification. The proposed secure communication protocols (TLS/SSL, MQTTS, and PKI) and data integrity verification methods (MAC, digital signatures, checksums, and CRC) provide a robust framework for ensuring secure and trustworthy data transmission in IoT systems. These elements collectively contribute to the establishment of a reliable data forwarding pipeline within MQTT. Additionally, the mechanism prioritizes low-latency communication and efficient resource utilization, aligning with the real-time requirements of IoT applications. Through empirical evaluations and simulations, the research demonstrates the effectiveness of our proposed mechanism in improving the trustworthiness of data forwarding, while minimizing overhead, as the experiment was conducted with 15 fog nodes, and the maximum Level of Trust (LoT) score was 0.968, which is very high, with an estimated accuracy of 97.63%. The results indicate that our approach significantly enhances data security and reliability in MQTT-based IoT environments, thereby facilitating the seamless integration of fog computing resources for edge processing. [ABSTRACT FROM AUTHOR]

Summary: The mobile satellite communication (MSC) system is a vital communication method in which mobile users and network control centers connect via satellites. Since the satellite's communication is wireless, communication security is a critical factor to ensure accountable communication. Key exchange and authentication (KEA) mechanism is widely used to achieve data security for data transmitted in an insecure or open channel. Different authentication systems are suggested in the last many years to establish safe communication, whereas most existing security protocols are based on factorization or discrete logarithm. However, these systems are no longer reliable by Shor's algorithm as any discrete logarithm and factorization can be resolved in polynomial time on quantum computers. Thus, developing a quantum secure KEA protocol for MSC systems is necessary. In this direction, recently a ring learning with an error‐based KEA technique is proposed to ensure a quantum‐safe environment. This scheme is quantum‐safe and satisfies desirable security attributes but has low efficiency in computation and communication. Moreover, establishing a secure session requires six communications among involved entities. As a result, replay attack detection at an early stage is not possible for the central authority (server), which could delay the server response, and the adversary gets the advantage of drawing a denial of service scenario for authorized entities. We propose a lattice‐based KEA protocol for the MSC system to improve computation, communication efficiency, and early‐stage replay attack detection. The security analysis of the proposed scheme is presented in the random oracle model. Calculation of performance is also presented to observe advantages in computation and communication overhead. [ABSTRACT FROM AUTHOR]

In this work, a process of mixing two different chaotic systems, Duffing and Chen, was carried out using a laser a signal carrier to create a novel system with properties that differ completely from properties of both systems. The spectra of Fourier transforms, as well as the strange attractor, appear this new behavior. Also, the possibility of the synchronization of two systems was studied, and it was found that it is possible to convert the chaotic Duffing system into a completely Chen system when using the coupling factor k = 10,000 a.u. The match rate between the two systems was 99%, and this is evident by calculating the error function. The main process of this research is increased bandwidth for Duffing system by the effect of the Chen chaotic system. [ABSTRACT FROM AUTHOR]

The working of a Mobile Ad hoc NETwork (MANET) relies on the supportive cooperation among the network nodes. But due to its intrinsic features, a misbehaving node can easily lead to a routing disorder. This paper presents two trust-based routing schemes, namely Trust-based Self-Detection Routing (TSDR) and Trust-based Co-operative Routing (TCOR) designed with an Ad hoc On-demand Distance Vector (AODV) protocol. The proposed work covers a wide range of security challenges, including malicious node identification and prevention, accurate trust quantification, secure trust data sharing, and trusted route maintenance. This brings a prominent solution for mitigating misbehaving nodes and establishing efficient communication in MANET. It is empirically validated based on a performance comparison with the current Evolutionary Self-Cooperative Trust (ESCT) scheme, Generalized Trust Model (GTM), and the conventional AODV protocol. The extensive simulations are conducted against three different varying network scenarios. The results affirm the improved values of eight popular performance metrics overcoming the existing routing schemes. Among the two proposed works, TCOR is more suitable for highly scalable networks; TSDR suits, however, the MANET application better with its small size. This work thus makes a significant contribution to the research community, in contrast to many previous works focusing solely on specific security aspects, and results in a trade-off in the expected values of evaluation parameters and asserts their efficiency.

To address the challenges of secure and reliable communication and system quality of service (QoS) prediction in intelligent production lines (IPL) in the Industrial Intelligent Internet of Things (II-IOT) environment, a redundant collaborative security model-based communication architecture is designed. First, the redundant collaborative security communication model is introduced to construct the network communication architecture of IPL, including the industrial-site mechanical floor, data awareness layer, and gateway and application layer. Then, to leverage the advantages of the empirical-mode decomposition (EMD) method and the bidirectional long short-term memory (BiLSTM) model in time-series data analysis and processing, an EMD-BiLSTM-based QoS prediction model is proposed that can synchronously achieve one-step and multi-step prediction of QoS attributes. The proposed model exhibits a prediction accuracy of up to 94.01% on the SourceForge dataset, with prediction, recall, and F1 values as high as 91.37, 90.60, and 90.99%, respectively. The proposed EMD-BiLSTM model can achieve better performance than the state-of-the-art QoS prediction models, indicating that the proposed model can be more effectively used to improve the reliable communication level of II-IoT.

The integration of Internet of Things (IoT) technology into agriculture has revolutionized farming practices by using connected devices and sensors to optimize processes and facilitate sustainable execution. Because most IoT devices have limited resources, the vital requirement to efficiently manage data traffic while ensuring data security in agricultural IoT solutions creates several challenges. Therefore, it is important to study the data amount that IoT protocols generate for resource-constrained devices, as it has a direct impact on the device performance and overall usability of the IoT solution. In this paper, we present a comprehensive study that focuses on optimizing data transmission in agricultural IoT solutions with the use of compression algorithms and secure technologies. Through experimentation and analysis, we evaluate different approaches to minimize data traffic while protecting sensitive agricultural data. Our results highlight the effectiveness of compression algorithms, especially Huffman coding, in reducing data size and optimizing resource usage. In addition, the integration of encryption techniques, such as AES, provides the security of the transmitted data without incurring significant overhead. By assessing different communication scenarios, we identify the most efficient approach, a combination of Huffman encoding and AES encryption, to strike a balance between data security and transmission efficiency. [ABSTRACT FROM AUTHOR]

In order to solve the huge impact of the digital information age on many technical and industrial fields, a periodic fast search genetic algorithm is proposed. Based on the reconnaissance mission, this paper introduces the common allocation strategy into mission planning, and constructs the mathematical model of multi unmanned aerial vehicle (UAV) cooperative reconnaissance mission planning decision‐making. The proposed periodic fast search genetic algorithm is used to solve the problem of multi UAV cooperative reconnaissance mission planning. In 2020, the industry growth rate of global UAV technology expenditure was as high as 30.6%, and the compound growth rate of UAV in China reached 63.5%, which is enough to see the great prospect of the integrated development of UAV technology and different industries. The experiment evaluates the log verification module of UAV by comparing the two data structures of Merkle tree and linear, and the time and memory overhead of storing and verifying logs, which shows the effectiveness of the log verification scheme in this paper. [ABSTRACT FROM AUTHOR]

The purpose of this research is to investigate the synchronization and control for uncertain memristor-based cellular neural network and its application in secure communication. To address the issue, a novel sliding mode function is designed, on which the system states can effectively converge to the equilibrium point after reaching the sliding mode surface. Moreover, the corresponding controller is constructed by employing the proposed sliding mode function. The proposed control strategy achieves the synchronization of the uncertain memristor-based cellular neural network, and effectively addresses the integral saturation existing in traditional one. In addition, the control performance, including convergence speed, control accuracy, robustness and security, are significantly enhanced. Furthermore, the stability of the system is discussed based on Lyapunov theory. Finally, comparative tests and application examples are presented to verify the effectiveness of the proposed scheme. [ABSTRACT FROM AUTHOR]

The quantum key distribution (QKD) method allows for the safe creation of encryption keys between trusted entities for secure communication. The suggested system is designed to enable secure communication between multiple parties (a single sender, Alice, and multiple receivers, Bobs) connected via a public channel susceptible to interception. It enables Alice to privately share encryption keys with each Bob over dedicated quantum channels, which can then be used to decrypt messages sent over the public network. The procedure involves Alice generating optical signals with randomly assigned properties such as intensity, phase, polarization, and frequencies. Alice randomly sends either signal states carrying information or decoy states with different frequencies to the receivers (Bobs) over the quantum channels. She also sends a synchronization signal for timing alignment with the quantum signals over the optical links. At the receiving end, the synchronization pulse timestamps the incoming quantum signals. Each Bob then randomly alters the frequencies of the received quantum signals and randomly measures their phase or polarization. The key is created from the frequency, phase, or polarization information of the quantum signals, resulting in longer keys. Key management agents manage the securely QKD-generated keys to encrypt information before sending it to the intended receivers. Essentially, this framework establishes authenticated, private communication by using QKD over dedicated ultra-secure quantum links to distribute decryption keys, ensuring that only intended users can access the content. The approach is designed to ensure end-to-end secure communication across the network. [ABSTRACT FROM AUTHOR]

For the security concerns of communication data and key in automotive ethernet, an automotive ethernet security communication method based on dynamic keys was innovatively designed. The attack tree model for automotive ethernet security threats was established to analyze the faced security threats. The comprehensive architecture for automotive ethernet security communication methods was constructed to address the threats, and the dynamic key algorithm model was designed to generate implicit dynamic keys. The secure communication method based on dynamic keys was designed to encrypt original data through dynamic keys, and the digests were generated and compared at the receiving end. Communication and network attack processes between domains were simulated using Linux-based systems, I. MX6ULL microcontrollers and Windows devices, and the difference degrees of keys, ciphertexts and plaintexts were compared. The communication process was attacked to analyze the data interactions by Wireshark software. The results show that the proposed method can effectively ensure the key security and the confidentiality, freshness, authenticity and integrity of automotive ethernet data, and it can effectively counter tampering attacks and replaying attacks. [ABSTRACT FROM AUTHOR]

This paper tries to study the problem of finite-time synchronization for delayed semi-Markov reaction–diffusion systems. Based on the spatial and parametric characteristics of the considered systems, a new asynchronous boundary control scheme is proposed to ensure the finite-time synchronization of the drive and response systems. In the asynchronous boundary control scheme, only an actuator should be placed at the spatial boundary, which is more easier to implement and economical than the other non-boundary control strategies. Besides, the system parameters and controller follow two asynchronous semi-Markov chains for jumping, which is more practical than obeying one semi-Markov chain. Moreover, for the considered systems, we proposes a new lemma of finite-time stability, and by employing the inequality methods and variable substitution, we derive the criterion of finite-time synchronization and a correlative corollary. Finally, a numerical example and an application example on secure communication are carried out to support the developed approach. • Our study enriches the related research of semi-Markov RDSs. The obtained results guarantee the finite-time synchronization of semi-Markov RDSs, which is more effective and practical than asymptotic synchronization. • This paper proposes a novel asynchronous boundary control scheme, for the synchronization of semi-Markov RDSs. Compared with existing ones, our control scheme has obvious advantages in realizability and economy. • Based on the existing papers, in the designed controller, a constant is introduced, such that the intense chatter of controller could be reduced. • For the considered systems and designed controller, a new finite-time stability lemma is proposed, which enables the derivation of a finite-time synchronization criterion and a related corollary of this paper. [ABSTRACT FROM AUTHOR]

Internet-of-things networks consist of multiple sensor devices spread over a wide area. In order to protect the data from unauthorized access and tampering, it is essential to ensure secure communication between the sensor devices and the central server. This security measure aims to guarantee authenticity, confidentiality, and data integrity. Unlike traditional computing systems, sensor node devices are often limited regarding memory and computing power. Lightweight communication protocols, such as LoRaWAN, were introduced to overcome these limitations. However, despite the lightweight feature, the protocol is vulnerable to different types of attacks. This proposal presents a highly secure key establishment protocol that combines two cryptography schemes: Elliptic Curve Qu–Vanstone and signcryption key encapsulation. The protocol provides a method to establish a secure channel that inherits the security properties of the two schemes. Also, it allows for fast rekeying with only one exchange message, significantly reducing the handshake complexity in low-bandwidth communication. In addition, the selected schemes complement each other and share the same mathematical operations in elliptic curve cryptography. Moreover, with the rise of a community-friendly platform like RISC-V, we implemented the protocol on a RISC-V system to evaluate its overheads regarding the cycle count and execution time. [ABSTRACT FROM AUTHOR]

Due to the progress of modern technologies in covert communication, in this work a new communication system is proposed using the chaotic system resulting from optoelectronic feedback of semiconductor laser. Where the sinusoidal signal (amplitude A and frequency f were 0.0 and 0.1 a.u, respectively) was used to examine the transmission efficiency of the signal and it was found that the purity of the received signal at the receiving unit depends on the amount of synchronization between the two systems, i.e., on the coupling factor between the transmitting and receiving systems. It was found that the ideal value of the coupling factor was 270 a.u at initial condition xi1, yi1, zi1, xi2, yi2, and zi2 are 1, 1, 0.005, 1, 1, and 0.05, respectively, as the two systems showed full synchronization between them. Through the results obtained, it was found that the chaotic system resulting from the optoelectronic feedback (OEFB) presents a modern technique for encoding the signal to send it with high confidentiality, and the reason is due to the wide bandwidth of the spectrum of the chaotic system, which allows easy selection of the appropriate frequency for encoding information, and in this way it was possible to open a new field in secret communications. In fact, the percentage matches between the transmitted signal and the received signal reach 99.99%. [ABSTRACT FROM AUTHOR]

Abstract Dual‐polarization programmable metasurfaces can flexibly manipulate electromagnetic (EM) waves while providing approximately twice the information capacity. Therefore, they hold significant applications in next‐generation communication systems. However, there are three challenges associated with the existing dual‐polarization programmable metasurfaces. This article aims to propose a novel design to address them. First, the design overcomes the challenge of element‐ and polarization‐independent controls, enabling more powerful manipulations of EM waves. Second, by using more energy‐efficient tunable components and reducing their number, the design can be nearly passive (maximum power consumption of 27.7 mW), leading to a significant decrease in the cost and power consumption of the system (at least two orders of magnitude lower than the power consumption of conventional programmable metasurfaces). Third, the design can operate in a broad bandwidth, which is attractive for practical engineering applications. Both the element and array of the metasurface are meticulously designed, and their performance has been carefully studied. The experiments demonstrate that 2D wide‐angle beam scanning can be realized. Moreover, secure communication based on directional information modulation can be implemented by exploiting the metasurface and an efficient discrete optimization algorithm, showing its programmable, multiplexing, broadband, green, and secure features.

Abstract A (t,m)‐threshold secret sharing and multisecret‐sharing scheme based on Shamir's secret sharing scheme are introduced with two‐level security using a one‐way function. Besides, its application in a smart contract‐enabled consortium blockchain network is discussed. The proposed scheme is thoroughly examined in terms of security and efficiency. Privacy, security, integrity, and scalability are also analyzed while applying it to the blockchain network.

This paper proposes a scheme to integrate data communication, wireless energy harvesting and anti-eavesdropping functions into a hybrid beamforming downlink system to satisfy the demand for expanded functionalities in a communication system. To solve this difficult nonconvex problem, the Semidefinite Relaxation (SDR) method is employed to obtain the digital transmitter, the SDR method and penalty convex-concave procedure (CCP) method are employed to obtain the analog transmitter. Simulation results shows four conclusions about the system. Firstly, the larger the SINR target or the energy harvest target, the more transmit power is required. Secondly, the lower the data rate obtained by the eavesdropper, the more transmit power is required. Thirdly, the SDR method and the penalty CCP method complement each other. Finally, the transmit power can be reduced by increasing the number of RF chains or transmit antennas.

Abstract The dynamic characteristics of vehicular ad hoc networks (VANETs) demand reliable and secure communication over wireless media. However, there are significant contradictions in autonomous vehicular systems related to security and privacy. Furthermore, VANETs require seamless data transmission to exchange time-critical data about accidents and traffic. Therefore, VANETs require secure seamless data transmission mechanisms to provide secure reliable communication without communication interruption to exchange time-critical data between vehicles. This paper proposes an Enhanced Location-Aided Ant colony Routing (ELAACR) for VANETs to achieve seamless secure data transmission. The proposed ELAACR is a two-fold scheme in which Phase 1 implements Location-Aided Key Management (LAKM) and Phase 2 implements Ant Colony Routing (ACR). An ACR combined with an LAKM pattern for offering secure and reliable communication. The LAKM scheme works based on the group signature concept to construct a secure network, and an ACR is used to find an efficient secure shortest path for seamless data transmission. The proposed work is simulated in Network Simulator (NS 2.35). By using an efficient and secure shortest path with secure seamless data transmission, the proposed ELAACR achieves an average throughput (T) of 640 Kbps, packet loss rate (PLR) of 0.018%, packet delivery ratio (PDR) of 98.5%, overhead (OH) of 0.157%, and 0.16 s end-to-end delay (EED) compared to Enhanced Hybrid Ant Colony Optimization Routing Protocol (EHACORP) and Fuzzy Based Ant Colony Optimization (F-ANT). The simulation results show that the proposed ELAACR registers better performance in all aspects compared to the existing EHACORP and F-ANT.

At the intersection of technological evolution and escalating computational demand, the role of optics is reemerging as a transformative force in the field of computing. This article examines the evolving landscape surrounding optical advantages in computing, focusing on current trends and prospects. Optical computing finds applications across various domains, such as parallel processing, high-speed signal processing, energy efficiency, quantum computing, machine learning, secure communication, and signal/image processing. This review synthesizes insights from scholarly articles, peer-reviewed journals, and academic papers to analyze the potential and challenges of leveraging optics for computational tasks. The literature review also critically examines the challenges of adopting optical computing solutions. The recommended multidimensional approach to overcoming adoption challenges involves holistically addressing integration challenges, manufacturing complexities, and infrastructure needs where collaboration will catapult optical computing into an era of computational power. Through a multidimensional exploration, this article provides a comprehensive understanding of the opportunities and challenges in harnessing optical advantages in computing, positioning optical computing as a revolutionary force with far-reaching consequences. Consequently, this review offers insight and guides researchers, industry professionals, and policymakers toward a computational future that maximizes the advantages of optical computing in specific and pivotal application areas, transcending existing boundaries. [ABSTRACT FROM AUTHOR]

In tandem with the fast-growing technology, the issue of secure data transmission over the Internet has achieved increasing importance. In digital media, enclosing data in images is one of the most common methods for communicating confidential information. A novel reversible data hiding in the encrypted images scheme based on selective bin models is proposed in this paper. The scheme focuses on enhancing the embedding capacity while ensuring the security of images with the help of encryption and the proposed data hiding process. For data embedding, lossless compression is utilized and the image is classified into three bins. Then, marker bits are assigned to these bins for distinguishing between embeddable and non-embeddable regions. The proposed method shows a satisfactory embedding rate for smooth images as well as complex ones due to its selective bin approach. Also, the method is separable in nature, i.e., data extraction and image recovery can be performed independently. Furthermore, the experimental results demonstrate the strategy’s effectiveness when compared with others. [ABSTRACT FROM AUTHOR]

The drawbacks of a one-dimensional chaotic map are its straightforward structure, abrupt intervals, and ease of signal prediction. Richer performance and a more complicated structure are required for multidimensional chaotic mapping. To address the shortcomings of current chaotic systems, an n-dimensional cosine-transform-based chaotic system (nD-CTBCS) with a chaotic coupling model is suggested in this study. To create chaotic maps of any desired dimension, nD-CTBCS can take advantage of already-existing 1D chaotic maps as seed chaotic maps. Three two-dimensional chaotic maps are provided as examples to illustrate the impact. The findings of the evaluation and experiments demonstrate that the newly created chaotic maps function better, have broader chaotic intervals, and display hyperchaotic behavior. To further demonstrate the practicability of nD-CTBCS, a reversible data hiding scheme is proposed for the secure communication of medical images. The experimental results show that the proposed method has higher security than the existing methods. [ABSTRACT FROM AUTHOR]

Intelligent vehicular networks leverage communication technologies to enable vehicles to interact with each other and with infrastructure elements, such as roadside units and traffic signals, to enhance road safety and efficiency. However, the open nature of these networks exposes them to various security threats, including data interception, tampering, and unauthorized access. Traditional encryption methods may not suffice to address these challenges, necessitating the adoption of advanced cryptographic techniques like ECC and RSA. Prior research in the field has primarily focused on either enhancing communication protocols or improving security measures independently. However, there is a notable gap in research that comprehensively addresses both aspects simultaneously. This study aims to fill this void by proposing an integrated approach that ensures both seamless communication and robust security in intelligent vehicular networks. The proposed methodology involves the design and implementation of a hybrid cryptographic scheme combining ECC and RSA algorithms. This scheme will be integrated into the existing communication infrastructure of intelligent vehicular networks. The performance of the system will be evaluated through simulations and real-world experiments to assess its effectiveness in securing communication channels while minimizing overhead. The results show the effectiveness of the proposed ECC-RSA hybrid encryption scheme in securing communication channels within intelligent vehicular networks. The integration of ECC and RSA protocols not only enhances the security of data transmission but also ensures seamless communication, thereby advancing road safety in intelligent vehicular environments [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

The dynamic characteristics of vehicular ad hoc networks (VANETs) demand reliable and secure communication over wireless media. However, there are significant contradictions in autonomous vehicular systems related to security and privacy. Furthermore, VANETs require seamless data transmission to exchange time-critical data about accidents and traffic. Therefore, VANETs require secure seamless data transmission mechanisms to provide secure reliable communication without communication interruption to exchange time-critical data between vehicles. This paper proposes an Enhanced Location-Aided Ant colony Routing (ELAACR) for VANETs to achieve seamless secure data transmission. The proposed ELAACR is a two-fold scheme in which Phase 1 implements Location-Aided Key Management (LAKM) and Phase 2 implements Ant Colony Routing (ACR). An ACR combined with an LAKM pattern for offering secure and reliable communication. The LAKM scheme works based on the group signature concept to construct a secure network, and an ACR is used to find an efficient secure shortest path for seamless data transmission. The proposed work is simulated in Network Simulator (NS 2.35). By using an efficient and secure shortest path with secure seamless data transmission, the proposed ELAACR achieves an average throughput (T) of 640 Kbps, packet loss rate (PLR) of 0.018%, packet delivery ratio (PDR) of 98.5%, overhead (OH) of 0.157%, and 0.16 s end-to-end delay (EED) compared to Enhanced Hybrid Ant Colony Optimization Routing Protocol (EHACORP) and Fuzzy Based Ant Colony Optimization (F-ANT). The simulation results show that the proposed ELAACR registers better performance in all aspects compared to the existing EHACORP and F-ANT. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet of Things (IoT), ensuring secure communication between devices has become a crucial challenge. This paper proposes a novel secure communication solution by extracting wireless channel state information (CSI) features from IoT devices to generate a device identity. Due to the instability of the wireless channel, the CSI features are fuzzy and time-varying; thus, we a employ locally sensitive hashing (LSH) algorithm to ensure the stability of the generated identity in a dynamically changing wireless channel environment. Furthermore, zero-knowledge proofs are utilized to guarantee the authenticity and effectiveness of the generated identity. Finally, the identity generated using the aforementioned approach is integrated into an IBE communication scheme, which involves the fuzzy extraction of channel state information from IoT devices, stable identity extraction for fuzzy IoT devices using LSH, and the use of zero-knowledge proofs to ensure the authenticity of the generated identity. This identity is then employed as the identity information in identity-based encryption (IBE), constructing the device's public key for achieving confidential communication between devices. [ABSTRACT FROM AUTHOR]

In this paper, we use two Fractional-Order Chaotic Systems (FOCS)—one for the sender and one for the receiver—to determine the optimal synchronisation for a secure communication technique. With the help of the Step-By-Step Sliding-Mode Observer (SBS-SMO), this synchronisation is accomplished. An innovative optimisation method, known as the artificial Harris hawks optimisation (HHO), was employed to enhance the observer's performance. This method eliminates the random parameter selection process and instead selects the optimal values for the observer. In a short amount of time, the secret message that could have been in the receiver portion (signal, voice, etc.) was successfully recovered using the proposed scheme. The experimental validation of the numerical results was carried out with the assistance of an Arduino microcontroller and several electronic components. In addition, the findings of the experiments were compared with the theoretical calculations, revealing a satisfactory level of agreement. [ABSTRACT FROM AUTHOR]

The emergence of new complex technologies, such as cloud and quantum computing, has a complicated computational structure, which can compromise the security of traditional cryptographic protocols. It has been noted that traditional security systems utilize non-quantum resistance factorization and Diffie–Hellman (DH) hard problems for their protection. Lattice-based cryptography appears to be a potential post-quantum substitute for the presently employed public-key cryptography. As a result, we have been motivated to focus on increasingly sophisticated and challenging lattice hard assumptions capable of withstanding new modern technologies with quantum resistance properties. In this paper, we devise a new lattice-based public-key encryption and signature schemes with smaller key sizes. The proposed scheme also resists the quantum attack because of the lattice small integer solution problem and its variant. The security claim has also been proved in a well-suited model for quantum attacks. The performance analysis shows that the presented schemes outperform the DH-type schemes and compete with similar lattice-based schemes in terms of storage, communication, key sizes, and computational overheads. [ABSTRACT FROM AUTHOR]

In wireless communication system, IRS can regulate the phase shift of reflecting units to reflect signals, which is used to enhance user signals and suppress eavesdropper signals and solve the problem of secure communication between hase station and users. To address this issue, this paper proposed a secure communication scheme for multi IRS assisted multi user multiple input single output system, with the goal of maximizing system weighted sum secrecy rate. This scheme firstly decom posed the problem of maximizing weighted sum security rate into two subproblems; transmission beamforming and artificial noise vector optimization, and multi-IRS phase matrix optimization. And then, this scheme transformed each subproblem into a simple convex subproblem for solution by using methods such as semidefinite relaxation, citation theorems, auxiliary variable substitution, and first-order Taylor approximation. Finally, this paper obtained the maximum weighted sum secrecy rate by se quentially solving two convex optimization subproblems based on the alternating optimization algorithm. The numerical simula tion results show that the proposed algorithm scheme can effectively enhance the secure commmunication performance of the sys tem compared with the other three schemes, and indicate that multiple IRS deployments can achirve better system security than a single IRS. [ABSTRACT FROM AUTHOR]

The modern world has brought everyone closer through digital communications. People are highly dependent on digital services. The quest for a more complex coding algorithm to prevent data from breaching is never-ending. The more intricate the algorithm is, the safer the communication will be. So, the vogue is to find the most convoluted algorithm to provide secure communication. In this paper, a unique algorithm is developed using graph labeling, a complement of a graph and generalized complement. The algorithm generates two labeled graphs satisfying vertex even mean and vertex odd mean labelings. Encryption involves the process of complementation and combining both graphs by k-complementation of graphs to obtain a cipher graph. The reverse process is applied for decryption which involves splitting the cipher graph into two subgraphs by applying k-complement for the specified partition of the vertex set, taking the complement of the obtained graph/s and getting the values of the plaintext using the graph labeling method. The proposed algorithm is designed in such a way that it should be useful for all kinds of plaintexts even with special characters. To illustrate this, an app is developed in the Android platform for communication of messages using endto-end encryption. [ABSTRACT FROM AUTHOR]

This paper explores the synchronization and implementation of a novel hyperchaotic system using an adaptive observer. Hyperchaotic systems, known for possessing a greater number of positive Lyapunov exponents compared to chaotic systems, present unique challenges and opportunities in control and synchronization. In this study, we introduce a novel hyperchaotic system, thoroughly examining its dynamic properties and conducting a comprehensive phase space analysis. The proposed hyperchaotic system undergoes validation through circuit simulation to confirm its behavior. Introducing an adaptive observer synchronization technique, we successfully synchronize the dynamics of the novel hyperchaotic system with an identical counterpart. Importantly, we extend the application of this synchronization method to the domain of secure communication, showcasing its practical usage. Simulation outcomes validate the effectiveness of our methodology, demonstrating favorable results in the realm of adaptive observer-based synchronization. This research contributes significantly to the understanding and application of hyperchaotic systems, offering insights into both the theoretical aspects and practical implementation. Our findings suggest potential advancements in the field of chaotic systems, particularly in their applications within secure communication systems. By presenting motivations, methods, results, conclusions and the significance of our work in a more appealing manner, we aim to engage readers and highlight the innovative contributions of this study. [ABSTRACT FROM AUTHOR]

The variable-order fractional (VOF) chaotic systems offer a promising solution for applications in secure communication due to their unique properties. This paper addresses the synchronisation problem in secure communication for these systems, which have uncertainties and external disturbances with unknown bounds. According to the variable-order fractional type Mittag-Leffler stability theorem, a fractional-order derivative is applied to a sliding surface, and suitable adaptive laws are devised to address uncertainties and disturbances. A variable-order fractional control strategy and a new criterion are developed to ensure the synchronisation error systems achieve asymptotic stability in finite time, for which the upper limit can be obtained. Simulation outcomes demonstrate the efficacy of the proposed synchronisation strategy in secure communication scenarios. [ABSTRACT FROM AUTHOR]

Summary: In recent days, VANET is considered as the main hopeful equipment in the system of transportation since traffic congestion arises regularly and thus occurred road accidents very easily. Besides, the network traffic is increasing due to the huge quantity of information generated in region of urban. Therefore, one of the primary challenges faced by Intelligent Transportation System (ITS) is ensuring the accurate transmission of information in both vehicle‐to‐vehicle (V2V) and vehicle‐to‐road (V2R) sensing unit communications. So, here, an adaptive routing controller (ARC) is utilized to improve the data transmission between vehicle and road sensing unit (RSU) and to minimize the traffic density in VANET, and the self‐adaptive search optimization is developed in VANET clustering to prioritize vehicles in the lane, in which the multi‐objective function is intended depending on the energy of the node, acceleration, jitter, priority, velocity, and trust factors. The traffic light control is done to facilitate the effective communication in the network. Thus, the proposed technique is calculated in terms of throughput, jitter, quadratic mean of acceleration (QMA), and spatially distributed travel time (SDTT), which acquired the values of 0.53 s, 36.07 kmph, 3.472 s, and 43.572%, respectively, while using 50 vehicles at 50 s. [ABSTRACT FROM AUTHOR]

Chaotic systems have proven highly beneficial in engineering applications. Pseudo-random numbers produced by chaotic systems have been used for secure communication, notably image encryption. Specific characteristics can increase the chaotic behavior of the system by adding complexity and nonlinearity. The three most well-known characteristics are memristive properties, multistability (coexisting attractors), and hidden attractors. These characteristics strengthen the produced time series' unpredictability and randomness, strengthening an encryption algorithm's resistance to many attacks. This study introduces a unique four-dimensional chaotic system with extreme multistability with respect to three initial conditions (including the memristor initial condition) and all previously known properties. It is rare to find an extreme multistable system like this. This system is coupled with a quadratic flux-controlled memristor based on the well-known Sprott J system. This system has a line of unstable equilibrium points with hidden attractors. The memristor displays the characteristic pinched hysteresis loops, where the area inside a loop and the voltage frequency are inversely related. A comprehensive dynamical analysis thoroughly examines all system characteristics and initial conditions. The numerical findings are carefully verified, and an analog circuit is successfully built and simulated. The chaotic sequences generated by this system are combined with deoxyribonucleic acid (DNA) operations and the global bit scrambling (GBS) technique to create an image encryption algorithm that has strong resistance to a variety of potential attacks, including noise, statistical, exhaustive, differential, and cropping attacks. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) enabled wireless sensor networks (WSNs) are used to collect data from various nodes in hostile environments, but it is essential to authenticate legitimate nodes to prevent malicious attacks. Traditional authentication schemes may be vulnerable to attack, necessitating the development of more secure authentication techniques. To address this problem, we propose a novel authentication technique for multi‐gateway IoT‐enabled WSNs that achieves effective and secure data communication. The proposed scheme is based on biological information, hash, and XOR operations, which reduce computational costs. Passwords, biometric information, and session keys are updated securely to maintain forward and backward secrecy during communication. We provide an informal security analysis of the proposed scheme and a formal security analysis of the session key using the real‐or‐random (ROR) model. We also use the AVISPA simulation toolkit to verify the proposed user authentication scheme. Experimental results demonstrate that our proposed scheme is more effective than previous multi‐factor multi‐gateway authentication protocols. [ABSTRACT FROM AUTHOR]

We propose a secure user pairing (UP) and power allocation (PA) strategy for a downlink Non-Orthogonal Multiple Access (NOMA) system when there exists an external eavesdropper. The secure transmission of data through the downlink is constructed to optimize both UP and PA. This optimization aims to maximize the achievable sum secrecy rate (ASSR) while adhering to a limit on the rate for each user. However, this poses a challenge as it involves a mixed integer nonlinear programming (MINLP) problem, which cannot be efficiently solved through direct search methods due to its complexity. To handle this gracefully, we first divide the original problem into two smaller issues, i.e., an optimal PA problem for two paired users and an optimal UP problem. Next, we obtain the closed-form optimal solution for PA between two users and UP in a simplified NOMA system involving four users. Finally, the result is extended to a general 2 K -user NOMA system. The proposed UP and PA method satisfies the minimum rate constraints with an optimal ASSR as shown theoretically and as validated by numerical simulations. According to the results, the proposed method outperforms random UP and that in a standard OMA system in terms of the ASSR and the average ASSR. It is also interesting to find that increasing the number of user pairs will bring more performance gain in terms of the average ASSR. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Shenzhen University Science & Engineering is the property of Editorial Department of Journal of Shenzhen University Science & Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)