As malware variants continue to increase, the risk of evading detection also grows. While fuzzy hashing has traditionally been successful at clustering malware samples based on their structural similarities, its potential as an active defense tool remains largely unexplored. This study investigates the application of fuzzy hashing for the static analysis of malware binaries to identify common vulnerabilities prevalent in malware, serving as a proactive security measure. We utilized a labeled dataset comprising real-world and synthetic Windows binaries to evaluate six fuzzy hashing algorithms for full binary classification and two for function-level matching. Our results indicate that, while fuzzy hashing is effective in simpler tasks such as malware classification and binary-level vulnerability detection, its performance decreases in more complex scenarios, including multi-class vulnerability identification and matching functions from real-world malware. Moreover, we observed a significant drop in performance, by up to 50%, when transitioning from synthetic to actual malware functions. These findings highlight both the potential and limitations of fuzzy hashing in vulnerability analysis, emphasizing the necessity for more robust techniques to detect vulnerable patterns in real-world malware.

Reconfigurable Intelligent Surfaces (RIS) have emerged as transformative technologies, enhancing spectral efficiency and improving interference management in multi-user cooperative communications. This paper investigates the integration of RIS with Flexible-Duplex (FlexD) communication, featuring dynamic scheduling capabilities, to mitigate unintended external interference in multi-user wireless networks. By leveraging the reconfigurability of RIS and dynamic scheduling, we propose a user-pair selection scheme to maximize system throughput when full channel state information (CSI) of interference is unavailable. We develop a mathematical framework to evaluate the throughput outage probability when RIS introduces spatial correlation. The derived analytical results are used for asymptotic analysis, providing insights into dynamic user scheduling under interference based on statistical channel knowledge. Finally, we compare FlexD with traditional Full Duplex (FD) and Half Duplex (HD) systems against RIS-assisted FlexD. Our results show FlexD’s superior throughput enhancement, energy efficiency and data management capability in interference-affected networks, typical in current and next-generation cooperative wireless applications like cellular and vehicular communications.

This paper investigates the relay selection (RS) problem for multi-hop full-duplex relay networks where multiple source-destination (SD) pairs compete for the same pool of relays, under the attack of multiple eavesdroppers. To enhance the physical-layer security, within a given coherence time, our objective is to jointly assign the available relays at each hop to different SD pairs to maximize the minimum secrecy rate among all pairs. Two RS schemes, optimal RS and suboptimal RS (SRS), are proposed for two-hop networks based on global channel state information (CSI) and only SD pairs CSI, respectively. Since all users can communicate within the same coherence time, our joint RS schemes are important for the user-fairness and ultra-reliable low-latency communications. To evaluate the performance, the exact secrecy outage probability of the SRS scheme is derived under two residual self-interference models. The asymptotic analysis shows that the SRS scheme achieves full diversity. A relay-based jamming scheme is also proposed by using unassigned relays for user communications. Finally, the two-hop RS schemes and the analysis are extended to the general multi-hop network with multiple eavesdroppers. The numerical results reveal interesting fundamental trends where the proposed schemes can significantly enhance the secrecy performance.

This paper studies the relay selection (RS) problem for full-duplex (FD) relay networks with multiple source-destination (SD) pairs under the attack of colluding eavesdroppers. Based on available channel state information (CSI), both optimal relay selection (ORS) and suboptimal relay selection (SRS) schemes are considered to maximize the minimum secrecy rate among all pairs in order to enhance the physical-layer security. The secrecy performance of the more practical SRS scheme is then evaluated in terms of intercept probability and diversity order. The SRS achieves full diversity when the gains of the main-to- eavesdropper and the main-to-interference channels increase asymptotically.

We consider the point process of signal strengths emitted from transmitters in a wireless network and observed at a fixed position. In our model, transmitters are placed deterministically or randomly according to a hard core or Poisson point process, and the signals are subjected to power law propagation loss and random propagation effects that may be correlated between transmitters. We provide bounds on the distance between the point process of signal strengths and a Poisson process with the same mean measure, assuming correlated log-normal shadowing. For “strong shadowing” and moderate correlations, we find that the signal strengths are close to a Poisson process, generalizing a recently shown analogous result for independent shadowing.