Events Calendar

PhD Preliminary Oral Exam – Thi Ni Ni Trieu

Efficient Private Matching for Private Databases

Private matching (PM) is a key cryptographic primitive in secure computation that allows several parties to jointly compute some functions depending on their private inputs matched in some way. Indeed, this primitive has many practical applications. For instance, in online advertising, two companies may wish to find their common customers for a joint marketing campaign. In this scenario, privacy is of utmost importance and it is imperative to ensure that neither company can learn more than their own data and the results of the match. In recent years, secure computation in general and PM in particular has attracted considerable attention from the research community, partly due to the rise of Big Data along with the ever-increasing privacy concerns. This proposal summarizes my research so far, which has made significant contributions to the PM literature. We also discuss our future work and identify new directions considering both theoretical and practical aspects in relevant settings.

Major Advisor: Mike Rosulek
Committee: Rakesh Bobba
Committee: Glencora Borradaile
Committee: Vladimir Kolesnikov
GCR: Oksana Ostroverkhova

Wednesday, December 5, 2018 at 1:30pm to 3:30pm

Kelley Engineering Center, 1114
110 SW Park Terrace, Corvallis, OR 97331

Event Type

Lecture or Presentation

Event Topic


College of Engineering, Electrical Engineering and Computer Science
Contact Name

Calvin Hughes

Contact Email

Google Calendar iCal Outlook

Recent Activity