Laconic Function Evaluation for Turing Machines

ePrint Report: Laconic Function Evaluation for Turing Machines

Nico Döttling, Phillip Gajland, Giulio Malavolta

Laconic function evaluation (LFE) allows Alice to compress a large circuit $\mathbf{C}$ into a small digest $\mathsf{d}$. Given Alice's digest, Bob can encrypt some input $x$ under $\mathsf{d}$ in a way that enables Alice to recover $\mathbf{C}(x)$, without learning anything beyond that. The scheme is said to be $laconic$ if the size of $\mathsf{d}$, the runtime of the encryption algorithm, and the size of the ciphertext …

algorithm alice beyond ciphertext digest encrypt encryption eprint report evaluation function input large machines recover report runtime size under