Child pages
  • Prof. Benny Pinkas visit (August 2015)
Skip to end of metadata
Go to start of metadata

Prof. Benny Pinkas from Bar Ilan University is visitng the Aalto Secure Systems Group during August 2015. His visit is supported by the Aalto Science Institute and the CloSe project.  During his visit, Benny will give two public talks.


Talk 1: 
Title: "Private Set Intersection"
Tue, August 11, 1:15pm – 2:15pm
T2 Auditorium, CS building, konemiehentie 2, Espoo

Abstract: Private set intersection (PSI) allows two parties to compute the intersection of their sets without revealing any information about items that are not in the intersection. PSI is relevant in many scenarios of secure computation, such as data sharing or contact discovery. PSI is one of the best studied applications of secure computation and many different PSI protocols have been proposed, using a wide and interesting variety of cryptographic tools. However, existing PSI protocols do not scale up well, and therefore some applications use insecure solutions instead. This talk will survey what we believe to be the most interesting PSI protocols, describe new approaches for designing PSI protocols, and present a performance comparison. Joint work with Thomas Sander, Gel Segev, and Michael Zohner. Bio: Benny Pinkas is an associate professor at Bar Ilan University. He has previously worked in the research labs of Intertrust Technologies, Hewlett-Packard, and Google. His main research areas are cryptography, computer security and privacy, with a focus on secure computation. He has published over 60 highly cited academic publications. He received a starting grant from the ERC, as well as grants from the Israel Science Foundation, the Israel-US Binational research foundation, and the Israel Ministry of Science and Technology, and was a PI in two European research consortiums.

Talk 2:  
Title: "Secure multi-party computation"
Wed, August 19, 11am – 12pm
Seminar lounge 3161 in TUAS building

Abstract: Secure multi-party computation enables different parties with private inputs to compute joint functions of these inputs while hiding everything but the output of the function. As a simple example, consider two parties with private values that wish to compute which of these values is greater while hiding all other information about the values. In recent years there has great progress in the performance of secure multi-party computation, and considerable interest in using this technology for different applications. The talk will describe the basic concepts of secure multi-party computation, as well as different techniques that are used to improve performance, and applications that benefit from this technology.

  • No labels