In recent days, increasing numbers of Internet and wireless network users have helped
accelerate the need for encryption mechanisms and devices to protect user data sharing …

Blockchains have seen growing traction with cryptocurrencies reaching a market cap of over
1 trillion dollars, major institution investors taking interests, and global impacts on …

Plonk is a widely used succinct non-interactive proof system that uses univariate polynomial
commitments. Plonk is quite flexible: it supports circuits with low-degree “custom” gates as …

We present a methodology to construct preprocessing zkSNARKs where the structured
reference string (SRS) is universal and updatable. This exploits a novel use of holography …

We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …

Blockchain technology promises a decentralized ecosystem for building apps with
decentralized ownership and high security level. One of the most adopted blockchain …

Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …

We design and implement a simple zero-knowledge argument protocol for NP whose
communication complexity is proportional to the square-root of the verification circuit size …

Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …

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 …