Homomorphic Signatures for Polynomial Functions
Speaker: David Mandell Freeman , Stanford University
Date: April 29 2011
Time: 10:30AM to 12:00PM
Location: 32-G449 Patil/Kiva
Host: Shafi Goldwasser, CSAIL, MIT
Contact: Be Blackburn, 3-6098, imbe@mit.edu
We present a homomorphic signature scheme that is capable of
evaluating multivariate polynomials on signed data. Given the public key
and a signed data set, there is an efficient algorithm to produce a
signature on the mean, standard deviation, and other statistics of the
signed data. Previous systems for computing on signed data could only
handle linear operations. For polynomials of constant degree, the length
of a derived signature only depends logarithmically on the size of the
data set.
Our system uses ideal lattices in a way that is a "signature
analogue" of Gentry's fully homomorphic encryption. Security is
based on hard problems on ideal lattices similar to those in Gentry's
system.
This is joint work with Dan Boneh, to appear in Eurocrypt 2011.
See other events that are part of CIS Seminars 2010/2011
See other events happening in April 2011
