BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Private Set Intersection for multi-document search
DTSTART:20180731T100000
DTEND:20180731T120000
DTSTAMP:20260407T034457Z
UID:e9c53b135c2f0bf5188d0805ea04ec80d570a9d7a92c3311aa7eaead
CATEGORIES:Conferences - Seminars
DESCRIPTION:Kasra Edalatnejadkhamene \nEDIC candidacy exam\nExam presiden
 t: Prof. Bryan Ford\nThesis advisor: Prof. Carmela Troncoso\nCo-examiner: 
 Prof. Jean-Pierre Hubaux\n\nAbstract\nThe private set intersection is a we
 ll-known problem with a wide variety of use cases from sharing intelligenc
 e between security agencies to location-based applications. A PSI protocol
  allows two parties to compute the intersection of their data without reve
 aling any information about the non-mutual elements. This security comes a
 t the price of extra communication and computation which can be prohibitiv
 e for large-scale systems.\n\nIn this paper\, we study the different appro
 aches to build a PSI and how to expand it to an unbalanced client-server s
 cenario 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.\n\nBackground pape
 rs\nFast and private computation of cardinality of set intersection and un
 ion\, by De Cristofaro\, E.\, et al.\nPrivate Set Intersection for Unequal
  Set Sizes with Mobile Applications\, by Kiss\, A.\, et al.\nPractical Pri
 vate Set Intersection Protocols\, by De Cristofaro\, E.\, et Tsudik\, G.\n
  
LOCATION:BC 229 https://plan.epfl.ch/?room==BC%20229
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR