Chenxi Qiu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chenxi Qiu has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Xinpeng Xie
University of North Texas, Denton, USA
4 shared publications - Yan Huang
Department of Computer Science and Engineering, University of North Texas, Denton, Texas, USA
4 shared publications - Chenyang Yu
University of North Texas, Texas, Texas, USA
3 shared publications - Anna Squicciarini
Pennsylvania State University
2 shared publications - Haiying Shen
Department of Computer Science, University of Virginia, Charlottesville, VA, USA
2 shared publications - Ruiyao Liu
University of North Texas, Denton, Texas, USA
2 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1955-1969
A Graph-Based Framework for Extending Metric Differential Privacy Mechanisms
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1955-1969
Open AccessA Graph-Based Framework for Extending Metric Differential Privacy Mechanisms
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1290-1304
PA n DA: Rethinking Metric Differential Privacy Optimization at Scale with Anchor-Based Approximation
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1290-1304
Open AccessPA n DA: Rethinking Metric Differential Privacy Optimization at Scale with Anchor-Based Approximation
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1158-1161
EfficientLocNet: High-Performance and Lightweight Radio Source Localization with Multi-Scale Attention
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1158-1161
Open AccessEfficientLocNet: High-Performance and Lightweight Radio Source Localization with Multi-Scale Attention
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 620-630
FUSE-Traffic: Fusion of Unstructured and Structured data for Event-aware Traffic forecasting
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 620-630
Open AccessFUSE-Traffic: Fusion of Unstructured and Structured data for Event-aware Traffic forecasting
- Open Access
- 1 April 2025
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2025 (2) , 5-22
Time-Efficient Locally Relevant Geo-Location Privacy Protection
Geo-obfuscation serves as a location privacy protection mechanism (LPPM), enabling mobile users to share obfuscated locations with servers, rather than their exact locations. This method can protect users’ location privacy when data breaches occur on the server side since the obfuscation process is irreversible. To reduce the utility loss caused by data obfuscation, linear programming (LP) is widely employed, which, however, might suffer from a polynomial explosion of decision variables, rendering it impractical in largescale geo-obfuscation applications. In this paper, we propose a new LPPM, called Locally Relevant Geo-obfuscation (LR-Geo), to optimize geo-obfuscation using LP in a time-efficient manner. This is achieved by confining the geoobfuscation calculation for each user exclusively to the locally relevant (LR) locations to the user’s actual location. Given the potential risk of LR locations disclosing a user’s actual whereabouts, we enable users to compute the LP coefficients locally and upload them only to the server, rather than the LR locations. The server then solves the LP problem based on the received coefficients. Furthermore, we refine the LP framework by incorporating an exponential obfuscation mechanism to guarantee the indistinguishability of obfuscation distribution across multiple users. Based on the constraint structure of the LP formulation, we apply Benders’ decomposition to further enhance computational efficiency. Our theoretical analysis confirms that, despite the geo-obfuscation being calculated independently for each user, it still meets geo-indistinguishability constraints across multiple users with high probability. Finally, the experimental results based on a real-world dataset demonstrate that LR-Geo outperforms existing geo-obfuscation methods in computational time, data utility, and privacy preservation.
- 1 April 2025
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2025 (2) , 5-22
Open AccessTime-Efficient Locally Relevant Geo-Location Privacy Protection
Geo-obfuscation serves as a location privacy protection mechanism (LPPM), enabling mobile users to share obfuscated locations with servers, rather than their exact locations. This method can protect users’ location privacy when data breaches occur on the server side since the obfuscation process is irreversible. To reduce the utility loss caused by data obfuscation, linear programming (LP) is widely employed, which, however, might suffer from a polynomial explosion of decision variables, rendering it impractical in largescale geo-obfuscation applications. In this paper, we propose a new LPPM, called Locally Relevant Geo-obfuscation (LR-Geo), to optimize geo-obfuscation using LP in a time-efficient manner. This is achieved by confining the geoobfuscation calculation for each user exclusively to the locally relevant (LR) locations to the user’s actual location. Given the potential risk of LR locations disclosing a user’s actual whereabouts, we enable users to compute the LP coefficients locally and upload them only to the server, rather than the LR locations. The server then solves the LP problem based on the received coefficients. Furthermore, we refine the LP framework by incorporating an exponential obfuscation mechanism to guarantee the indistinguishability of obfuscation distribution across multiple users. Based on the constraint structure of the LP formulation, we apply Benders’ decomposition to further enhance computational efficiency. Our theoretical analysis confirms that, despite the geo-obfuscation being calculated independently for each user, it still meets geo-indistinguishability constraints across multiple users with high probability. Finally, the experimental results based on a real-world dataset demonstrate that LR-Geo outperforms existing geo-obfuscation methods in computational time, data utility, and privacy preservation.
- Open Access
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 29-41
Protecting Vehicle Location Privacy with Contextually-Driven Synthetic Location Generation
Geo-obfuscation is a Location Privacy Protection Mechanism used in location-based services that allows users to report obfuscated locations instead of exact ones. A formal privacy criterion, geoindistinguishability (Geo-Ind), requires real locations to be hard to distinguish from nearby locations (by attackers) based on their obfuscated representations. However, Geo-Ind often fails to consider context, such as road networks and vehicle traffic conditions, making it less effective in protecting the location privacy of vehicles, of which the mobility are heavily influenced by these factors. In this paper, we introduce VehiTrack, a new threat model to demonstrate the vulnerability of Geo-Ind in protecting vehicle location privacy from context-aware inference attacks. Our experiments demonstrate that VehiTrack can accurately determine exact vehicle locations from obfuscated data, reducing average inference errors by 61.20% with Laplacian noise and 47.35% with linear programming (LP) compared to traditional Bayesian attacks. By using contextual data like road networks and traffic flow, VehiTrack effectively eliminates a significant number of seemingly "impossible" locations during its search for the actual location of the vehicles. Based on these insights, we propose TransProtect, a new geo-obfuscation approach that limits obfuscation to realistic vehicle movement patterns, complicating attackers' ability to differentiate obfuscated from actual locations. Our results show that TransProtect increases VehiTrack's inference error by 57.75% with Laplacian noise and 27.21% with LP, significantly enhancing protection against these attacks.
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 29-41
Open AccessProtecting Vehicle Location Privacy with Contextually-Driven Synthetic Location Generation
Geo-obfuscation is a Location Privacy Protection Mechanism used in location-based services that allows users to report obfuscated locations instead of exact ones. A formal privacy criterion, geoindistinguishability (Geo-Ind), requires real locations to be hard to distinguish from nearby locations (by attackers) based on their obfuscated representations. However, Geo-Ind often fails to consider context, such as road networks and vehicle traffic conditions, making it less effective in protecting the location privacy of vehicles, of which the mobility are heavily influenced by these factors. In this paper, we introduce VehiTrack, a new threat model to demonstrate the vulnerability of Geo-Ind in protecting vehicle location privacy from context-aware inference attacks. Our experiments demonstrate that VehiTrack can accurately determine exact vehicle locations from obfuscated data, reducing average inference errors by 61.20% with Laplacian noise and 47.35% with linear programming (LP) compared to traditional Bayesian attacks. By using contextual data like road networks and traffic flow, VehiTrack effectively eliminates a significant number of seemingly "impossible" locations during its search for the actual location of the vehicles. Based on these insights, we propose TransProtect, a new geo-obfuscation approach that limits obfuscation to realistic vehicle movement patterns, complicating attackers' ability to differentiate obfuscated from actual locations. Our results show that TransProtect increases VehiTrack's inference error by 57.75% with Laplacian noise and 27.21% with LP, significantly enhancing protection against these attacks.
- Open Access
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 384-395
Harnessing LLMs for Cross-City OD Flow Prediction
Understanding and predicting Origin-Destination (OD) flows is crucial for urban planning and transportation management. Traditional OD prediction models, while effective within single cities, often face limitations when applied across different cities due to varied traffic conditions, urban layouts, and socio-economic factors. In this paper, by employing Large Language Models (LLMs), we introduce a new method for cross-city OD flow prediction. Our approach leverages the advanced semantic understanding and contextual learning capabilities of LLMs to bridge the gap between cities with different characteristics, providing a robust and adaptable solution for accurate OD flow prediction that can be transferred from one city to another. Our novel framework involves four major components: collecting OD training datasets from a source city, instruction-tuning the LLMs, predicting destination POIs in a target city, and identifying the locations that best match the predicted destination POIs. We introduce a new loss function that integrates POI semantics and trip distance during training. By extracting high-quality semantic features from human mobility and POI data, the model understands spatial and functional relationships within urban spaces and captures interactions between individuals and various POIs. Extensive experimental results demonstrate the superiority of our approach over the state-of-the-art learning-based methods in cross-city OD flow prediction.
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 384-395
Open AccessHarnessing LLMs for Cross-City OD Flow Prediction
Understanding and predicting Origin-Destination (OD) flows is crucial for urban planning and transportation management. Traditional OD prediction models, while effective within single cities, often face limitations when applied across different cities due to varied traffic conditions, urban layouts, and socio-economic factors. In this paper, by employing Large Language Models (LLMs), we introduce a new method for cross-city OD flow prediction. Our approach leverages the advanced semantic understanding and contextual learning capabilities of LLMs to bridge the gap between cities with different characteristics, providing a robust and adaptable solution for accurate OD flow prediction that can be transferred from one city to another. Our novel framework involves four major components: collecting OD training datasets from a source city, instruction-tuning the LLMs, predicting destination POIs in a target city, and identifying the locations that best match the predicted destination POIs. We introduce a new loss function that integrates POI semantics and trip distance during training. By extracting high-quality semantic features from human mobility and POI data, the model understands spatial and functional relationships within urban spaces and captures interactions between individuals and various POIs. Extensive experimental results demonstrate the superiority of our approach over the state-of-the-art learning-based methods in cross-city OD flow prediction.
- Open Access
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 3, 1927-1935
Wave-wise Discriminative Tracking by Phase-Amplitude Separation, Augmentation and Mixture
Distinguishing key features in complex visual tasks is challenging. A novel approach treats image patches (tokens) as waves. By using both phase and amplitude, it captures richer semantics and specific invariances compared to pixel-based methods, and allows for feature fusion across regions for a holistic image representation. Based on this, we propose the Wave-wise Discriminative Transformer Tracker (WDT). During tracking, WDT represents features via phase-amplitude separation, enhancement, and mixture. First, we designed a Mutual Exclusive Phase-Amplitude Extractor (MEPAE) to separate phase and amplitude features with distinct semantics, representing spatial target info and background brightness respectively. Then, Wave-wise Feature Augmentation is carried out with two submodules: Phase-Amplitude Feature Augmentation and Mixture. The augmentation module disrupts the separated features in the same batch, and the mixture module recombines them to generate positive and negative waves. The original features are aggregated into the original wave. Positive waves have the same phase but different amplitudes, and negative waves have different phase components. Finally, self-supervised and tracking-supervised losses guide the global and local representation learning for original, positive, and negative waves, enhancing wave-level discrimination. Experiments on five benchmarks prove the effectiveness of our method.
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 3, 1927-1935
Open AccessWave-wise Discriminative Tracking by Phase-Amplitude Separation, Augmentation and Mixture
Distinguishing key features in complex visual tasks is challenging. A novel approach treats image patches (tokens) as waves. By using both phase and amplitude, it captures richer semantics and specific invariances compared to pixel-based methods, and allows for feature fusion across regions for a holistic image representation. Based on this, we propose the Wave-wise Discriminative Transformer Tracker (WDT). During tracking, WDT represents features via phase-amplitude separation, enhancement, and mixture. First, we designed a Mutual Exclusive Phase-Amplitude Extractor (MEPAE) to separate phase and amplitude features with distinct semantics, representing spatial target info and background brightness respectively. Then, Wave-wise Feature Augmentation is carried out with two submodules: Phase-Amplitude Feature Augmentation and Mixture. The augmentation module disrupts the separated features in the same batch, and the mixture module recombines them to generate positive and negative waves. The original features are aggregated into the original wave. Positive waves have the same phase but different amplitudes, and negative waves have different phase components. Finally, self-supervised and tracking-supervised losses guide the global and local representation learning for original, positive, and negative waves, enhancing wave-level discrimination. Experiments on five benchmarks prove the effectiveness of our method.
- Open Access
Enhancing Scalability of Metric Differential Privacy via Secret Dataset Partitioning and Benders Decomposition
Metric Differential Privacy (mDP) extends the concept of Differential Privacy (DP) to serve as a new paradigm of data perturbation. It is designed to protect secret data represented in general metric space, such as text data encoded as word embeddings or geo-location data on the road network or grid maps. To derive an optimal data perturbation mechanism under mDP, a widely used method is linear programming (LP), which, however, might suffer from a polynomial explosion of decision variables, rendering it impractical in large-scale mDP. In this paper, our objective is to develop a new computation framework to enhance the scalability of the LP-based mDP. Considering the connections established by the mDP constraints among the secret records, we partition the original secret dataset into various subsets. Building upon the partition, we reformulate the LP problem for mDP and solve it via Benders Decomposition, which is composed of two stages: (1) a master program to manage the perturbation calculation across subsets and (2) a set of subproblems, each managing the perturbation derivation within a subset. Our experimental results on multiple datasets, including geo-location data in the road network/grid maps, text data, and synthetic data, underscore our proposed mechanism's superior scalability and efficiency.
Open AccessEnhancing Scalability of Metric Differential Privacy via Secret Dataset Partitioning and Benders Decomposition
Metric Differential Privacy (mDP) extends the concept of Differential Privacy (DP) to serve as a new paradigm of data perturbation. It is designed to protect secret data represented in general metric space, such as text data encoded as word embeddings or geo-location data on the road network or grid maps. To derive an optimal data perturbation mechanism under mDP, a widely used method is linear programming (LP), which, however, might suffer from a polynomial explosion of decision variables, rendering it impractical in large-scale mDP. In this paper, our objective is to develop a new computation framework to enhance the scalability of the LP-based mDP. Considering the connections established by the mDP constraints among the secret records, we partition the original secret dataset into various subsets. Building upon the partition, we reformulate the LP problem for mDP and solve it via Benders Decomposition, which is composed of two stages: (1) a master program to manage the perturbation calculation across subsets and (2) a set of subproblems, each managing the perturbation derivation within a subset. Our experimental results on multiple datasets, including geo-location data in the road network/grid maps, text data, and synthetic data, underscore our proposed mechanism's superior scalability and efficiency.
- 18 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (12) , 10172-10189
Brake-Signal-Based Driver’s Location Tracking in Usage-Based Auto Insurance Programs
In this article, we demonstrate that by using a temporal sequence of applied brake signals collected from a vehicle, attackers can still possibly infer the vehicle’s route over the period, even though brake-signal data does not reveal any specific location information. Our route inference is basically composed of three steps. At first, we categorize brake-signal subsequences into four different driving maneuvers (i.e., stopping from a certain speed, reducing speed to adjust with the traffic flow, and taking left and right turns). Second, we estimate the number of intersections traversed by the vehicle using the applied brake signals and their corresponding maneuvers. Finally, we design a graph-based route-selection algorithm to find a list of (paths) routes from the regional map using the predicted driving maneuvers and the speed profile. We evaluate our approach using over 450 km of transportation data, which has been collected from 25 individuals. The experimental results demonstrate that, by resorting to our solution, 92.04% of the original drivers’ trajectory can be successfully recovered from their brake data regardless of driver and vehicle models.
- 18 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (12) , 10172-10189
Brake-Signal-Based Driver’s Location Tracking in Usage-Based Auto Insurance Programs
In this article, we demonstrate that by using a temporal sequence of applied brake signals collected from a vehicle, attackers can still possibly infer the vehicle’s route over the period, even though brake-signal data does not reveal any specific location information. Our route inference is basically composed of three steps. At first, we categorize brake-signal subsequences into four different driving maneuvers (i.e., stopping from a certain speed, reducing speed to adjust with the traffic flow, and taking left and right turns). Second, we estimate the number of intersections traversed by the vehicle using the applied brake signals and their corresponding maneuvers. Finally, we design a graph-based route-selection algorithm to find a list of (paths) routes from the regional map using the predicted driving maneuvers and the speed profile. We evaluate our approach using over 450 km of transportation data, which has been collected from 25 individuals. The experimental results demonstrate that, by resorting to our solution, 92.04% of the original drivers’ trajectory can be successfully recovered from their brake data regardless of driver and vehicle models.