Paper 2023/881
Strict Linear Lookup Argument
, Hofstra UniversityAbstract
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 ))$
Metadata
- Available format(s)
- -- withdrawn --
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Lookup ArgumentQuasi-Adaptive NIZK
- Contact author(s)
- Xiang Fu @ hofstra edu
- History
- 2023-06-12: withdrawn
- 2023-06-08: received
- See all versions
- Short URL
- https://ia.cr/2023/881
- License
-
CC BY-NC
