The paper presents an experimental security assessment within two widely used open-source 5G projects, namely Open5GS and OAI (Open-Air Interface). The examination concentrates on two network functions (NFs) that are externally exposed within the core network architecture, i.e., the Access and Mobility Management Function (AMF) and the Network Repository Function/Network Exposure Function (NRF/NEF) of the Service-Based Architecture (SBA). Focusing on the Service-Based Interface (SBI) of these exposed NFs, the analysis not only identifies potential security gaps but also underscores the crucial role of Mobile Network Operators (MNOs) in implementing robust security measures. Furthermore, given the shift towards Network Function Virtualization (NFV), this paper emphasizes the importance of secure development practices to enhance the integrity of 5G network functions. In essence, this paper underscores the significance of scrutinizing security vulnerabilities in open-source 5G projects, particularly within the core network’s SBI and externally exposed NFs. The research outcomes provide valuable insights for MNOs, enabling them to establish effective security measures and promote secure development practices to safeguard the integrity of 5G network functions. Additionally, the empirical investigation aids in identifying potential vulnerabilities in open-source 5G projects, paving the way for future enhancements and standard releases.

Time-Slotted Channel Hopping (TSCH) mode in the IEEE 802.15.4-2015 standard provides ultra-high reliability and ultra-low power consumption to sensor devices. The key feature of TSCH is the scheduling of time slots and frequencies, which falls outside the current standards. In this paper, we focus on throughput maximizing and max-min fair scheduling problems in a centralized TSCH networks. At first, a polynomial time algorithm for the throughput maximizing scheduling problem is proposed. We proceed to investigate and deliberate on some instances of the problem with their combinatorial properties. Secondly, a novel auction based scheduling algorithm that uses a first-price sealed-bid auction mechanism is presented for the throughput maximizing problem. Simulation results show that the proposed algorithm obtains a close throughput performance to the optimal one obtained through CPLEX with a much lower complexity. Moreover, we propose a novel heuristic for the max-min fair scheduling problem and demonstrate its performance through extensive simulations in terms of the total throughput and fairness varying the number of nodes, frequencies and antennas. Simulation results indicate the effectiveness of the proposed algorithm and its close performance to the optimal solution.

Quantum computers have the potential to break the public-key cryptosystems widely used in key exchange and digital signature applications. To address this issue, quantum key distribution (QKD) offers a robust countermeasure against quantum computer attacks. Among various QKD schemes, BB84 is the most widely used and studied. However, BB84 implementations are inherently imperfect, resulting in quantum bit error rates (QBERs) even in the absence of eavesdroppers. Distinguishing between QBERs caused by eavesdropping and QBERs due to channel imperfections is fundamentally infeasible. In this context, this paper proposes and examines a practical method for detecting eavesdropping via partial intercept-and-resend attacks in the BB84 protocol. A key feature of the proposed method is its consideration of quantum system noise. The efficacy of this method is assessed by employing the Quantum Solver library in conjunction with backend simulators inspired by real quantum machines that model quantum system noise. The simulation outcomes demonstrate the method’s capacity to accurately estimate the eavesdropper’s interception density in the presence of system noise. Moreover, the results indicate that the estimation accuracy of the eavesdropper’s interception density in the presence of system noise is dependent on both the actual interception density value and the key length.