Paper 2023/1610
An Efficient ZK Compiler from SIMD Circuits to General Circuits
Abstract
We propose a generic compiler that can convert any zero-knowledge (ZK) proof for SIMD circuits to general circuits efficiently, and an extension that can preserve the space complexity of the proof systems. Our compiler can immediately produce new results improving upon state of the art.
-By plugging in our compiler to Antman, an interactive sublinear-communication protocol, we improve the overall communication complexity for general circuits from
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in JOC 2024
- Keywords
- Zero-Knowledge ProofSIMD ZK
- Contact author(s)
-
bui @ irif fr
chtvii @ sjtu edu cn
couteau @ irif fr
wangxiao @ cs northwestern edu
ckweng @ u northwestern edu
yangk @ sklc org
yuyu @ sjtu edu cn - History
- 2024-07-31: revised
- 2023-10-17: received
- See all versions
- Short URL
- https://ia.cr/2023/1610
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1610, author = {Dung Bui and Haotian Chu and Geoffroy Couteau and Xiao Wang and Chenkai Weng and Kang Yang and Yu Yu}, title = {An Efficient {ZK} Compiler from {SIMD} Circuits to General Circuits}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1610}, year = {2023}, url = {https://eprint.iacr.org/2023/1610} }