We design, implement, and evaluate a zero knowledge succinct non-interactive argument
(SNARG) for Rank-1 Constraint Satisfaction (R1CS), a widely-deployed NP language …

The area of practical computational integrity proof systems, like SNARKs, STARKs,
Bulletproofs, is seeing a very dynamic development with several constructions having …

We present batching techniques for cryptographic accumulators and vector commitments in
groups of unknown order. Our techniques are tailored for distributed settings where no …

In this whitepaper, we articulate a vision for the evolution of Chainlink beyond its initial
conception in the original Chainlink whitepaper. We foresee an increasingly expansive role …

With the expansion of scale, the Internet of Things (IoT) suffers more and more security
threats, and vulnerability and sensitivity to attacks are also increasing. As a distributed and …

One of the approaches to constructing zero knowledge (ZK) arguments relies on “PCP
techniques” that date back to influential works from the early 1990's Babai et al., Arora et al …

This paper introduces Spartan, a new family of zero-knowledge succinct non-interactive
arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiability (R1CS), an NP …

We introduce Themis, a scheme for introducing fair ordering of transactions into
(permissioned) Byzantine consensus protocols with at most ƒ faulty nodes among n≥ 4ƒ+ 1 …

We present a new methodology to efficiently realize recursive composition of succinct non-
interactive arguments of knowledge (SNARKs). Prior to this work, the only known …

Deep learning techniques with neural networks are developing prominently in recent years
and have been deployed in numerous applications. Despite their great success, in many …