Our paper, Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable, together with Martin R. Albrecht, Valerio Cini, Giulio Malavolta and Sri AravindaKrish-nan Thyagarajan will be presented at CRYPTO’22. There, we build what is suggested in the title based on new families of lattice-based assumptions which we call -Ring Inhomogeneous Short Integer Solution (k-R-ISIS) and their […]

This post hopefully makes reading this paper easier. Motivation In group-based cryptography, we often find ourselves working over the ring where is most often a prime or a product of a few large primes (in the setting of composite-order groups). Either way, most elements in the ring are invertible — a fact that is quite […]