Search

When 5G telecommunication becomes a standardized and widely used communication medium, it must be implemented in coherence with certain 5G network standards and requirements. One such requirement is a Subscription Concealed Identifier called SUCI. SUCI prevents the exposure of international mobile subscriber identity (IMSI), which was a vulnerability in previous generation mobile telecommunication networks. Unlike IMSI, SUCI is encrypted and transmitted using a symmetric key cryptographic algorithm, to prevent the aforementioned vulnerabilities. However, for the first terminal to be encrypted, it is necessary to exchange a key with the home network, and this key exchange for SUCI encryption is performed through the Elliptic Curve Integrated Encryption Scheme (ECIES) key exchange algorithm, which is a public-key encryption scheme. However, ECIES uses more computing resources compared to a symmetric key cryptographic algorithm. Additionally, for 5G Subscriber Identity Deconcealing Function (SIDF) to satisfy the massive machine-type communication (mMTC) requirements of 5G, it is necessary to decrypt at least a million SUCIs within a short time. This puts a great burden on the 5G home network to provide the mMTC service for IoT. Therefore, in this paper, we propose a method of constructing 5G SIDF in an mMTC IoT environment. A key method of the proposed 5G SIDF configuration is the use of GPUs. This proposal was aimed at reducing the load in the mMTC environment by performing parallel processing of all cryptographic operations performed in the SIDF using a GPU. In particular, we focused on parallelization of public-key encryption algorithms. In addition, we also compared the method proposed in this paper through a survey of various 5G security products.

Privacy-preserving data aggregation is an important problem that has attracted extensive study. The state-of-the-art techniques for solving this problem is differential privacy, which offers a strong privacy guarantee without making strong assumptions about the attacker. However, existing solutions cannot effectively query data aggregation from high-dimensional datasets under differential privacy guarantee. Particularly, when the input dataset contains large number of dimensions, existing solutions must inject large scale of noise into returned aggregates. To address the above issue, this paper proposes an algorithm for querying differentially private approximate aggregates from high-dimensional datasets. Given a dataset D, our algorithm first develops a $$\varepsilon '$$ -differentially private feature selection method that is based on a data sampling process over a kd-tree, which allows us to obtain a differentially private low-dimensional dataset with representative instances. After that, our algorithm samples independent samples from the kd-tree aiming at obtaining $$(\alpha ', \delta ')$$ -approximate aggregates. Finally, a model is proposed to determine the relevance between privacy and utility budgets such that the final aggregate still satisfies the accuracy requirements specified by data consumers. Intuitively, the proposed algorithm circumvents the dilemma of both dimensionality and the height threshold of kd-tree, as it samples a low-dimensional dataset S and queries aggregates from S, instead of the kd-tree. Satisfying user-specified privacy and utility budgets after multiple-stages approximation is significantly challenging, and we presents a novel model to determine the parameters’ relevance.

Mobile CrowdSensing (MCS) has emerged as a novel paradigm for performing large-scale sensing tasks. Many incentive mechanisms have been proposed to encourage user participation in MCS. However, most of them ignore the inevitable cold start stage of MCS, where the MCS system has just begun releasing tasks. Also, they all adopt the single-round incentive without considerations of the continuous cumulative effect. Given the severe shortage of participants in the cold start stage of MCS, this paper proposes a Multi-Round Incentive Mechanism (MRIM). MRIM is based on monetary incentives by adopting multi-round cooperation and alternating between task information diffusion and task allocation operations, both of which are NP-hard problems even without inter-round coupling imposed by system budget constraints. We explore a method to predict the probability of users participating in tasks accurately. Furthermore, we present an efficient task information diffusion algorithm to maximize the number of users participating in tasks by submitting bids. We propose a fast task allocation algorithm based on truthful auction, comprising an approximation algorithm for solving the one-round winner selection and payment calculation. With budget constraints, MRIM maximizes the number of completed tasks by iteratively performing task information diffusion and task allocation. We also prove that MRIM also possesses desired properties such as computational efficiency, user rationality, platform profitability, and price truthfulness, which can further guarantee the robustness of MRIM. The extensive simulations conducted on real-world datasets have proved the efficiency of MRIM.

Recently, privacy has become a major social issue since personal data is collected and analyzed from different IoT devices. To prevent the disclosure of private information, and violation of data protection rules, Federated Learning caters to this need. It provides a way to train a global model without exposing raw personal data. One of the most popular tools in this paradigm is Federated Averaging, where a few selected devices are forwarded to a global model, and the gradients thus obtained are averaged at the server. However, this aggregated global model faces the problem of dissimilar performance over clients due to unbalanced data and non-Independent and identically distributed data. In this paper, we proposed a novel framework called cluster-based Federated Averaging to achieve a fair global model by organizing the devices into groups and selecting clients from each group equally. In this way, the accuracy of the minority group could be improved significantly at the low expense of the majority group. To follow the federated learning's instinct of privacy protection, we adapt the training weights as the features to divide the users ensure the clients' training data does not leave their devices. We applied our framework on three popular datasets in machine learning: MNIST, Fashion MNIST, and Cifar-10. The experiments demonstrated that our framework could train a fair shared model effectively and efficiently.

Mobile Crowd-Sensing (MCS) is a dominant sensing paradigm for Internet of Things (IoT), with a lot of potentials as it allows data collection through the user's sensor embedded mobile devices. The participation of people in IoT not only brings greater flexibility and sensing ability but also increases the risk of privacy breaches to the participants. Primarily, a worker's location data is vulnerable to information leaks as the task assignment in MCS is location-based. Most existing mechanisms that preserve worker's location in MCS are designed under the assumption that the platform is trusted, which may be not valid in real-world applications. Besides, the existing studies focus either on task selection problem for workers or task assignment problem for the platform. Therefore, this paper investigates both task bidding and assignment while preserving location privacy. We propose two task selection strategies: Minimize Total Cost (MTC) and Minimize Average Cost (MAC). Each worker submits a cost that is obfuscated using differential privacy to the platform. We propose probability cost-efficient worker selection mechanism (PCE-WSM) to determine winners and probability individual-rationality critical payment mechanism (PIR-CPM) to determine payments to winners. We prove that PIR-CPM is truthful and can achieve probability-individual rationality by theoretical analysis. To evaluate our proposed strategies, we conduct extensive experiments on both synthetic and real-world datasets, and the experimental results validate that PCE-WSM can achieve enough privacy preservation without incurring a high payment.

Cloud computing is a novel computing paradigm, which connects plenty of computing resources and storage resources via Internet. Cloud computing provides a number of high-quality services, such as cloud storage, outsourcing computing, and on-demand self-service, which have been widely accepted by the public. In cloud computing, by submitting their tasks to cloud, plenty of applications share huge computation and storage resources. However, how to schedule resource efficiently is a big challenge in cloud computing.In this paper, we propose a SLA-aware resource algorithm to enable cloud storage more efficiently. In our scheme, we take advantage of the back-end node space utilization and I/O throughput comprehensively simultaneously. We compare and contrast the existing scheduling storage policies by implementing those algorithms. The extensive tests show that our algorithm achieves a considerable improvement in terms of violation rate and the number of used hosts.

Modeling malware propagation dynamics and developing prevention methods are very imperative with flourishing and advancement of WSN technologies in a variety of fields, such as smart cities. In the last decade, a lot of effort has been put into designing effective models to characterize the propagation dynamics of malware and developing effective prevention methods, with different focuses such as spatial–temporal model, pulse immunization, trade-off model between prevention cost and network utility, etc. This chapter reviews the state-of-the-art malware modeling and prevention method to present a comprehensive guide on how to choose a more appropriate approach for different applications. First, the application background and definitions of WSNs and malware are introduced, followed by the challenges of modeling malware propagation dynamics and developing prevention methods. Second, the recent advances in modeling and prevention methods are summarized. Third, four recently published papers that focus on spatial–temporal modeling, pulse immunization, and cost-efficiency trade-off are introduced. Finally, this chapter is ended by pointing out some possible future research directions.