Paper 2023/1406
Sigmabus: Binding Sigmas in Circuits for Fast Curve Operations
Abstract
This paper introduces Sigmabus, a technique designed to enhance the efficiency of zero-knowledge circuits by relocating computationally expensive operations outside the circuit. Specifically, Sigmabus focuses on moving elliptic curve group operations, typically proven with expensive non-native field arithmetic, to external computations. By leveraging Sigma protocols, elliptic curve group operations are proven outside the circuit, while additional constraints are applied to the circuit to ensure correct execution of the Sigma protocol. This approach can achieve significant performance improvements in zero-knowledge circuits. This paper presents the Sigmabus protocol along with its security proofs, and demonstrates its practical implications through various use cases.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- zero-knowledgesigma-protocolszk-snarks
- Contact author(s)
- asn @ ethereum org
- History
- 2023-10-19: last of 2 revisions
- 2023-09-18: received
- See all versions
- Short URL
- https://ia.cr/2023/1406
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1406,
author = {George Kadianakis and Mary Maller and Andrija Novakovic},
title = {Sigmabus: Binding Sigmas in Circuits for Fast Curve Operations},
howpublished = {Cryptology ePrint Archive, Paper 2023/1406},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/1406}},
url = {https://eprint.iacr.org/2023/1406}
}
