Paper 2024/265 Original: eprint.iacr.org/2024/265 ↗
Beyond the circuit: How to Minimize Foreign Arithmetic in ZKP Circuits
Abstract
Zero-knowledge circuits are frequently required to prove gadgets that are not optimised for the constraint system in question. A particularly daunting task is to embed foreign arithmetic such as Boolean operations, field arithmetic, or public-key cryptography. We construct techniques for offloading foreign arithmetic from a zero-knowledge circuit including: (i) equality of discrete logarithms across different groups; (ii) scalar multiplication without requiring elliptic curve operations; (iii) proving knowledge of an AES encryption. To achieve our goal, we employ techniques inherited from rejection sampling and lookup protocols. We implement and provide concrete benchmarks for our protocols.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2024-02-16: last updated
- 2024-02-16: published
- Short URL
- https://ia.cr/2024/265
- License
- https://creativecommons.org/publicdomain/zero/1.0/
BibTeX
@misc{cryptoeprint:2024/265,
author = {Michele Orrù and George Kadianakis and Mary Maller and Greg Zaverucha},
title = {Beyond the circuit: How to Minimize Foreign Arithmetic in ZKP Circuits},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/265},
year = {2024},
url = {https://eprint.iacr.org/2024/265}
}