Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation

ePrint Report: Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation

Fangqi Dong, Zihan Hao, Ethan Mook, Daniel Wichs

Laconic function evaluation (LFE) is a "flipped" version of fully homomorphic encryption, where the server performing the computation gets the output. The server commits itself to a function $f$ by outputting a small digest. Clients can later efficiently encrypt inputs $x$ with respect to the digest in much less time than computing $f$, and ensure that the server …

computation daniel encryption eprint report evaluation fully homomorphic encryption function homomorphic encryption obfuscation performing report server version