Welcome to the resource topic for 2023/881
Title:
Strict Linear Lookup Argument
Authors: Xiang Fu
Abstract:Given a table \mathfrak{t} ∈ \mathbb{F}_N , and a commitment to a polynomial f (X) \in \mathbb{F}_{<n}[X] over a multiplicative subgroup \mathbb{H} ⊂ \mathbb{F}. The lookup argument asserts that f |_{\mathbb{H}} ⊂ \mathfrak{t}. We present a new lookup argument protocol that achieves strict linear prover complexity, after a pre-processing step of O(N log(N ))
ePrint: https://eprint.iacr.org/2023/881
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .