Hear Vinod Vaikuntanathan speak about the topic of his research, homomorphic encryption, and meet him afterwards over complementary food.
He is the MAT302 instructor at UTM, so if you're taking that course next term or if you're in the Information Security program, this is an excellent opportunity to talk to him.
Abstract:
Is it possible to delegate arbitrarily complex computation on... [read more]
Hear Vinod Vaikuntanathan speak about the topic of his research, homomorphic encryption, and meet him afterwards over complementary food.
He is the MAT302 instructor at UTM, so if you're taking that course next term or if you're in the Information Security program, this is an excellent opportunity to talk to him.
Abstract:
Is it possible to delegate arbitrarily complex computation on data *without*
giving away access to the data? Is it possible to compute on encrypted data
without decrypting it and without knowing any secret keys? These problems
that, at first sight, sound impossible can in fact be tackled using "fully
homomorphic encryption" -- a primitive that was long regarded as
cryptography's prized holy grail.
The last three years have witnessed a number of constructions of simpler,
faster and stronger fully homomorphic encryption systems that make use of
novel mathematical techniques. We will tell the story of these developments
and provide a glimpse of the exciting research directions that lie ahead.
