Strict Linear Lookup Argument

Xiang Fu

Paper 2023/881

Strict Linear Lookup Argument

Xiang Fu

, Hofstra University

Abstract

Given a table $t \in F_{N}$ , and a commitment to a polynomial $f (X) \in$ $F_{< n} [X]$ over a multiplicative subgroup $H \subset F$ . The lookup argument asserts that $f |_{H} \subset t$ . We present a new lookup argument protocol that achieves strict linear prover complexity, after a pre-processing step of $O (N l o g (N))$

Metadata

Available format(s): -- withdrawn --
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: Lookup Argument Quasi-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