Search

The development of artificial intelligence (AI) and self-driving technology is expected to enhance intelligent transportation systems (ITSs) by improving road safety and mobility, increasing traffic flow, and reducing vehicle emissions in the near future. In an ITS, each autonomous vehicle acts as a node with its own local machine learning models, which can be updated using locally collected data. However, for autonomous vehicles to learn effective models, they must be able to learn from data sources provided by other vehicles and infrastructure, utilizing innovative learning methods to adapt to various autonomous driving scenarios. Distributed learning plays a crucial role in implementing these learning tasks in an ITS. This review provides a systematic overview of distributed learning in the field of ITSs. Within an ITS, vehicles can engage in distributed learning by interacting with peers through opportunistic encounters and clustering. This study examines the challenges associated with distributed learning, focusing on issues related to privacy and security in data intelligence sharing, communication quality and speed, and trust. Through a thorough analysis of these challenges, this study presents potential research avenues to address these issues, including the utilization of incentive mechanisms that rely on reputation, the adoption of rapid convergence techniques, and the integration of opportunistic federated learning with blockchain technology.

With the deployment of more and more 5g networks, the limitations of 5g networks have been found, which undoubtedly promotes the exploratory research of 6G networks as the next generation solutions. These investigations include the fundamental security and privacy problems associated with 6G technologies. Therefore, in order to consolidate and solidify this foundational research as a basis for future investigations, we have prepared a survey on the status quo of 6G security and privacy. The survey begins with a historical review of previous networking technologies and how they have informed the current trends in 6G networking. We then discuss four key aspects of 6G networks – real-time intelligent edge computing, distributed artificial intelligence, intelligent radio, and 3D intercoms – and some promising emerging technologies in each area, along with the relevant security and privacy issues. The survey concludes with a report on the potential use of 6G. Some of the references used in this paper along and further details of several points raised can be found at: security-privacyin5g-6g.github.io.

Searching on encrypted data has become a very important technique in cloud computing. Such searches enable the data owner to search on the encrypted data stored on the cloud without leaking any information. To obtain a better search experience, researchers have proposed many schemes which mainly focus on conjunctive and disjunctive keyword searches. However, conjunction of all the keywords may result in very few results, whereas a disjunction will return too many results. With the current schemes, customizing the relevancy of the keywords to obtain the desired results is difficult. To solve these problems, we propose a novel scheme that supports the search with the user-specified number of keywords contained in the search result. This number n can be used to customize the keyword relevancy. As a result, the data owner could obtain the desired search results containing any n keywords of a keyword set. The proposed scheme also supports the traditional disjunctive and conjunctive keyword searches when n equals 1 or the size of the keyword set, respectively. The keyword could be positive or negative. We first formally define its security and then prove that the proposed scheme is secure against the adaptively chosen keyword attack in the standard model and can defend against the offline keyword guessing attack to some extent. Furthermore, we present a theoretical performance comparison with other schemes as well as the experimental performance evaluations on our implemented scheme.

In recent years, the widespread prevalence of smart devices has created a new class of mobile Internet of Thing applications. Called mobile crowdsensing, these techniques use workers with mobile devices to collect data and send it to task requester for rewards. However, to ensure the optimal allocation of tasks, a centralized server needs to know the precise location of each user, but exposing the workers' exact locations raises privacy concerns. In this paper, we propose a data release mechanism for crowdsensing techniques that satisfies differential privacy, providing rigorous protection of worker locations. The partitioning method is based on worker density and considers non-uniform worker distribution. In addition, we propose a geocast region selection method for task assignment that effectively balances the task assignment success rate with worker travel distances and system overheads. Extensive experiments prove that the proposed method not only provides a strict privacy guarantee but also significantly improves performance.

Data aggregation plays an important role in the Internet of Things, and its study and analysis has resulted in a range of innovative services and benefits for people. However, the privacy issues associated with raw sensory data raise significant concerns due to the sensitive nature of the user information it often contains. Thus, numerous schemes have been proposed over the last few decades to preserve the privacy of users’ data. Most methods are based on encryption technology, which is computationally and communicationally expensive. In addition, most methods can only handle a single aggregation function. Therefore, in this paper, we propose a multifunctional data aggregation method with differential privacy. The method is based on machine learning and can support a wide range of statistical aggregation functions, including additive and non-additive aggregation. It operates within a fog computing architecture, which extends cloud computing to the edge of the network, alleviating much of the computational burden on the cloud server. And, by only reporting the results of the aggregation to the server, communication efficiency is improved. Extensive experimental results show that the proposed method not only answers flexible aggregation queries that meet diversified aggregation goals, but also produces aggregation results with high accuracy.

This paper surveys the current research status of location privacy issues in mobile applications. The survey spans five aspects of study: the definition of location privacy, attacks and adversaries, mechanisms to preserve the privacy of locations, location privacy metrics, and the current status of location-based applications. Through this comprehensive review, all the interrelated aspects of location privacy are integrated into a unified framework. Additionally, the current research progress in each area is reviewed individually, and the links between existing academic research and its practical applications are identified. This in-depth analysis of the current state-of-play in location privacy is designed to provide a solid foundation for future studies in the field.

The growing popularity of location-based services is giving untrusted servers relatively free reign to collect huge amounts of location information from mobile users. This information can reveal far more than just a user's locations but other sensitive information, such as the user's interests or daily routines, which raises strong privacy concerns. Differential privacy is a well-acknowledged privacy notion that has become an important standard for the preservation of privacy. Unfortunately, existing privacy preservation methods based on differential privacy protect user location privacy at the cost of utility, aspects of which have to be sacrificed to ensure that privacy is maintained. To solve this problem, we present a new privacy framework that includes a semi-trusted third party. Under our privacy framework, both the server and the third party only hold a part of the user's location information. Neither the server nor the third party knows the exact location of the user. In addition, the proposed perturbation method based on the Johnson Lindenstrauss transform satisfies the differential privacy. Two popular point of interest queries, k-NN and Range, are used to evaluate the method on two real-world data sets. Extensive comparisons against two representative differential privacy-based methods show that the proposed method not only provides a strict privacy guarantee but also significantly improves performance.

To fight against the evolving computer viruses, we must constantly inject new virus patches into the computer networks. This paper addresses the patch injection problem, i.e., the problem of developing a patch injection strategy to mitigate the negative impact of virus attacks. As the impact of an attack depends on not only the patch injection strategy but the unknown virus injection strategy, the patch injection problem is very complicated. This paper initiates the study of the patch injection problem by means of security economics and differential game theory. First, based on a novel virus-patch mixed propagation model, we model the original problem as a differential game. Second, we develop a method for finding a candidate for the Nash equilibrium of the game, examine the structure of the candidate, and give some examples of the candidate. Furthermore, we demonstrate through comparative experiments that the candidate is better in terms of the Nash equilibrium solution concept. Therefore, we recommend the patch injection strategy in the candidate. Finally, we examine the effects of some factors on the performance of the recommended patch injection strategy. Overall, these findings undoubtedly have guiding significance to defense against virus infections.

Background. Breast cancer is the most common type of cancer among females with a high mortality rate. It is essential to classify the estrogen receptor based breast cancer subtypes into correct subclasses, so that the right treatments can be applied to lower the mortality rate. Using gene signatures derived from gene interaction networks to classify breast cancers has proven to be more reproducible and can achieve higher classification performance. However, the interactions in the gene interaction network usually contain many false-positive interactions that do not have any biological meanings. Therefore, it is a challenge to incorporate the reliability assessment of interactions when deriving gene signatures from gene interaction networks. How to effectively extract gene signatures from available resources is critical to the success of cancer classification. Methods. We propose a novel method to measure and extract the reliable (biologically true or valid) interactions from gene interaction networks and incorporate the extracted reliable gene interactions into our proposed RRHGE algorithm to identify significant gene signatures from microarray gene expression data for classifying ER+ and ER− breast cancer samples. Results. The evaluation on real breast cancer samples showed that our RRHGE algorithm achieved higher classification accuracy than the existing approaches.

Entropy is a basic and important concept in information theory. It is also often used as a measure of the unpredictability of a cryptographic key in cryptography research areas. Ubiquitous computing (Ubi-comp) has emerged rapidly as an exciting new paradigm. In this special issue, we mainly selected and discussed papers related with ore theories based on the graph theory to solve computational problems on cryptography and security, practical technologies; applications and services for Ubi-comp including secure encryption techniques, identity and authentication; credential cloning attacks and countermeasures; switching generator with resistance against the algebraic and side channel attacks; entropy-based network anomaly detection; applied cryptography using chaos function, information hiding and watermark, secret sharing, message authentication, detection and modeling of cyber attacks with Petri Nets, and quantum flows for secret key distribution, etc.