Anonymous Data in the Age of AI: Hidden Risks and Safer Practices - Least Authority
Data protection laws often do not apply to the lesser-known category of “anonymous data”. There are misleading claims and new risks.| Least Authority
Data protection laws often do not apply to the lesser-known category of “anonymous data”. There are misleading claims and new risks.| Least Authority
What if Privacy Were the Default? Most digital services still require accounts, personal data, and behavioral tracking permissions, even for simple actions. It’s often assumed that convenience depends on identity. But that assumption is outdated. Tools like anonymous credentials make it possible to build services where an identifying profile is not directly linked to access, ... Read more The post How Anonymous Credentials Redefine Digital Access appeared first on Least Authority.| Least Authority
Practical security checklist and auditing guide for engineers reviewing SP1/RISC-V guest programs (also useful for Risc0). Covers input...| Sigma Prime
In our previous blog post 🥷 Formal verification of an OpenVM chip, we have seen how to verify the determinism of the branch_eq chip of OpenVM. Now, we will see how to verify its completeness, meaning that it always accepts a valid witness for any possible input.| Formal Land Blog
Many zkVMs are implemented in Rust, using the Plonky3 library to describe their circuits. While Rust is efficient and expressive for describing complex circuits, it is a complex language when it comes to formal verification. We present here a way to pretty-print the list of constraints generated by a Plonky3 program. That way, we will be able to import the constraints in a formal verification system like Rocq to make sure they are safe and correct.| formal.land
In this blog post, we present the formal verification of the determinism of the BranchEq circuit of the OpenVM zkVM. This zkVM provides an implementation of RISC-V with Plonky3, and appears to be very fast even on a CPU.| Formal Land Blog
We present in this blog post the main properties that need to be formally verified in the circuits of a zkVM to consider it as secure.| Formal Land Blog
In this blog post, we present a short example about how we define reasoning rules in Rocq to formally verify the safety of zero-knowledge circuits written in LLZK.| Formal Land Blog
LLZK is a language designed to implement zero-knowledge circuits. We wrote a translation tool from this language to a representation in the formal language Rocq.| Formal Land Blog
Here we present the beginning of our work to develop a formal verification tool for LLZK from Veridise, a new language designed to implement zero-knowledge circuits. The zero-knowledge technology is how future versions of Ethereum are planned to be implemented.| formal.land
In this post, we present the beginning of our work to translate programs written in the Circom circuit language to the 🐓 Coq proof assistant. This work is part of our research on the formal verification of zero-knowledge systems.| Formal Land Blog
In this work we improve upon the state of the art for practical zero-knowledge for set membership, a building block at the core of several privacy-aware applications, such as anonymous payments, credentials and whitelists. This primitive allows a user to show knowledge of an element in a large set without leaking the specific element. One of the obstacles to its deployment is efficiency. Concretely efficient solutions exist, e.g., those deployed in Zcash Sapling, but they often work at the pr...| IACR Cryptology ePrint Archive
