We describe a polynomial-time cryptanalysis of the (approximate) multilinear map of Coron,
Lepoint and Tibouchi (CLT). The attack relies on an adaptation of the so-called zeroizing …

In the last few years, cryptographic multilinear maps have proved their tremendous potential
as building blocks for new constructions, in particular the first viable approach to general …

In this work, we seek to optimize the efficiency of secure general-purpose obfuscation
schemes. We focus on the problem of optimizing the obfuscation of Boolean formulas and …

The security of several homomorphic encryption schemes depends on the hardness of
variants of the approximate common divisor (ACD) problem. We survey and compare a …

Program obfuscation is the process of making a program" unintelligible" without changing
the program's underlying input/output behavior. Although there is a long line of work on …

One can bootstrap LWE-based fully homomorphic encryption (FHE) schemes in less than
one second, but bootstrapping AGCD-based FHE schemes, also known as FHE over the …

Secure multilinear maps (mmaps) have been shown to have remarkable applications in
cryptography, such as multi-input functional encryption (MIFE) and program obfuscation. To …

This paper addresses the fundamental question of whether or not different, exciting
primitives now being considered actually exist. We show that we, unfortunately, cannot have …

We show general transformations from subexponentially-secure approximate
indistinguishability obfuscation (IO) where the obfuscated circuit agrees with the original …

We propose a leveled homomorphic encryption scheme based on the Approximate Greatest
Common Divisor (AGCD) problem that operates natively on vectors and matrices. To …