Project Overview#

Succinct zero-knowledge proofs allow you to generate proofs which not only leak no information other the truth of the statement being proven but are tiny and fast to verify regardless of the statement being proven.

Regular zero-knowledge proofs are already widely deployed for electronic voting. However, they suffer from a number of security and efficiency problems. Succinct zero-knowledge could allow a number of these problems to be resolved.

The goal of this project is to examine the current capabilities of the succinct zero-knowledge by implementing a proof which could be used for secure e-voting.

  • a deep knowledge about cryptology is not required


  • a good undergraduate maths background
  • a demonstrated ability to quickly get up to speed with new programming languages and libraries


bars search times arrow-up