[144523] in cryptography@c2.net mail archive
Re: Popular explanation of fully homomorphic encryption wanted
daemon@ATHENA.MIT.EDU (Jack Lloyd)
Wed Jun 17 22:28:53 2009
Date: Wed, 17 Jun 2009 01:16:25 -0400
From: Jack Lloyd <lloyd@randombit.net>
To: cryptography@metzdowd.com
Mail-Followup-To: cryptography@metzdowd.com
In-Reply-To: <20090616163136.A381D14F6E1@finney.org>
On Tue, Jun 16, 2009 at 09:31:36AM -0700, "Hal Finney" wrote:
> Udhay Shankar N quotes wikipedia:
> > The question was finally resolved in 2009 with the development of the
> > first true fully homomorphic cryptosystem. The scheme, constructed by
> > Craig Gentry, employs lattice based encryption and allows evaluation
> > of both addition and multiplication operations without restriction.[2]
> >
> > 2. ^ Craig Gentry. On homomorphic encryption over circuits of
> > arbitrary depth. In the 41st ACM Symposium on Theory of Computing
> > (STOC), 2009.
>
> A URL for this paper is
> http://portal.acm.org/citation.cfm?id=1536414.1536440 but you will have
> to be an ACM member to download it. I was able to get a copy this morning
> and quickly skimmed it.
Google located for me a set of slides and audio for a talk given by
the author on this paper:
http://www.fields.utoronto.ca/audio/08-09/crypto/gentry/index.html
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
