Oct 29, 2012 · We describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm ...

We describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups, ...

Mar 30, 2015 · This book is based on Sanjam Garg's PhD thesis, which was an extended version of a paper titled “Candidate Multilinear Maps from Ideal Lattices, ...

This work describes plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm ...

In this thesis, we describe plausible lattice-based constructions with properties that. approximate the sought-after multilinear maps in hard-discrete- ...

Jan 31, 2014 · We describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups.

In this thesis, we describe plausible lattice-based constructions with properties that approx- imate the sought-after multilinear maps in hard-discrete- ...

In this thesis, we describe plausible lattice-based constructions with properties that approx- imate the sought-after multilinear maps in hard-discrete- ...

Here, we construct multilinear maps from ideal lattices. Our multilinear maps are “noisy” and bounded to polynomial degree. For very high degree, the “nois-.

This book is based on Sanjam Garg's PhD thesis, which was an extended version of a paper titled “Candidate Multilinear Maps from Ideal Lattices,” co-authored ...