Paper 2023/066 Original: eprint.iacr.org/2023/066 ↗
Plonkup scheme with multiple queries
Abstract
There is a line of 'lookup' protocols to show that all elements of a sequence $f\in{\mathbb F}^n$ are contained in a table $t\in{\mathbb F}^d$, for some field ${\mathbb F}$. Lookup has become an important primitive in Zero Knowledge Virtual Machines, and is used for range checks and other parts of the proofs of a correct program execution. In this note we give several variants of the protocol. We adapt it to the situation when there are multiple lookups with the same table (as is usually the case with range checks), and handle also 'bounded lookup' that caps the number of repetitions.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2023-01-20: last updated
- 2023-01-20: published
- Short URL
- https://ia.cr/2023/066
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/066,
author = {Alexandr Bulkin and Tim Dokchitser},
title = {Plonkup scheme with multiple queries},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/066},
year = {2023},
url = {https://eprint.iacr.org/2023/066}
}