A Simple BGN-Type Cryptosystem from LWE

Download Now
Provided by: International Association for Cryptologic Research
Topic: Security
Format: PDF
The authors construct a simple public-key encryption scheme that supports polynomially many additions and one multiplication, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN). Security is based on the hardness of the Learning With Errors (LWE) problem, which is known to be as hard as certain worst-case lattice problems. Some features of their cryptosystem include support for large message space, an easy way of achieving formula-privacy, a better message-to-ciphertext expansion ratio than BGN, and an easy way of multiplying two encrypted polynomials.
Download Now

Find By Topic