From: Paul Beame (beame@cs.washington.edu)
Date: Tue Mar 30 2004 - 09:30:36 PST
COLLOQUIUM
SPEAKER: Joe Kilian, NEC Laboratories
TITLE: Achieving Obliviousness - The Theory of Secure Computation
DATE: Tuesday, March 30, 2004
TIME: 3:30 pm
PLACE: EE-105
HOST: Paul Beame
ABSTRACT:
Conventional cryptography provides strongboxes for our secrets. However,
information often must be combined with other information to be useful,
and to do that we have to take it out of hiding. Or do we? For the last
two decades, researchers have developed the field of secure computation,
in which secrets are combined while minimizing as much as possible the
information leaked. I will survey the basics of secure computation and
promising areas for future investigation.
Refreshments to be served in room prior to talk.
*NOTE* This lecture will be broadcast live via the Internet. See
http://www.cs.washington.edu/news/colloq.info.html for more information.
_______________________________________________
Theory-talks mailing list
Theory-talks@cs.washington.edu
http://mailman.cs.washington.edu/mailman/listinfo/theory-talks
_______________________________________________
Theory-group mailing list
Theory-group@cs.washington.edu
http://mailman.cs.washington.edu/mailman/listinfo/theory-group
This archive was generated by hypermail 2.1.6 : Tue Mar 30 2004 - 09:31:02 PST