Nowadays, people can access a wide range of applications and services for mobile device users. Among them, location-based services (LBS), where the application needs the user’s position to provide the service. Some examples of these applications are Uber and Waze. Nevertheless, the repetitive use of an LBS can reveal confidential user information; thus, behavior patterns—such as daily routes—could be deduced by some dishonest LBS. Furthermore, a query’s keywords could provide information about a user’s health status or future position when it inquires about hospitals or hotels. Therefore, an adversary can use this information for unethical purposes, and users need mechanisms that protect their privacy. At present, several approaches separately tackle location privacy, location security, and query privacy. To the best of our knowledge, no previous work deals with all these mentioned aspects simultaneously especially when users demand continuous protection when moving and accessing an LBS. This paper proposes two batch techniques to provide location privacy, location safety, and query privacy in an environment that considers a continuous LBS. These techniques apply -diversity (query privacy) in a context that contemplates query semantics, as well as a diverse set of users’ paths. Extensive experimentation shows that both techniques are cost-effective and scalable solutions that offer unified location privacy, query privacy, and location safety protection for many mobile users.
When requesting location-based services, users can associate their queries with a purposely blurred location such as a circular or rectangular geographic region instead of their exact position. This strategy makes it possible for privacy protection, but presents problems in query processing. Since the server does not know a user's exact position, it has to retrieve query results for each position inside the user's cloaking region. While the server workload dramatically increases, a client downloading all query results will waste its battery power, because most of the data may be irrelevant to its query interest. This paper considers the problems of efficient processing of location-cloaked queries (LCQs). Our key observation is that queries may overlap in their cloaking regions and thus share some query results. In light of this, we propose to process queries as a batch instead of one by one independently. The technical contributions of this paper are threefold. 1) We propose to decompose queries into subqueries based on their interested region. Since the subqueries with a common region need to be processed only once, the server workload is minimized. 2) We propose a novel scheduling technique that addresses the dilemma between minimizing server latency and ensuring good fairness in query processing. 3) We present a personalized air indexing technique by which a client can filter out and download only the needed query results, thus avoiding the waste of energy in downloading irrelevant data.
Location-based services (LBSs) have become a profitable market because they offer real-time and local information to their users. Although several benefits are obtained from the usage of LBSs, they have opened up many privacy and safety challenges because a user needs to release his/her location. To tackle these challenges, many location-cloaking techniques have been proposed. Even though these solutions are effective in protecting either location privacy or location safety, they do not provide unified protection. Furthermore, most of them do not address the potential bottleneck in the anonymity server as a high demand of location and safety protection is requested. Finally, they do not take into account the potential impact of processing a large amount of location-cloaked queries. This paper deals with the efficient construction of location-cloaking areas for many users, who have both privacy and safety requirements. To achieve this goal, the construction of location-cloaking areas is carried out in batches. The LBSs’ batch processing takes advantage of users who are close to each other and who have similar requirements. Two batching techniques to build cloaking regions are analyzed using simulations. Empirical results show our techniques are able to balance the anonymizer workload, quality of location privacy and safety protection, and LBS workload.
A spatial monitoring query (SMQ) retrieves the set of mobile nodes that satisfy some spatial constraints, and provides real-time updates whenever this set of nodes changes. Efficient processing of such queries is essential to moving objects database management. Existing techniques rely on one or more central servers for query management and assume each mobile node can communicate with some server directly. These limitations prevent them from being used in application scenarios where no such server exists. This paper assumes a mobile peer-to-peer system where mobile nodes are the only computing devices, and investigates the challenges of allowing mobile nodes to collaborate in query processing. We present a cost-effective technique to process a primitive type of SMQs and then show that other types of queries can be converted into the primitive type of queries. As such, different types of queries can now be supported within a common platform and without relying on any stationary server. We also evaluate, through both mathematical analysis and simulation, the performance of the proposed platform in terms of mobile communication costs incurred in query processing.
This paper focuses on adopting cybersecurity procedures in Chilean manufacturing companies in the context of the Fourth Industrial Revolution’s data-driven demands, which have exposed vulnerabilities in cybersecurity. This analysis is based on data from the Fifth Longitudinal Survey of Companies - ELE 5 - conducted by the National Institute of Statistics. Using the TOE adoption model, we employ binary and ordered Logit and Probit models with data from 574 companies and 17 explanatory variables. The objective is to gain insight into the factors influencing the adoption of cybersecurity processes, complementing the existing literature, which often focuses on developing specific technologies or conducting comprehensive analyses of digital transformation. The study highlights the significance of company size in explaining the adoption of cybersecurity procedures and reveals the relevance of explanatory variables as the depth of adoption increases. The findings underscore the need for public policies that facilitate the implementation of existing regulations, such as ISO 27.001, particularly for small companies. Additionally, the study emphasizes the importance of fostering a "culture of cybersecurity" across different sectors of society.
Dempster–Shafer theory (DST), a generalization of probability theory, is well suited for managing uncertainty and integrating information from diverse sources. In recent years, DST has gained attention in cybersecurity research. However, despite the growing interest, there is still a lack of systematic comparisons of DST implementation strategies for malware detection. In this paper, we present a comprehensive evaluation of DST-based ensemble mechanisms for malware detection, addressing critical methodological questions regarding optimal mass function construction and combination rules. Our systematic analysis was tested with 630,504 benign and malicious samples collected from four public datasets (BODMAS, DREBIN, AndroZoo, and BMPD) to train malware detection models. We explored three approaches for converting classifier outputs into probability mass functions: global confidence using fixed values derived from performance metrics, class-specific confidence with separate values for each class, and computationally optimized confidence values. The results establish that all approaches yield comparable performance, although fixed values offer significant computational and interpretability advantages. Additionally, we introduced a novel linear combination rule for evidence fusion, which delivers results on par with conventional DST rules while enhancing interpretability. Our experiments show consistently low false positive rates—ranging from 0.16% to 3.19%. This comprehensive study provides the first systematic methodology comparison for DST-based malware detection, establishing evidence-based guidelines for practitioners on optimal implementation strategies.
About Me
Patricio Galdames received his B.Eng. in electrical engineering from the Universidad de Chile in 1998 and earned his M.S. and Ph.D. in Computer Science from Iowa State University, Ames, Iowa, USA, in 2008 and 2012, respectively. From 2013 to 2023, he was a full-time faculty member in the Department of Information Systems and a member of the Research Group on Intelligent Industry and Complex Systems (Giscom) at the Universidad del Bio-Bio. Since August 2023, he has been a Part-Time Lecturer and Researcher at the Universidad San Sebastian, Concepcion, Chile. His research interests include mobile computing, machine learning, data privacy, and cybersecurity.
Patricio Galdames received his B.Eng. in electrical engineering from the Universidad de Chile in 1998 and earned his M.S. and Ph.D. in Computer Science from Iowa State University, Ames, Iowa, USA, in 2008 and 2012, respectively. From 2013 to 2023, he was a full-time faculty member in the Department of Information Systems and a member of the Research Group on Intelligent Industry and Complex Systems (Giscom) at the Universidad del Bio-Bio. Since August 2023, he has been a Part-Time Lecturer and Researcher at the Universidad San Sebastian, Concepcion, Chile. His research interests include mobile computing, machine learning, data privacy, and cybersecurity.