Patricio Galdames
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Patricio Galdames has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Claudio Gutiérrez-Soto
Universidad del Bío-Bío, Concepción, Chile
9 shared publications - Marco A. Palomino
School of Natural and Computing Sciences, University of Aberdeen, Aberdeen AB24 3UE, UK
4 shared publications - Cristian Duran-Faundez
Departamento de Ingeniería Eléctrica y Electrónica, Universidad del Bío-Bío, Concepción 4051381, Chile
3 shared publications Ying Cai
Department of Computer Science, Iowa State University, Ames, 50011, USA
2 shared publications- Arturo Curiel Diaz
Universidad Veracruzana, Veracruz, México
1 shared publication Carlos Faúndez
Group of Smart Industries and Complex Systems (gISCOM), Universidad del Bío-Bío, Concepción 4051381, Chile
1 shared publication
Latest Publications
- Open Access
- 28 December 2025
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 31 (14) , 1717-1740
A Descriptive and Predictive Model for Data-Driven Decision Making in Higher Education: A Case Study
The growth of online learning in higher education, particularly after the COVID-19 pandemic, has fostered the advancement of learning analytics, which nowadays relies greatly on capturing and mining data derived from systems such as Blackboard and Moodle. However, it remains difficult to identify all the variables having a direct bearing on academic success, and drawing advice from machine learning models trained to support data-driven decision making is challenging. Therefore, we have endeavoured to pair a descriptive model, which characterises the profiles of computer science students, with a predictive model, which relies on Bayesian networks to forecast academic success. To achieve this, we have looked for the factors directly influencing the academic performance of computing science students, and the common patterns of behaviour which characterise higher education students individually and as part of a cohort. Our approach has been tested with data provided by a Chilean institution—University of Bío-Bío. We have enhanced and supplemented the data employed in our investigation by means of two surveys distributed among all the different cohorts of the student population. Our predictive model can determine student outcomes with an accuracy rate above 97%.
- 28 December 2025
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 31 (14) , 1717-1740
Open AccessA Descriptive and Predictive Model for Data-Driven Decision Making in Higher Education: A Case Study
The growth of online learning in higher education, particularly after the COVID-19 pandemic, has fostered the advancement of learning analytics, which nowadays relies greatly on capturing and mining data derived from systems such as Blackboard and Moodle. However, it remains difficult to identify all the variables having a direct bearing on academic success, and drawing advice from machine learning models trained to support data-driven decision making is challenging. Therefore, we have endeavoured to pair a descriptive model, which characterises the profiles of computer science students, with a predictive model, which relies on Bayesian networks to forecast academic success. To achieve this, we have looked for the factors directly influencing the academic performance of computing science students, and the common patterns of behaviour which characterise higher education students individually and as part of a cohort. Our approach has been tested with data provided by a Chilean institution—University of Bío-Bío. We have enhanced and supplemented the data employed in our investigation by means of two surveys distributed among all the different cohorts of the student population. Our predictive model can determine student outcomes with an accuracy rate above 97%.
- Open Access
- 20 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2677
A Dempster–Shafer, Fusion-Based Approach for Malware Detection
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.
- 20 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2677
Open AccessA Dempster–Shafer, Fusion-Based Approach for Malware Detection
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.
- Open Access
- 14 August 2025
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 31 (9) , 928-945
An Efficient Workload-balancing Algorithm for a Parallel Environment Using Hybrid Spatio-temporal Indexes
In recent years, we have witnessed the proliferation of applications that generate thousands of terabytes of data per day, due to the explosive increase in storage capacity across various devices. As a consequence, a new concept called Data Deluge has emerged. Data deluge refers to the situation where the quantity of data generated exceeds the processing power available, and spatio-temporal data is no exception to this phenomenon. In this context, the efficient processing of spatio-temporal queries becomes crucial to address this challenge, as slow query processing can result in obsolete answers, which may lead to errors. Considering this dynamic context of storage and processing, we explore a new online workload algorithm in a distributed parallel environment using hybrid spatio-temporal indexes. This algorithm is able to update the indexes with the most appropriate data, aiming to achieve more efficient query processing. To measure the efficiency of this algorithm, we present its time complexity along with an empirical evaluation of its performance, considering processing time, number of accessed nodes, and communication costs. The empirical results show a significant reduction in processing time, communication costs, and number of accessed nodes.
- 14 August 2025
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 31 (9) , 928-945
Open AccessAn Efficient Workload-balancing Algorithm for a Parallel Environment Using Hybrid Spatio-temporal Indexes
In recent years, we have witnessed the proliferation of applications that generate thousands of terabytes of data per day, due to the explosive increase in storage capacity across various devices. As a consequence, a new concept called Data Deluge has emerged. Data deluge refers to the situation where the quantity of data generated exceeds the processing power available, and spatio-temporal data is no exception to this phenomenon. In this context, the efficient processing of spatio-temporal queries becomes crucial to address this challenge, as slow query processing can result in obsolete answers, which may lead to errors. Considering this dynamic context of storage and processing, we explore a new online workload algorithm in a distributed parallel environment using hybrid spatio-temporal indexes. This algorithm is able to update the indexes with the most appropriate data, aiming to achieve more efficient query processing. To measure the efficiency of this algorithm, we present its time complexity along with an empirical evaluation of its performance, considering processing time, number of accessed nodes, and communication costs. The empirical results show a significant reduction in processing time, communication costs, and number of accessed nodes.
- Open Access
- 14 November 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (22) , 10480
Collaborative Caching for Implementing a Location-Privacy Aware LBS on a MANET
This paper addresses the challenge of preserving user privacy in location-based services (LBSs) by proposing a novel, complementary approach to existing privacy-preserving techniques such as k-anonymity and l-diversity. Our approach implements collaborative caching strategies within a mobile ad hoc network (MANET), exploiting the geographic of location-based queries (LBQs) to reduce data exposure to untrusted LBS servers. Unlike existing approaches that rely on centralized servers or stationary infrastructure, our solution facilitates direct data exchange between users’ devices, providing an additional layer of privacy protection. We introduce a new privacy entropy-based metric called accumulated privacy loss (APL) to quantify the privacy loss incurred when accessing either the LBS or our proposed system. Our approach implements a two-tier caching strategy: local caching maintained by each user and neighbor caching based on proximity. This strategy not only reduces the number of queries to the LBS server but also significantly enhances user privacy by minimizing the exposure of location data to centralized entities. Empirical results demonstrate that while our collaborative caching system incurs some communication costs, it significantly mitigates redundant data among user caches and reduces the need to access potentially privacy-compromising LBS servers. Our findings show a 40% reduction in LBS queries, a 64% decrease in data redundancy within cells, and a 31% reduction in accumulated privacy loss compared to baseline methods. In addition, we analyze the impact of data obsolescence on cache performance and privacy loss, proposing mechanisms for maintaining the relevance and accuracy of cached data. This work contributes to the field of privacy-preserving LBSs by providing a decentralized, user-centric approach that improves both cache redundancy and privacy protection, particularly in scenarios where central infrastructure is unreachable or untrusted.
- 14 November 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (22) , 10480
Open AccessCollaborative Caching for Implementing a Location-Privacy Aware LBS on a MANET
This paper addresses the challenge of preserving user privacy in location-based services (LBSs) by proposing a novel, complementary approach to existing privacy-preserving techniques such as k-anonymity and l-diversity. Our approach implements collaborative caching strategies within a mobile ad hoc network (MANET), exploiting the geographic of location-based queries (LBQs) to reduce data exposure to untrusted LBS servers. Unlike existing approaches that rely on centralized servers or stationary infrastructure, our solution facilitates direct data exchange between users’ devices, providing an additional layer of privacy protection. We introduce a new privacy entropy-based metric called accumulated privacy loss (APL) to quantify the privacy loss incurred when accessing either the LBS or our proposed system. Our approach implements a two-tier caching strategy: local caching maintained by each user and neighbor caching based on proximity. This strategy not only reduces the number of queries to the LBS server but also significantly enhances user privacy by minimizing the exposure of location data to centralized entities. Empirical results demonstrate that while our collaborative caching system incurs some communication costs, it significantly mitigates redundant data among user caches and reduces the need to access potentially privacy-compromising LBS servers. Our findings show a 40% reduction in LBS queries, a 64% decrease in data redundancy within cells, and a 31% reduction in accumulated privacy loss compared to baseline methods. In addition, we analyze the impact of data obsolescence on cache performance and privacy loss, proposing mechanisms for maintaining the relevance and accuracy of cached data. This work contributes to the field of privacy-preserving LBSs by providing a decentralized, user-centric approach that improves both cache redundancy and privacy protection, particularly in scenarios where central infrastructure is unreachable or untrusted.
- Open Access
- 3 June 2024
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 8 (6) , 59
An Efficient Probabilistic Algorithm to Detect Periodic Patterns in Spatio-Temporal Datasets
Deriving insight from data is a challenging task for researchers and practitioners, especially when working on spatio-temporal domains. If pattern searching is involved, the complications introduced by temporal data dimensions create additional obstacles, as traditional data mining techniques are insufficient to address spatio-temporal databases (STDBs). We hereby present a new algorithm, which we refer to as F1/FP, and can be described as a probabilistic version of the Minus-F1 algorithm to look for periodic patterns. To the best of our knowledge, no previous work has compared the most cited algorithms in the literature to look for periodic patterns—namely, Apriori, MS-Apriori, FP-Growth, Max-Subpattern, and PPA. Thus, we have carried out such comparisons and then evaluated our algorithm empirically using two datasets, showcasing its ability to handle different types of periodicity and data distributions. By conducting such a comprehensive comparative analysis, we have demonstrated that our newly proposed algorithm has a smaller complexity than the existing alternatives and speeds up the performance regardless of the size of the dataset. We expect our work to contribute greatly to the mining of astronomical data and the permanently growing online streams derived from social media.
- 3 June 2024
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 8 (6) , 59
Open AccessAn Efficient Probabilistic Algorithm to Detect Periodic Patterns in Spatio-Temporal Datasets
Deriving insight from data is a challenging task for researchers and practitioners, especially when working on spatio-temporal domains. If pattern searching is involved, the complications introduced by temporal data dimensions create additional obstacles, as traditional data mining techniques are insufficient to address spatio-temporal databases (STDBs). We hereby present a new algorithm, which we refer to as F1/FP, and can be described as a probabilistic version of the Minus-F1 algorithm to look for periodic patterns. To the best of our knowledge, no previous work has compared the most cited algorithms in the literature to look for periodic patterns—namely, Apriori, MS-Apriori, FP-Growth, Max-Subpattern, and PPA. Thus, we have carried out such comparisons and then evaluated our algorithm empirically using two datasets, showcasing its ability to handle different types of periodicity and data distributions. By conducting such a comprehensive comparative analysis, we have demonstrated that our newly proposed algorithm has a smaller complexity than the existing alternatives and speeds up the performance regardless of the size of the dataset. We expect our work to contribute greatly to the mining of astronomical data and the permanently growing online streams derived from social media.
- Open Access
- 28 November 2023
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 29 (11) , 1404-1421
Efficiently Finding Cyclical Patterns on Twitter Considering the Inherent Spatio-temporal Attributes of Data
Social networks such as Twitter provide thousands of terabytes per day, which can be exploited to find relevant information. This relevant information is used to promote marketing strategies, analyze current political issues, and track market trends, to name a few examples. One instance of relevant information is finding cyclic behavior patterns (i.e., patterns that frequently repeat themselves over time) in the population. Because trending topics on Twitter change rapidly, efficient algorithms are required, especially when considering location and time (i.e., the specific location and time) during broadcasts. This article presents an efficient algorithm based on association rules to find cyclical patterns on Twitter, considering the inherent spatio-temporal attributes of data. Using a Hash Table enhances the efficiency of this algorithm, called HashCycle. Notably, HashCycle does not use minimum support and can detect patterns in a single run over a sequence. The processing times of HashCycle were compared to the Apriori (which is a well-known and widely used on diverse platforms) and Projection-based Partial Periodic Patterns (PPA) algorithms (which is one of the most efficient algorithms in terms of processing times). Empirical results from two spatio-temporal databases (a synthetic data set and one based on Twitter) show that HashCycle has more efficient processing times than two state-of-the-art algorithms: Apriori and PPA.
- 28 November 2023
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 29 (11) , 1404-1421
Open AccessEfficiently Finding Cyclical Patterns on Twitter Considering the Inherent Spatio-temporal Attributes of Data
Social networks such as Twitter provide thousands of terabytes per day, which can be exploited to find relevant information. This relevant information is used to promote marketing strategies, analyze current political issues, and track market trends, to name a few examples. One instance of relevant information is finding cyclic behavior patterns (i.e., patterns that frequently repeat themselves over time) in the population. Because trending topics on Twitter change rapidly, efficient algorithms are required, especially when considering location and time (i.e., the specific location and time) during broadcasts. This article presents an efficient algorithm based on association rules to find cyclical patterns on Twitter, considering the inherent spatio-temporal attributes of data. Using a Hash Table enhances the efficiency of this algorithm, called HashCycle. Notably, HashCycle does not use minimum support and can detect patterns in a single run over a sequence. The processing times of HashCycle were compared to the Apriori (which is a well-known and widely used on diverse platforms) and Projection-based Partial Periodic Patterns (PPA) algorithms (which is one of the most efficient algorithms in terms of processing times). Empirical results from two spatio-temporal databases (a synthetic data set and one based on Twitter) show that HashCycle has more efficient processing times than two state-of-the-art algorithms: Apriori and PPA.
- Open Access
- 24 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 133475-133489
Adoption of Cybersecurity in the Chilean Manufacturing Sector: A First Analytical Proposal
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.
- 24 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 133475-133489
Open AccessAdoption of Cybersecurity in the Chilean Manufacturing Sector: A First Analytical Proposal
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.
- Open Access
- 17 May 2022
- Published by Wiley in Mobile Information Systems
- Vol. 2022, 1-22
Location-Query-Privacy and Safety Cloaking Schemes for Continuous Location-Based Services
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.
- 17 May 2022
- Published by Wiley in Mobile Information Systems
- Vol. 2022, 1-22
Open AccessLocation-Query-Privacy and Safety Cloaking Schemes for Continuous Location-Based Services
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.
- Open Access
- 2 January 2019
- Published by Wiley in Mobile Information Systems
- Vol. 2019, 1-11
Batching Location Cloaking Techniques for Location Privacy and Safety Protection
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.
- 2 January 2019
- Published by Wiley in Mobile Information Systems
- Vol. 2019, 1-11
Open AccessBatching Location Cloaking Techniques for Location Privacy and Safety Protection
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.
- Open Access
A Distance Bounding Protocol for Location-Cloaked Applications
Location-based services (LBSs) assume that users are willing to release trustworthy and useful details about their whereabouts. However, many location privacy concerns have arisen. For location privacy protection, several algorithms build a cloaking region to hide a user’s location. However, many applications may not operate adequately on cloaked locations. For example, a traditional distance bounding protocol (DBP)—which is run by two nodes called the prover and the verifier—may conclude an untight and useless distance between these two entities. An LBS (verifier) may use this distance as a metric of usefulness and trustworthiness of the location claimed by the user (prover). However, we show that if a tight distance is desired, traditional DBP can refine a user’s cloaked location and compromise its location privacy. To find a proper balance, we propose a location-privacy-aware DBP protocol. Our solution consists of adding some small delays before submitting any user’s response. We show that several issues arise when a certain delay is chosen, and we propose some solutions. The effectiveness of our techniques in balancing location refinement and utility is demonstrated through simulation.
Open AccessA Distance Bounding Protocol for Location-Cloaked Applications
Location-based services (LBSs) assume that users are willing to release trustworthy and useful details about their whereabouts. However, many location privacy concerns have arisen. For location privacy protection, several algorithms build a cloaking region to hide a user’s location. However, many applications may not operate adequately on cloaked locations. For example, a traditional distance bounding protocol (DBP)—which is run by two nodes called the prover and the verifier—may conclude an untight and useless distance between these two entities. An LBS (verifier) may use this distance as a metric of usefulness and trustworthiness of the location claimed by the user (prover). However, we show that if a tight distance is desired, traditional DBP can refine a user’s cloaked location and compromise its location privacy. To find a proper balance, we propose a location-privacy-aware DBP protocol. Our solution consists of adding some small delays before submitting any user’s response. We show that several issues arise when a certain delay is chosen, and we propose some solutions. The effectiveness of our techniques in balancing location refinement and utility is demonstrated through simulation.