Cloud computing is a disruptive technology that has transformed the way people access and utilize computing resources. Due to the diversity of services and complexity of environments, there is widespread interest in how to securely and efficiently authenticate users under the same domain. However, many traditional authentication methods involve untrusted third parties or overly centralized central authorities, which can compromise the security of the system. Therefore, it is crucial to establish secure authentication channels within trusted domains. In this context, we propose a secure and efficient authentication protocol, HIDA (Hyperledger Fabric Identity Authentication), for the cloud computing environment. Specifically, by introducing federated chain technology to securely isolate entities in the trust domain, and combining it with zero-knowledge proof technology, users’ data are further secured. In addition, Subsequent Access Management allows users to prove their identity by revealing only brief credentials, greatly improving the efficiency of access. To ensure the security of the protocol, we performed a formal semantic analysis and proved that it can effectively protect against various attacks. At the same time, we conducted ten simulations to prove that the protocol is efficient and reliable in practical applications. The research results in this paper can provide new ideas and technical support for identity authentication in a cloud environment and provide a useful reference for realizing the authentication problem in cloud computing application scenarios.

Cooperative Coevolution (CC) was introduced into evolutionary algorithms as a promising framework for tackling large scale optimization problems through a divide-and-conquer strategy. A number of decomposition methods to identify interacting variables have been proposed to construct subcomponents of a large scale problem, but if the variables are all non-separable, all the CC-based algorithms of decomposition will lose the functionality, therefore, classical CC-based algorithms are inefficient in processing non-separable problems that have many interacting variables. In this paper, a new CC framework which integrates global and local search algorithms is proposed for solving large scale optimization problems. In the stage of global cooperative coevolution, we introduce a new interacting variables grouping method named Sequential Sliding Window. When the performance of global search reaches a deviation tolerance or the variables are fully non-separable, we then use a more effective local search algorithm to subsequently search the solution space of the large scale optimization problem. The integration of global and local algorithms into CC framework can efficiently improve the capability in processing large scale non-separable problems. Experimental results on large scale optimization benchmarks show that the proposed framework is more effective than other existing CC frameworks.

With the rapid development of 5 G communication technology, small military UAV swarms are increasingly used in reconnaissance, surveillance, and remote sensing fields. Authentication has become a critical factor in ensuring the safe and efficient operation of UAV swarms. Due to their complexity and limitations, traditional methods cannot meet the dynamic deployment and command authority switching requirements of UAV swarms in special wartime environments. Therefore, this study proposes a secure and efficient authentication scheme for UAV swarms based on the CVMerkle tree structure. The scheme integrates distributed digital ledger technology to optimize the authentication process between UAVs and the Airborne Command Center(ACC). This significantly reduces the communication and computational load while improving the security and reliability of authentication. Additionally, the scheme introduces the innovative concept of dynamic authorization in the ACC, which effectively eliminates security threats arising from internal corruption within the core organization. The results of the simulation experiment demonstrate that the scheme offers significant advantages in terms of security, efficiency, and storage requirements. Future research will focus on developing more efficient key management mechanisms and swarm-switching strategies to adapt to the complex and dynamic combat environment, further enhancing the combat effectiveness of UAV swarms.

Establishing an accurate and robust short-term load forecasting (STLF) model for a power system in safe operation and rational dispatching is both required and beneficial. Although deep long short-term memory (LSTM) networks have been widely used in load forecasting applications, it still has some problems to optimize, such as unstable network performance and long optimization time. This study proposes an adaptive step size self-organizing migration algorithm (AS-SOMA) to improve the predictive performance of LSTM. First, an optimization model for LSTM prediction is developed, which divides the LSTM structure seeking into two stages. One is the optimization of the number of hidden layer layers, and the other optimizes the number of neurons, time step, learning rate, epochs, and batch size. Then, a logistic chaotic mapping and an adaptive step size method were proposed to overcome slow convergence problems and stacking into local optimum of SOMA. Comparison experiments with SOMA, PSO, CPSO, LSOMA, and OSMA on test function sets show the advantages of the improved algorithm. Finally, the AS-SOMA-LSTM network prediction model is used to solve the STLF problem to verify the effectiveness of the proposed algorithm. Simulation experiments show that the AS-SOMA exhibits higher accuracy and convergence speed on the standard test function set and has strong prediction ability in STLF application with LSTM.