Oct

31

## Improved zk-SNARK Multi-party Computation Protocol

zk-SNARKs – the zero-knowledge proofs at the core of Zcash – require a parameter generation ceremony to take place for […]

Sep

21

## Ceremony Audit Results

As a science-focused team, ensuring the security of the Zcash protocol and the users of the network is a natural […]

Jun

08

## Pay-to-sudoku Revisited

Last year, I created a project called pay-to-sudoku which was the world’s first implementation of a zero-knowledge contingent payment (ZKCP). […]

Tags: , ,

Jun

07

## Explaining SNARKs Part VII: Pairings of Elliptic Curves

<< Part VI In Part VI, we saw an outline of the Pinocchio zk-SNARK. We were missing two things – […]

May

10

## Explaining SNARKs Part VI: The Pinocchio Protocol

<< Part V In part V we saw how a statement Alice would like to prove to Bob can be […]

Apr

25

## Explaining SNARKs Part V: From Computations to Polynomials

<< Part IV In the three previous parts, we developed a certain machinery for dealing with polynomials. In this part, […]

Apr

11

## Explaining SNARKs Part IV: How to make Blind Evaluation of Polynomials Verifiable

<< Part III In this part, we build on Part II and III to develop a protocol for verifiable blind […]

Apr

04

## Bellman: zk-SNARKs in Rust

Bellman is a Rust-language library for building zk-SNARKs — small, cheap-to-verify zero-knowledge proofs of arbitrary computations. The goal of bellman […]

Tags: , ,

Mar

28

## Explaining SNARKs Part III: The Knowledge of Coefficient Test and Assumption

<< Part II In Part II, we saw how Alice can blindly evaluate the hiding :math:E(P(s)) of her polynomial :math:P […]

Mar

13

## Explaining SNARKs Part II: Blind Evaluation of Polynomials

<< Part I In this post, we recall the notion of a polynomial, and explain the notion of “blind evaluation” […]