Blog
Two Detailed Proofs of Arrow's Impossibility Theorem
Arrow's Impossibility Theorem is a well-known theorem in social choice theory. It shows that ordinal voting systems are inherently flawed. Two closely related proofs are presented in and easy-to-read formet.
Posted 2025-05-28 by Alex Kampa ‐ 1 min read
Maths of Privacy
Introducing a new series of AZKR study sessions: 'Mathematics of Privacy: A Practical Journey from Groups to Zero-Knowledge Proofs'.
Posted 2025-03-22 by AZKR ‐ 3 min read
Bound Schnorr Proofs
The non-interactive Schnorr protocol can be used to bind dditional data to the proof of knoweldge.
Posted 2025-03-16 by AZKR ‐ 2 min read
League of Identity
We describe a method for sending crypto assets to email addresses, Facebook accounts, telephone numbers etc. without prior communication between the sender and recipient. This has potentially ground-breaking implications for the facilitation of web3 onboarding.
Posted 2024-09-21 by AZKR ‐ 4 min read
AZKRchain Devnet launched!
The AZKRchain Devnet has been launched. AZKRchain will be one of the first chains in the Cosmos ecosystem to be built completely in Rust.
Posted 2024-09-16 by AZKR ‐ 1 min read
Bank3: enabling temporarily private cryptocurrency transfers
The Bank3 protocol allows to send assets (such as cryptocurrency) to a smart contract so that the beneficiary remains unknown until the assets are withdrawn.
Posted 2024-03-01 by Vincenzo Iovino ‐ 16 min read
Indistinguishability obfuscation (iO) for general circuits
We propose a construction for indistinguishability obfuscation (iO) for general circuits. The scheme is concocted from four main ingredients: (1) selectively indistinguishably-secure functional encryption for general circuits having its encryption procedure in complexity class NC1; (2) universal circuits; (3) puncturable pseudorandom functions having evaluation in NC1; (4) indistinguishably-secure affine-determinant programs, a notion proposed by works in submission that particularizes iO for specific circuit classes and acts as 'depleted' obfuscators. The scheme can be used to build iO for all polynomial-sized circuits in a simplified way. Instantiations can be obtained from sub-exponentially secure learning with errors (LWE).
Posted 2023-10-23 by Razvan Rosie ‐ 5 min read
Nouns Private Voting Research Sprint - Technical Report
We provide a technical description of the outcomes of the work done by Aragon ZK Research (AZKR) during the exectution of the joint proposal submitted to the Nouns DAO Private Voting Research Sprint by Aztec Labs and AZKR.
Posted 2023-08-17 by AZKR ‐ 19 min read
Nouns Private Voting Research Sprint - General Report
This report presents the results of the joint work done by Aragon ZK Research Association and Aztec Labs to implement a private voting PoC for NounsDAO.
Posted 2023-08-17 by AZKR ‐ 15 min read
TLCS protocols for time-locked encryption
We describe two protocols (zk-TLCS and TLCS) that can be used for time-locked encryption under the assumption that a trusted parts publishes a certain type of random beacon at regular intervals. We then present our *timelock.zone* service, which will be based on the TLCS protocol.
Posted 2023-07-05 by AZKR ‐ 2 min read