Versatile and Fast Location-Based Private Information Retrieval with Fully Homomorphic Encryption over the Torus

• URL: http://arxiv.org/abs/2506.12761v1
• Date: Sun, 15 Jun 2025 08:01:35 GMT
• Title: Versatile and Fast Location-Based Private Information Retrieval with Fully Homomorphic Encryption over the Torus
• Authors: Joon Soo Yoo, Taeho Kim, Ji Won Yoon,
• Abstract summary: We present VeLoPIR, a versatile location-based private information retrieval (PIR) system designed to preserve user privacy.<n>VeLoPIR introduces three operational modes-interval validation, coordinate validation, and identifier matching-that support a broad range of real-world applications.<n>We provide formal security and privacy proofs, confirming the system's robustness under standard cryptographic assumptions.
• Score: 4.021179028452984
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Location-based services often require users to share sensitive locational data, raising privacy concerns due to potential misuse or exploitation by untrusted servers. In response, we present VeLoPIR, a versatile location-based private information retrieval (PIR) system designed to preserve user privacy while enabling efficient and scalable query processing. VeLoPIR introduces three operational modes-interval validation, coordinate validation, and identifier matching-that support a broad range of real-world applications, including information and emergency alerts. To enhance performance, VeLoPIR incorporates multi-level algorithmic optimizations with parallel structures, achieving significant scalability across both CPU and GPU platforms. We also provide formal security and privacy proofs, confirming the system's robustness under standard cryptographic assumptions. Extensive experiments on real-world datasets demonstrate that VeLoPIR achieves up to 11.55 times speed-up over a prior baseline. The implementation of VeLoPIR is publicly available at https://github.com/PrivStatBool/VeLoPIR.

Related papers

• CB-cPIR: Code-Based Computational Private Information Retrieval [9.054540533394928]
  We present CB-cPIR, a single-server code-based computational private information retrieval scheme that derives security from code-based cryptography.<n>The scheme is heavily inspired by the pioneering code-based cPIR scheme proposed by Holzbaur, Hollanti, and Wachter-Zeh.
  arXiv  Detail & Related papers  (2025-05-06T10:34:44Z)
• Fast Private Location-based Information Retrieval Over the Torus [2.0680208842600454]
  LocPIR preserves user location privacy when retrieving data from public clouds. System employs TFHE's expertise in non-polynomial evaluations.
  arXiv  Detail & Related papers  (2024-07-29T10:42:17Z)
• Robust Utility-Preserving Text Anonymization Based on Large Language Models [80.5266278002083]
  Text anonymization is crucial for sharing sensitive data while maintaining privacy. Existing techniques face the emerging challenges of re-identification attack ability of Large Language Models. This paper proposes a framework composed of three LLM-based components -- a privacy evaluator, a utility evaluator, and an optimization component.
  arXiv  Detail & Related papers  (2024-07-16T14:28:56Z)
• PriRoAgg: Achieving Robust Model Aggregation with Minimum Privacy Leakage for Federated Learning [49.916365792036636]
  Federated learning (FL) has recently gained significant momentum due to its potential to leverage large-scale distributed user data.<n>The transmitted model updates can potentially leak sensitive user information, and the lack of central control of the local training process leaves the global model susceptible to malicious manipulations on model updates.<n>We develop a general framework PriRoAgg, utilizing Lagrange coded computing and distributed zero-knowledge proof, to execute a wide range of robust aggregation algorithms while satisfying aggregated privacy.
  arXiv  Detail & Related papers  (2024-07-12T03:18:08Z)
• Large-Scale MPC: Scaling Private Iris Code Uniqueness Checks to Millions of Users [2.0540398980002594]
  biometric verification systems typically require server-side processing of sensitive data. We design a solution that allows us to query whether a given Iris Code is similar to one contained in a given database. All queries and datasets are being protected using secure multiparty computation.
  arXiv  Detail & Related papers  (2024-05-07T16:29:11Z)
• Quantum Private Information Retrieval from Coded Storage Systems [0.0]
  In a Quantum Private Information Retrieval (QPIR) protocol, a user can retrieve information from a database by downloading quantum systems from multiple servers. This thesis aims to develop QPIR protocols for coded storage by combining known classical PIR protocols with quantum communication algorithms.
  arXiv  Detail & Related papers  (2023-12-10T12:36:10Z)
• Systematic Evaluation of Geolocation Privacy Mechanisms [6.356211727228669]
  Location Privacy Preserving Mechanisms (LPPMs) have been proposed by previous works to ensure the privacy of the shared data. We study the sensitivity of LPPMs on the scenario on which they are used.
  arXiv  Detail & Related papers  (2023-09-12T14:23:19Z)
• Sparsity-Aware Intelligent Massive Random Access Control in Open RAN: A Reinforcement Learning Based Approach [61.74489383629319]
  Massive random access of devices in the emerging Open Radio Access Network (O-RAN) brings great challenge to the access control and management. reinforcement-learning (RL)-assisted scheme of closed-loop access control is proposed to preserve sparsity of access requests. Deep-RL-assisted SAUD is proposed to resolve highly complex environments with continuous and high-dimensional state and action spaces.
  arXiv  Detail & Related papers  (2023-03-05T12:25:49Z)
• A Privacy-Preserving Distributed Architecture for Deep-Learning-as-a-Service [68.84245063902908]
  This paper introduces a novel distributed architecture for deep-learning-as-a-service. It is able to preserve the user sensitive data while providing Cloud-based machine and deep learning services.
  arXiv  Detail & Related papers  (2020-03-30T15:12:03Z)
• Taurus: A Data Plane Architecture for Per-Packet ML [59.1343317736213]
  We present the design and implementation of Taurus, a data plane for line-rate inference. Our evaluation of a Taurus switch ASIC shows that Taurus operates orders of magnitude faster than a server-based control plane.
  arXiv  Detail & Related papers  (2020-02-12T09:18:36Z)
• CryptoSPN: Privacy-preserving Sum-Product Network Inference [84.88362774693914]
  We present a framework for privacy-preserving inference of sum-product networks (SPNs) CryptoSPN achieves highly efficient and accurate inference in the order of seconds for medium-sized SPNs.
  arXiv  Detail & Related papers  (2020-02-03T14:49:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.