### The nearest-colattice algorithm: time-approximation
tradeoff for approx-CVP

We exhibit a hierarchy of polynomial time algorithms solving
approximate variants of the Closest Vector Problem. Our
contributions is on the one hand a heuristic algorithm
achieving the same distance as HSVP algorithms, and on
the other hand a proven reduction from approximating
the closest vector with a
factor \(\approx n^{\frac32}\beta^{\frac{3n}{2\beta}}\)
to the Shortest Vector Problem in dimension
\(\beta\).

### Algebraic and euclidean lattices: optimal lattice
reduction and beyond

We introduce a framework for polynomial time reduction of
lattices over number fields, leveraging their recursive and
symplectic structures.

Implementation page

### Revisiting TFHE security against hybrid lattice
attacks

We propose a novel hybrid attack against binary LWE and
apply it to refine the security estimate of the fully
homomorphic encryption scheme TFHE.

### Relational -Liftings for Differential Privacy

We propose a novel, existential version of approximate
lifting, called ⋆-lifting, and show that it is equivalent to
Sato's construction for discrete probability measures.We also
clarify the relation between existing definitions of
approximate lifting, and consider more general approximate
liftings based on f-divergences.