Vector databases deployed in untrusted environments face significant security risks. However, existing privacy-preserving similarity search methods often either overlook result integrity or perform poorly on high-dimensional data. We propose VEkNN, a probabilistically verifiable k-nearest neighbor framework for encrypted high-dimensional vectors, which achieves verifiability by constructing an LSH-based authentication index. VEkNN features a two-phase verification protocol: (1)completeness verification via pseudo-vector insertion and LSH bucket checking, and (2)correctness verification using order-preserving distance comparison and digital signatures. To demonstrate its practical applicability, we implement a web-based prototype that verifies query result integrity and detects server-side data tampering.

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

VEkNN: Verifiable and Encrypted kNN Search over High-Dimensional Vectors

  • Jiahui Pan,
  • Zhaokang Wang

摘要

Vector databases deployed in untrusted environments face significant security risks. However, existing privacy-preserving similarity search methods often either overlook result integrity or perform poorly on high-dimensional data. We propose VEkNN, a probabilistically verifiable k-nearest neighbor framework for encrypted high-dimensional vectors, which achieves verifiability by constructing an LSH-based authentication index. VEkNN features a two-phase verification protocol: (1)completeness verification via pseudo-vector insertion and LSH bucket checking, and (2)correctness verification using order-preserving distance comparison and digital signatures. To demonstrate its practical applicability, we implement a web-based prototype that verifies query result integrity and detects server-side data tampering.