Federated learning (FL) can protect clients’ privacy from leakage in distributed machine learning. Applying federated learning to edge computing can protect the privacy of edge clients and benefit edge computing. Nevertheless, eavesdroppers can analyze the parameter information to specify clients’ private information and model features. And it is difficult to achieve a high privacy level, convergence, and low communication overhead during the entire process in the FL framework. In this paper, we propose a novel privacy-preserving federated learning framework for edge computing (PFLF). In PFLF, each client and the application server add noise before sending the data. To protect the privacy of clients, we design a flexible arrangement mechanism to count the optimal training times for clients. We prove that PFLF guarantees the privacy of clients and servers during the entire training process. Then, we theoretically prove that PFLF has three main properties: 1) For a given privacy level and model aggregation times, there is an optimal number of participating times for clients; 2) There is an upper and lower bound of convergence; 3) PFLF achieves low communication overhead by designing a flexible participation training mechanism. Simulation experiments confirm the correctness of our theoretical analysis. Therefore, PFLF helps design a framework to balance privacy levels and convergence and achieve low communication overhead when there is a part of clients dropping out of training.

In federated learning (FL), each client collaboratively trains the global model through the cloud server (CS) without sharing its original dataset in edge computing. However, CS can analyze and forge the uploaded parameters and infer the privacy of clients, which calls for the necessity of verifying the integrity and protecting the privacy for aggregation. Although there are some works to ensure the verifiability of aggregation results, there is still a lack of work on analyzing the relationship between verification and dropout rate for edge computing. In this work, we propose privacy-preserving and verifiable federated learning (PVFL) with low communication and computation overhead for verification. We theoretically demonstrate that PVFL has three properties: 1) the communication overhead for verification is independent of the dropouts and the dimension of the parameter vector; 2) the computation overhead for verification is independent of the dropouts; 3) the value of the loss function is negatively correlated with the number of dropouts. Experimental results demonstrate the correctness of our theoretical results and practical performance with a high dropout rate, thereby facilitating the design of privacy-preserving and verifiable FL algorithms for edge computing with a high dimension of parameter vectors and a high dropout rate.

The growing concerns about data privacy in society lead to restrictions on the computer vision research gradually. Several collaboration-based vision learning methods have recently emerged, e.g ., federated learning and split learning. These methods protect user data from leaving local devices, and make training performed only by uploading gradients, parameters, or activations, etc . However, there is little research on collaborative learning based on state-of-the-art and large-scaled models, mainly due to the high computation or communication overheads of the latest models. Training these models may be still unrealized for users’ terminals. In this paper, we make a first attempt at the sensitive image pre-training with large-scaled models in the collaborative learning scenario, and propose a new lightweight framework for split learning based on mask, Masked Split Learning (MaskSL). We further ensure its security by differential privacy. Besides, we model the computation and communication overheads of several collaborative learning approaches by deduction to illustrate advantages of our scheme. Finally, we design and conduct a series of experiments on real-world datasets, e.g ., in face recognition and medical image classification tasks, to demonstrate the performance of MaskSL.

In recent years, vaccine safety incidents have occurred frequently. To protect vaccine safety, researchers have proposed to use blockchain to secure the vaccine circulation process. Technically, blockchain has some limitations in solving vaccine and other supply chain problems, such as large on-chain storage consumption and low throughput. To better alleviate these restrictions, we propose an improved, blockchain-based, storage-efficient vaccine safety protection scheme in this work. Specifically, we first model the vaccine circulation process. We then design a system to protect vaccine circulation using blockchain, cloud, and cryptographic mechanisms. The proposed system leverages the cloud to implement the vaccine circulation model. Correspondingly, it uses the blockchain to store circulating data certificates and signatures. We evaluated the proposed conceptual model using a consortium blockchain. The experimental results show that the proposed system is efficient.

Log anomaly detection is crucial for computer systems. By analyzing and processing the logs generated by a system, abnormal events or potential problems in the system can be identified, which is helpful for its stability and reliability. At present, due to the expansion of the scale and complexity of software systems, the amount of log data grows enormously, and traditional detection methods have been unable to detect system anomalies in time. Therefore, it is important to design log anomaly detection methods with high accuracy and strong generalization. In this paper, we propose the log anomaly detection method LogADSBERT, which is based on Sentence-BERT. This method adopts the Sentence-BERT model to extract the semantic behavior characteristics of log events and implements anomaly detection through the bidirectional recurrent neural network, Bi-LSTM. Experiments on the open log data set show that the accuracy of LogADSBERT is better than that of the existing log anomaly detection methods. Moreover, LogADSBERT is robust even under the scenario of new log event injections.