Candidate Multilinear Maps

In this work the authors put forth new plausible lattice-based constructions with properties that approximate the sought after multilinear maps. The multilinear analog of the decision Diffie-Hellman problem appears to be hard in this construction, and this allows for their use in cryptography. These constructions open doors to providing solutions to a number of important open problems.