Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
Speaker: Hoetek Wee , George Washington University
Date: November 17 2011
Time: 10:30AM to 12:00PM
Location: 32-G575 - Stata Center
Host: Yael Tauman Kalai, Microsoft N.E.
Contact: Be Blackburn, 3-6098, imbe@mit.edu
Relevant URL: I will present a (not-so-recent) framework of extractable hash proofs, and how it yields efficient CCA-secure encryption schemes. If time permits, I will also outline a new connection between KDM-security and smooth projective hashing.
See other events that are part of CIS Seminars 2011/2012
See other events happening in November 2011
