YoVDO

Private Nearest Neighbor Search with Sublinear Communication and Malicious Security

Offered By: IEEE via YouTube

Tags

Cryptography Courses Locality-Sensitive Hashing Courses Approximate Nearest Neighbor Search Courses

Course Description

Overview

Explore a conference talk on private nearest neighbor search techniques with sublinear communication and malicious security. Delve into approximate nearest neighbor search, two-party computation, and locality sensitive hashing. Learn about the Strongman protocol, database privacy, radix sorting, and oblivious masking. Examine the evaluation of these methods and engage with questions surrounding this cutting-edge research presented by experts from the Massachusetts Institute of Technology.

Syllabus

Introduction
Approximate Nearest Neighbor Search
TwoParty Computation
locality sensitive hashing
Strongman protocol
Database privacy
Radix sorting
oblivious masking
Evaluation
Questions


Taught by

IEEE Symposium on Security and Privacy

Tags

Related Courses

Applied Cryptography
University of Virginia via Udacity
Cryptography II
Stanford University via Coursera
Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera
Cryptography I
Stanford University via Coursera
Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera