Skip to main navigation Skip to Content

Computer Science

University of Toronto
  • U of T Portal
  • Site Map
  • Contact
  • About DCS At U of T
    • Why Study CS at U of T
    • Career Options
    • History of DCS
    • Giving to DCS
    • Information for Prospective Undergraduate Students
    • Information for Prospective Graduate Students
    • Computer Science at UofT Mississauga
    • Computer Science at UofT Scarborough
    • Contact
  • Programs & Courses
    • Prospective Undergraduate Students
    • Current Undergraduate Students
    • Prospective Graduate Students
    • Current Graduate Students
  • Research
    • Research Groups
    • Industrial Relations
    • Research In Action Showcase
    • Research Profiles
    • Research Sponsors & Partners
    • Awards and Accolades
    • UTRECS - Undergraduate Toronto Research Experience in Computer Science
  • Our People
    • Faculty
    • Staff
    • In Memoriam
    • People Profiles
    • Alumni and Friends
    • Women in Computer Science
    • Graduate Student Society
    • Undergraduate Student Union
    • Undergraduate Artificial Intelligence Group
  • News & Events
    • Current News
    • DCS Events Calendar
    • DCS in the Media
    • @dcs Newsletter
    • Undergrad News
    • Distinguished Lecture Series
    • Awards and Accolades
    • DCS Facebook Page
    • DCS Twitter Feed
    • RSS Feed - News
    • RSS Feed - Events
You are viewing: > Home > News & Events > DCS Events Calendar > Theory Seminar - October 7
  • Current News
  • DCS Events Calendar
  • DCS in the Media
  • @dcs Newsletter
  • Undergrad News
  • Distinguished Lecture Series
  • Awards and Accolades
  • DCS Facebook Page
  • DCS Twitter Feed
  • RSS Feed - News
  • RSS Feed - Events

Theory Seminar - October 7

Event date: Friday, October 07, 2011, at 11:10 AM
Location: BA1240

SPEAKER: Vinod Vaikuntanathan
University of Toronto, Dept. of Computer Science

TITLE: Computing Blindfolded: New Developments in Fully Homomorphic Encryption

ABSTRACT:

Is it possible to delegate arbitrarily complex computation on data without giving away access to the data? This problem -- called "fully homomorphic encryption" -- has long been regarded as cryptography's prized holy grail, and calls for the ability to compute on encrypted data without decrypting it and without knowing any secret keys. Starting from Gentry's groundbreaking work, the last three years have witnessed a number of constructions of simpler, faster and stronger fully homomorphic encryption systems, involving novel mathematical techniques, and a number of new and exciting applications. We will tell the story of these developments and provide a glimpse of the exciting research directions that lie ahead.

Note: This is a "first draft" of a FOCS 2010 tutorial, meant to be accessible to a general theory audience.


Computer Science

All rights reserved copyright Computer Science, University of Toronto