Recent advancements in cloud computing, edge computing, and Internet of Things (IoT) have increased the complexity of network environments and provided fertile ground for malicious attacks. Existing DL-based malware detections, while making progress in detection accuracy and generalization ability, face serious challenges in user data privacy protection. To address this problem, this paper proposed a non-interactive malware detection system based on CKKS homomorphic encryption (FICConvNet). The system effectively achieves end-to-end data privacy protection, ensures that sensitive data uploaded by users are processed in an encrypted state, prevents data leakage, and protects the privacy of detection results. The key technology of FICConvNet is its innovative lightweight ciphertext inference architecture, which combines DS Conv and structured sparse projection to significantly reduce the complexity of homomorphic computation. Meanwhile, in this paper, an adaptive learnable activation function (ALPolyAct) is designed to replace the traditional fixed polynomial activation function to enhance the expressive power and inference accuracy of the model. In addition, the privacy protection of user data and the security of detection results are optimized by the zero-decryption inference process. Experimental results show that FICConvNet achieves a detection accuracy of 95.86%, which significantly outperforms the existing ciphertext inference model CryptoNets (15.5% improvement) and approaches the performance of the plaintext model ResNet-18. In addition, FICConvNet reduces ciphertext inference time by about 80% compared to Conv2d structures. The research in this paper provides an effective privacy-preserving solution in the field of malware detection and explores new research directions for the application of homomorphic encryption in malware detection.
To address the limitation of generalization of federated learning under non-independent and identically distributed (Non-IID) data, we propose FedDFPA, a personalized federated learning framework that integrates dynamic parameter fusion and prototype alignment. We design a class-wise dynamic parameter fusion mechanism that adaptively fuses global and local classifier parameters at the class level. It enables each client to preserve its reliable local knowledge while selectively incorporating beneficial global information for personalized classification. We introduce a prototype alignment mechanism based on both global and historical information. By aligning current local features with global prototypes and historical local prototypes, it improves cross-client semantic consistency and enhances the stability of local features. To evaluate the effectiveness of FedDFPA, we conduct extensive experiments on various Non-IID settings and client participation rates. Compared to the average performance of state-of-the-art algorithms, FedDFPA improves the average test accuracy by 3.59% and 4.71% under practical and pathological heterogeneous settings, respectively. These results confirm the effectiveness of our dual-mechanism design in achieving a better balance between personalization and collaboration in federated learning.
Multi-group homomorphic encryption (MGHE) is a pivotal advance in secure multi-party computation, integrating merits of multi-party homomorphic encryption (MPHE) and multi-key homomorphic encryption (MKHE) to eliminate MPHE’s fixed-party limitation and mitigate MKHE’s ciphertext expansion from dynamic enrollment. However, the efficient single-key FINAL scheme cannot extend to multi-party scenarios due to the challenge of defining valid multiplication for vector NTRU ciphertexts, which hinders its use in multi-group bootstrapping and curbs efficiency. To address this, additive secret sharing was adopted to convert vector NTRU ciphertext multiplication into secret share multiplication, enabling shared bootstrapping key generation within groups. A new multi-group ciphertext bootstrapping algorithm for MGHE was developed via the integration of LWE and NTRU cryptographic primitives. Bootstrapping tasks were decomposed for parallel processing, and a hybrid product algorithm was designed to aggregate subtask outputs, boosting multi-group bootstrapping speed to match that of single-key ciphertexts. Noise accumulation was analyzed, with 100-bit and 128-bit security parameter sets selected for validation. Experiments showed that 30- and 50-party multi-group bootstrapping takes only 1.87 s and 2.58 s respectively.
This paper proposes a distributed massive multiple input multiple-output (DM-MIMO) aided multi-tier vehicular edge computing (VEC) system. In particular, each vehicle terminal (VT) offloads its computational task to the roadside unit (RSU) by orthogonal frequency division multiple access (OFDMA), which can be computed locally at the RSU and offloaded to the central processing unit (CPU) via massive satellite access points (SAPs) for remote computation. By considering the partial task offloading model, we consider the joint optimization of the task offloading, subchannel allocation and precoding optimization to minimize the total cost in terms of total delay and energy consumption. To solve this non-convex problem, we transform the original problem into three sub-problems and use the alternate optimization algorithm to solve it. First, we transform the subcarrier allocation problem of discrete variables into convex optimization problem of continuous variables. Then, we use multiple quadratic transformations and Lagrange multiplier method to transform the non-convex subproblem of optimizing precoding vectors into a convex problem, while the task offloading subproblem is a convex problem. Given the subcarrier and the task allocation and precoding result, we finally find the joint optimized results by iterative optimization algorithm. Simulation results show that our proposed algorithm is superior to other benchmarks.