Blog
MINI-FE: computing functions on private data without trusted parties
In this blog post we introduce MINI-FE, a cryptographic protocol to compute functions over private data without any trusted parties and with minimal interaction. In particular we present its applications for Private Stream Aggregation and Quadratic-like Boardroom Voting.
Posted 2023-03-29 by Artem Grigor ‐ 9 min read
BatRaVot: Scalable Trustless Voting on Ethereum
BatRaVot is a trustless voting protocol that allows for both on-chain and off-chain voting with on-chain results, making it a cost-effective and versatile solution for various types of voting scenarios on the Ethereum blockchain. In the blog post we explain the protocol and present our implementation that you can already use today.
Posted 2023-01-19 by Vincenzo Iovino and Artem Grigor ‐ 7 min read
Selected Topics in Cryptography: from the basics to e-voting
In this post we announce the first set of cryptographic notes published at Aragon ZK Research.
Posted 2022-12-23 by Vincenzo Iovino ‐ 5 min read
Notes on elliptic curves over finite fields and their pairings
Manuscript release.
Posted 2022-12-23 by Matan Prasma ‐ 2 min read
A Rust implementation of DualRing's sum argument
Recently at Aragon we've been looking for ways to enable efficient, decentralised private voting. As part of that, we've been looking into the state of the art of private linkable membership proofs, as they're very suitable to act as the base of a private voting protocol. We implemented an interesting subsection of the state of the art in ring signatures, and this post explains why that's interesting!
Posted 2022-12-22 by Rebekah ‐ 3 min read
Decentralised Private Voting
Many private voting protocols rely on central servers, or partially or fully trusted third parties, either for availability or for privacy. This note discusses some ways to achieve decentralised, private, blockchain-based voting, without any trusted third parties.
Posted 2022-12-21 by Rebekah ‐ 3 min read
SHA512 and its implementation in Noir
In this blog post, we discuss the SHA512 hash function and its implementation in Aztec's Noir, a domain-specific language for constructing and verifying zero-knowledge proofs.
Posted 2022-12-14 by Ahmad Afuni ‐ 13 min read
SNARVs: Succinct Non-Interactive Arguments of Voting -- protocols for cost-effective, off-chain e-voting.
Announcing SNARV: succinct non-interactive arguments of voting.
Posted 2022-11-25 by Vincenzo Iovino ‐ 7 min read
Simple Soundness Proofs
Soundness proofs tend to be quite long and technical. We describe a general method to significantly simplify such proofs if some specific conditions are met.
Posted 2022-10-14 by Alex Kampa ‐ 8 min read
Weil reciprocity on the projective line
This Maths Seminar note provides a self-contained proof of the Weil reciprocity on the projective line of a field, together with concrete examples. A good grasp of the concepts explained here will help with understanding elliptic curve pairings.
Posted 2022-10-07 by Alex Kampa ‐ 11 min read