S Setty, J Thaler, R Wahby - … International Conference on the Theory and …, 2024 - Springer
This paper introduces Lasso, a new family of lookup arguments, which allow an untrusted prover to commit to a vector a∈ F m and prove that all entries of a reside in some …
L Eagen, D Fiore, A Gabizon - Cryptology ePrint Archive, 2022 - eprint.iacr.org
We present a protocol called $\mathsf {cq} $ for checking the values of a committed polynomial $ f (X)\in\mathbb {F} _ {< n}(X) $ over a multiplicative subgroup …
We present position-hiding linkability for vector commitment schemes: one can prove in zero knowledge that one or m values that comprise commitment\cm all belong to the vector of …
S Thakur - Cryptology ePrint Archive, 2023 - eprint.iacr.org
We describe a pairing-based Snark with a universal updateable CRS that can be instantiated with any pairing-friendly curve endowed with a sufficiently large prime scalar …
Abstract Lasso (Setty, Thaler, Wahby, ePrint 2023/1216) is a recent lookup argument that ensures that the prover cryptographically commits to only" small" values. This note describes …
SNARKs for some standard cryptographic primitives tend to be plenty designed with SNARK- unfriendly operations such as XOR. Previous protocols such as [GW20] worked around this …
We present a protocol for checking the values of a committed polynomial $ f\in\mathbb {F} _ {< n}[X] $ over a multiplicative subgroup $ H\subset\mathbb {F} $ of size $ n $, are contained …
U Haböck - Cryptology ePrint Archive, 2022 - eprint.iacr.org
Logarithmic derivatives translate products of linear factors into sums of their reciprocals, turning zeroes into simple poles of same multiplicity. Based on this simple fact, we construct …
A Arun, S Setty, J Thaler - Annual International Conference on the Theory …, 2024 - Springer
Abstract Succinct Non-interactive Arguments of Knowledge (SNARKs) allow an untrusted prover to establish that it correctly ran some “witness-checking procedure” on a witness. A …