MESS builds multiple HNSW indexes over randomly perturbed binary embeddings to provide differentially private semantic search with near-plaintext accuracy and much lower latency than homomorphic encryption or ORAM baselines.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
MESS: Fast and Private Semantic Search on Multi-Graph HNSW
MESS builds multiple HNSW indexes over randomly perturbed binary embeddings to provide differentially private semantic search with near-plaintext accuracy and much lower latency than homomorphic encryption or ORAM baselines.