CSAIL Event Calendar: Previous Series
|
Fully Homomorphic Encryption over the Integers Speaker: Vinod Vaikuntanathan , IBM T.J. Watson We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. The security of our scheme relies on the hardness of the approximate integer greatest common divisors (gcd) problem -- namely, given a list of integers that are "near-multiples" of a hidden integer, output that hidden integer.
See other events that are part of CIS/Microsoft Seminars 2009/2010 |







