• Corpus ID: 238857049

zk-Fabric, a Polylithic Syntax Zero Knowledge Joint Proof System

  title={zk-Fabric, a Polylithic Syntax Zero Knowledge Joint Proof System},
  author={Sheng Sun and Tong Wen},
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… 

Figures from this paper


ZKBoo: Faster Zero-Knowledge for Boolean Circuits
ZKBoo1 is a proposal for practically efficient zero-knowledge arguments especially tailored for Boolean circuits and a proof-ofconcept implementation is described, which can generate a non-interactive proof for the SHA-1 circuit in approximately 13ms.
Non-Interactive Zero-Knowledge Proof Systems
The result is strengthened by showing that Non-Interactive Zero-Knowledge Proof Systems exist based on the weaker and well-known assumption that quadratic residuosity is hard.
MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs
A new zk-SNARK system that is well-suited for randomized algorithms and a universal circuit that takes as input any arithmetic circuit of a bounded number of operations as well as a possible value assignment, and performs randomized checks to verify consistency are presented.
How to generate and exchange secrets
  • A. Yao
  • 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986
In this paper we introduce a new tool for controlling the knowledge transfer process in cryptographic protocol design. It is applied to solve a general class of problems which include most of the
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives
We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have
On the Size of Pairing-Based Non-interactive Arguments
  • Jens Groth
  • Computer Science, Mathematics
  • 2016
It is shown that linear interactive proofs cannot have a linear decision procedure, and it follows that SNARGs where the prover and verifier use generic asymmetric bilinear group operations cannot consist of a single group element.
Efficient Two-Party Secure Computation on Committed Inputs
A homomorphic, semantically secure variant of the Camenisch-Shoup verifiable cryptosystem, which uses shorter keys, is unambiguous, and allows efficient proofs that a committed plaintext is encrypted under a committed key.
OT-Combiners via Secure Computation
This work introduces a new general approach for combining OTs by making a simple and modular use of protocols for secure computation, and obtains the first constant-rate OT-combiners in which the number of secure OTs being produced is a constant fraction of the total number of calls to the OT-candidates, while still tolerating a constant fractions of faulty candidates.
Adaptive Security of Practical Garbling Schemes
This work presents an adaptively secure garbling scheme that garbles XOR gates with 2 and AND gates with 3 ciphertexts per gate, thus providing the first practical garbled scheme with adaptive security based on PRFs whose garbled circuit size is smaller than that of Yao’s construction.
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs
This main fully secure protocol builds on a new intermediate honest-majority protocol for verifying the correctness of multiplication triples by making a general use of distributed zeroknowledge proofs, and provides a conceptually simpler, more general, and more efficient alternative to previous protocols from the literature.