zk-Fabric, a Polylithic Syntax Zero Knowledge Joint Proof System
This addresses the need for more efficient and comprehensive zero-knowledge proof systems in cryptography, though it appears incremental compared to existing variants like zk-SNARKS and zkBOO.
The paper tackles the problem of creating a versatile and efficient zero-knowledge proof system by introducing zk-Fabric, which uses partitioned garbled circuits to achieve full syntax verification with less overhead and non-interactivity.
In this paper, we create a single-use and full syntax zero-knowledge proof system, a.k.a zk-Fabric. Comparing with zk-SNARKS and another variant zero-knowledge proofing system, zkBOO and it's variant zkBOO++. We present multiple new approaches on how to use partitioned garbled circuits to achieve a joint zero-knowledge proof system, with the benefits of less overhead and full syntax verification. zk-Fabric based on partitioned garbled circuits has the advantage of being versatile and single-use, meaning it can be applied to arbitrary circuits with more comprehensive statements, and it can achieve the non-interactivity among all participants. One of the protocols proposed within is used for creating a new kind of partitioned garbled circuits to match the comprehensive Boolean logical expression with multiple variables, we use the term "polythitic syntax" to refer to the context-based multiple variables in a comprehensive statement. We also designed a joint zero knowledge proof protocol that uses partitioned garbled circuits