30 October 2007
Javier Herranz

In this seminar we will show some examples of how cryptography can be used to provide privacy to a variety of protocols. In the first part of the talk, we will recall the basic concepts of public key cryptography, focusing on the primitive of 'homomorphic encryption'. We will explain ElGamal cryptosystem as an example. Then, in the second part, we will sketch three protocols where privacy for (some of) the players is obtained via homomorphic encryption: (1) electronic voting, (2) private information retrieval, and (3) private stable matching.