Speaker: Salil Vadhan , Harvard University Contact:
Date: February 10 2009
Time: 4:15PM to 5:15AM
Host: Scott Aaronson, CSAIL, MIT
be, 3-6098, imbe
In this talk, I will:
* Introduce a new notion of *inaccessible entropy*, which measures the infeasibility of randomly sampling from a large subset of a given set of "valid" strings
* Contrast it with previous computational notions of entropy, and
* Describe applications of this notion to cryptography (specifically the construction of statistically hiding commitment schemes).
Joint work with Iftach Haitner, Omer Reingold, and Hoeteck Wee.
[I will emphasize different aspects of this work than covered in Iftach Haitner's CIS seminar on Jan 30.]
See other events that are part of Theory Colloquium 2008/2009
See other events happening in February 2009