Paper 2022/1050 Original: eprint.iacr.org/2022/1050 ↗
RapidUp: Multi-Domain Permutation Protocol for Lookup Tables
Abstract
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 problem by the introduction of lookup arguments. However, these protocols were only appliable over the same circuit. RapidUp is a protocol that solves this limitation by unfolding the grand-product polynomial into two (equivalent) polynomials of the same size. Morevoer, a generalization of previous protocols is presented by the introduction of selectors.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2022-09-19: last updated
- 2022-08-13: published
- Short URL
- https://ia.cr/2022/1050
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/1050,
author = {Héctor Masip Ardevol and Jordi Baylina Melé and Daniel Lubarov and José L. Muñoz-Tapia},
title = {RapidUp: Multi-Domain Permutation Protocol for Lookup Tables},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/1050},
year = {2022},
url = {https://eprint.iacr.org/2022/1050}
}