CSAIL Event Calendar: Previous Series

CIS/Microsoft Seminars 2008/2009


Boaz Barak , Princeton University
Merkle Puzzles are Optimal --- an O(n2)-query attack on key exchange from a random oracle

Date: January 9 2009
Time: 10:30AM to 12:00PM
Location: 32-G449


Iftach Haitner , Microsoft Research New England
Accessible Entropy

Date: January 30 2009
Time: 10:30AM to 12:00PM
Location: 32-449


Bhavana Kanukurthi , Boston University
Key Agreement from Close Secrets over Unsecured Channels

Date: February 6 2009
Time: 10:30AM to 12:00PM
Location: 32-G449


Guy Rothblum , CSAIL, MIT
On the Complexity of Differentially Private Data Release: Efficient Algorithms and Hardness Results

Date: February 27 2009
Time: 10:30AM to 12:00PM
Location: 32-G449 Patil/Kiva


Vinod Vaikuntanathan , IBM, TJ Watson
Cryptography against Memory Attacks

Date: March 6 2009
Time: 10:30AM to 12:00PM
Location: 14th Floor Tea Lounge, Microsoft Research NE


Yevgeniy Dodis , NYU
Non-malleable Extractors & Symmetric Key Cryptography from Weak Secrets

Date: April 3 2009
Time: 10:30AM to 12:00PM
Location: 32-G449


Alexandra Boldyrev , GeorgiaTech
Order-preserving symmetric encryption

Date: April 10 2009
Time: 10:30AM to 12:00PM
Location: 32-G449


Craig Gentry , IBM
Fully Homomorphic Encryption Using Ideal Lattices

Date: April 17 2009
Time: 10:30AM to 12:00PM
Location: 32-G449, Patil/Kiva, Stata Center


Jonathan Katz , University of Maryland
Rational Secret Sharing

Date: April 24 2009
Time: 10:30AM to 12:00PM
Location: 14th Floor Tea Lounge, Microsoft Research NE


Guy Rothblum , CSAIL, MIT
Efficient and Reliable Tools for Delegating Computation, PhD

Date: May 29 2009
Time: 10:30AM to 12:30PM
Location: 32-124


Benny Pinkas , University of Haifa
Implementing Secure Multi-Party Computation

Date: October 31 2008
Time: 10:30AM to 12:00PM
Location: 32-G449, Patil/Kiva


Benny Applebaum , Princeton U.
CIS/Microsoft seminar

Date: November 7 2008
Time: 10:30AM to 12:00PM
Location: 14th flr Tea lounge, Microsoft Research


Chris Peikert , SRI International
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem

Date: November 21 2008
Time: 10:30AM to 12:00PM
Location: 32-G449 (Kiva), Stata Center, 32 Vassar Street


Adi Akavia , IAS/DIMACS
Very Local Self Correcting of Homomorphism and MPC Codes

Date: December 5 2008
Time: 10:30AM to 12:00PM
Location: 32-G449


Sharon Goldberg , Princeton University
Internet path-quality monitoring in the presence of adversaries

Date: December 12 2008
Time: 10:30AM to 12:00PM
Location: 14th Floor Tea Lounge, Microsoft Research NE


Back to Previous Series List

Back to Event Calendar


About Us Research News Resources Directory