Re: Fully Homomorphic Encryption Using Ideal Lattices

2009-05-01 Thread Taral 
On Tue, Mar 17, 2009 at 5:06 PM, R.A. Hettinga r...@shipwright.com wrote:
 Title: Fully Homomorphic Encryption Using Ideal Lattices
 Speaker: Craig Gentry, Stanford University
 Time/Place: 11 am, 18 March, Wozniak Lounge
 [Ed. note: 4th floor, Soda Hall, UC Berkeley]

This looks fascinating, but isn't local to me. Does anyone know of a paper?

-- 
Taral tar...@gmail.com
Please let me know if there's any further trouble I can give you.
-- Unknown

-
The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to majord...@metzdowd.com

Fully Homomorphic Encryption Using Ideal Lattices

2009-04-30 Thread R.A. Hettinga 

Liberated from LiveJournal :-):


Title: Fully Homomorphic Encryption Using Ideal Lattices
Speaker: Craig Gentry, Stanford University
Time/Place: 11 am, 18 March, Wozniak Lounge
[Ed. note: 4th floor, Soda Hall, UC Berkeley]

Abstract:
We propose a fully homomorphic encryption scheme -- i.e., a scheme  
that

allows one to evaluate circuits over encrypted data without access to
the decryption function. First, we provide a general preliminary
result -- that, to construct an encryption scheme that permits
evaluation of arbitrary circuits, it suffices to construct an
encryption scheme that can evaluate (slightly augmented versions of)
its own decryption circuit; we call such a scheme bootstrappable.
Next, we provide a bootstrappable public key
encryption scheme using ideal lattices.


Cheers,
RAH

-
The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to majord...@metzdowd.com