Private Set Intersection for multi-document search
Event details
| Date | 31.07.2018 |
| Hour | 10:00 › 12:00 |
| Speaker | Kasra Edalatnejadkhamene |
| Location | |
| Category | Conferences - Seminars |
EDIC candidacy exam
Exam president: Prof. Bryan Ford
Thesis advisor: Prof. Carmela Troncoso
Co-examiner: Prof. Jean-Pierre Hubaux
Abstract
The private set intersection is a well-known problem with a wide variety of use cases from sharing intelligence between security agencies to location-based applications. A PSI protocol allows two parties to compute the intersection of their data without revealing any information about the non-mutual elements. This security comes at the price of extra communication and computation which can be prohibitive for large-scale systems.
In this paper, we study the different approaches to build a PSI and how to expand it to an unbalanced client-server scenario where a thin client can ask several queries from a server. Finally, we provide some insight on how to efficiently expand the client-server PSI to support a server with a large number of sets which can be used as a building block for privacy-preserving document search.
Background papers
Fast and private computation of cardinality of set intersection and union, by De Cristofaro, E., et al.
Private Set Intersection for Unequal Set Sizes with Mobile Applications, by Kiss, A., et al.
Practical Private Set Intersection Protocols, by De Cristofaro, E., et Tsudik, G.
Exam president: Prof. Bryan Ford
Thesis advisor: Prof. Carmela Troncoso
Co-examiner: Prof. Jean-Pierre Hubaux
Abstract
The private set intersection is a well-known problem with a wide variety of use cases from sharing intelligence between security agencies to location-based applications. A PSI protocol allows two parties to compute the intersection of their data without revealing any information about the non-mutual elements. This security comes at the price of extra communication and computation which can be prohibitive for large-scale systems.
In this paper, we study the different approaches to build a PSI and how to expand it to an unbalanced client-server scenario where a thin client can ask several queries from a server. Finally, we provide some insight on how to efficiently expand the client-server PSI to support a server with a large number of sets which can be used as a building block for privacy-preserving document search.
Background papers
Fast and private computation of cardinality of set intersection and union, by De Cristofaro, E., et al.
Private Set Intersection for Unequal Set Sizes with Mobile Applications, by Kiss, A., et al.
Practical Private Set Intersection Protocols, by De Cristofaro, E., et Tsudik, G.
Practical information
- General public
- Free
Contact
- EDIC - [email protected]