Secure Two-Party Computation

When: Tuesday, 2013-Jan-15, 11h30-12h00
Where: FCUL-DI, room C6.3.38
Presenter: Luís Brandão

In this smalltalk, I will describe the goal of Secure Two Party Computation (a cryptographic functionality). As motivation, the audience will solve in practice, without math, two simple problems:

a) Imagine you think of a number between 1 and 5 and your friend also thinks of a number. Both feel embarassed to say your option, but would not mind learning only whether you are thinking of the same number or not. How can you do it?

b) After a first date, a couple would like to know if both like each other. How can they compute just that, without chance of one declaring his/her positive feelings while being rejected by the other? In other words: how to compute the Boolean AND-gate securely?

Based on this, I will motivate more complex applications, e.g., related with privacy of medical data, and ask the audience for ideas of applications where S2PC could bring an added social value.

This entry was posted in Smalltalk. Bookmark the permalink.

Comments are closed.