We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
We present an alternative approach to shortcut fusion based on the function unfoldr. Despite its simplicity the technique can remove intermediate lists in examples which are known...
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
Marten van Dijk, Craig Gentry, Shai Halevi, Vinod ...