Fully Homomorphic Encryption

Add to your list(s) Download to your calendar using vCal

• Nigel Smart, University of Bristol
• Friday 05 November 2010, 16:00-17:00
• UG40 Computer Science.

If you have a question about this talk, please contact Paul Levy.

For nearly 30 years one cryptographic dream has been to come up with an encryption scheme for which you can ‘add’ and ‘multiply’ ciphertexts, i.e. a so-called fully homomorphic scheme. Over the years many encryption schemes have been proposed which either have the Add operation or the Multiply operation, but not both. In 2009 Craig Gentry from IBM came up with the first scheme which simulataneously allows you to Add and Multiply ciphertexts. Gentry’s scheme was a major theoretical breakthrough. In this talk I present a way of simplifying Gentry’s scheme so that it becomes more practical.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Theoretical computer science seminar
• UG40 Computer Science
• computer sience

Note that ex-directory lists are not shown.