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 […]

Tags: cryptography, Parameter Generation, zkSNARKs

Skip to content
## Improved zk-SNARK Multi-party Computation Protocol

## Ceremony Audit Results

## Pay-to-sudoku Revisited

## Explaining SNARKs Part VII: Pairings of Elliptic Curves

## Explaining SNARKs Part VI: The Pinocchio Protocol

## Explaining SNARKs Part V: From Computations to Polynomials

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

## Bellman: zk-SNARKs in Rust

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

## Explaining SNARKs Part II: Blind Evaluation of Polynomials

Oct

31

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

Tags: cryptography, Parameter Generation, zkSNARKs

Sep

21

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

Tags: cryptography, security, security audits

Jun

08

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: cryptography, ZKCP, zkSNARKs

Jun

07

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

Tags: cryptography, explainers, zkSNARKs

May

10

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

Tags: cryptography, explainers, zkSNARKs

Apr

25

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

Tags: cryptography, explainers, zkSNARKs

Apr

11

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

Tags: cryptography, explainers, zkSNARKs

Apr

04

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: cryptography, Rust, zkSNARKs

Mar

28

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

Tags: cryptography, explainers, zkSNARKs

Mar

13

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

Tags: cryptography, explainers, zkSNARKs