Scholarlink

This paper presents a structured location privacy query mechanism based on Fully Homomorphic Encryption (FHE), aiming to support secure, precise, and scalable Location-Based Services (LBS). The proposed scheme encodes multi-level location identifiers into ciphertext matrices and performs encrypted matching operations using GPU-accelerated parallel computation. Comparative evaluations are conducted against classical approaches such as k-anonymity, differential privacy, Paillier encryption, secure multi-party computation (SMPC), and blockchain-based smart contracts. Experimental results demonstrate that the proposed FHE+GPU scheme achieves a favorable balance between privacy strength, query accuracy, and system scalability, making it suitable for high-security, concurrent, and real-time location query applications, achieving millisecond-level matching speed for tens of thousands of ciphertexts and demonstrating significant speed advantages.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A High-Precision and Scalable Location Privacy Query System Based on FHE

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Lan Ma,
  • Xiaodong Li,
  • Anxu Fu,
  • Yuan Cui,
  • Yimeng Dou,
  • Ruoyun Zhao,
  • Li Guan

摘要

This paper presents a structured location privacy query mechanism based on Fully Homomorphic Encryption (FHE), aiming to support secure, precise, and scalable Location-Based Services (LBS). The proposed scheme encodes multi-level location identifiers into ciphertext matrices and performs encrypted matching operations using GPU-accelerated parallel computation. Comparative evaluations are conducted against classical approaches such as k-anonymity, differential privacy, Paillier encryption, secure multi-party computation (SMPC), and blockchain-based smart contracts. Experimental results demonstrate that the proposed FHE+GPU scheme achieves a favorable balance between privacy strength, query accuracy, and system scalability, making it suitable for high-security, concurrent, and real-time location query applications, achieving millisecond-level matching speed for tens of thousands of ciphertexts and demonstrating significant speed advantages.