Tianxin Tang - Provably-Secure Approximate k-NN Search Protocol

From Katie Gentilello April 1st, 2021

60 plays 0 comments

This talk examines the problem of privacy-preserving approximate kNN search in an outsourced environment — the client sends the encrypted data to an untrusted server and later can perform secure approximate kNN search and updates. We design a security model and propose a generic construction based on locality-sensitive hashing, symmetric encryption, and an oblivious man. The construction provides very strong security guarantees, not only hiding the information about the data, but also the access, query, and volume patterns.

Tags: institute for information security & privacyschool of cybersecuritygeorgia techcybersecurity lecture seriesspring 2021

name: Tianxin Tang
Date: March 26th, 2021
Appears In: Open Scholarship

Comments
Related Media

Loading…

Tianxin Tang - Provably-Secure Approximate k-NN Search Protocol

Related Media