-
Classical complexity reductions among hard lattice problems
The difficulty of solving a hard lattice problem depends significantly on the choice of its parameters. One cannot meaningfully discuss cryptographic constructions — especially FHE schemes — without first understanding the complexity landscape of lattice problems. This post describes several classical (i.e., non-quantum) reductions among different lattice problems. If you only care about the results,...
-
Lattices of Cryptography — Basic Results
This post is a grab bag of basic definitions and elementary results related to unstructured lattices.
-
Semi-Honest Oblivious Transfer (OT) Primitives
This page describes a few basic protocols for oblivious transfer (OT) schemes and some theoretical results related to them. The next post will consider OT extensions — which are needed when performing a large number of oblivious transfers.