ais

Surpising that even in ZK circles, MPC is still considered ‘just threshold signing.’ Big miss.
MPC allows full computation on encrypted data eg for private defi or agents w/o exposing inputs. It’s makes ZK collaborative and goes far beyond what we know from wallets. Thoughts?

New Personal Stack is here by cryptographer @aisconnolly.bsky.social from @taceo.bsky.social

Feel free to explore free, open-source tools experts are using.

I think it shows, but I really enjoyed the @zkhack.dev meetup in Denver

Very much looking forward to see @zkgaylord.bsky.social and the @zkhack.dev gang ♥️

We’ll be in Denver to hijack a corner of the @zkhack.dev meetup!
Come chill with us if you want to talk coSNARKs, coNoir, MPC generally, or to get your hands on some of the most notorious stickers in town 🔥

Multiparty Notaries for zkTLS A blog about various topics in MPC, ZK and other privacy-preserving technologies, by TACEO.

In a (long) tweet and an article, @taceo.bsky.social team first gave a quick refresher on what zkTLS is, and then presented how it can move beyond 2-party computation (2PC) – a TLS-MPC version with multiple parties.
Article: https://buff.ly/4gzN26v

Abstract. The Fiat-Shamir (FS) transform is a prolific and powerful technique for compiling public-coin interactive protocols into non-interactive ones. Roughly speaking, the idea is to replace the random coins of the verifier with the evaluations of a complex hash function. The FS transform is known to be sound in the random oracle model (i.e., when the hash function is modeled as a totally random function). However, when instantiating the random oracle using a concrete hash function, there are examples of protocols in which the transformation is not sound. So far all of these examples have been contrived protocols that were specifically designed to fail. In this work we show such an attack for a standard and popular interactive succinct argument, based on the GKR protocol, for verifying the correctness of a non-determinstic bounded-depth computation. For every choice of FS hash function, we show that a corresponding instantiation of this protocol, which was been widely studied in the literature and used also in practice, is not (adaptively) sound when compiled with the FS transform. Specifically, we construct an explicit circuit for which we can generate an accepting proof for a false statement. We further extend our attack and show that for every circuit C and desired output y, we can construct a functionally equivalent circuit C^(*), for which we can produce an accepting proof that C^(*) outputs y (regardless of whether or not this statement is true). This demonstrates that any security guarantee (if such exists) would have to depend on the specific implementation of the circuit C, rather than just its functionality. Lastly, we also demonstrate versions of the attack that violate non-adaptive soundness of the protocol – that is, we generate an attacking circuit that is independent of the underlying cryptographic objects. However, these versions are either less practical (as the attacking circuit has very large depth) or make some additional (reasonable) assumptions on the underlying cryptographic primitives.

Image showing part 2 of abstract.

How to Prove False Statements: Practical Attacks on Fiat-Shamir (Dmitry Khovratovich, Ron D. Rothblum, Lev Soukhanov) ia.cr/2025/118

Collaborative SNARKs and Private Shared State EthereumZuri.ch 2025 As blockchain technology matures, the expansion from purely public state systems, pioneered by Ethereum, to privacy-centric platforms like Aztec and Aleo marks significant progress. However, the devel...

We'll be at Ethereum Zurich next week to talk all things coSNARKs and private shared state! Let us know if you're in town, and would like to talk prog crypto and the future of privacy in Web3.
cfp.ducttape.events/ethereumzuri...

Only a few days left to nominate for @web3privacy awards! Support privacy tech and share your favorite projects.
Need ideas? Check @fileverse: portal.fileverse.io/#/0xe141365...

Info for nominating: awards.web3privacy.info/

TACEO 2024: Coffee, Code, and CoSNARKs A blog about various topics in MPC, ZK and other privacy-preserving technologies, by TACEO.

We had a great year. From bringing super optimized MPC protocols to the mass market and securing 9 million people's irises with World, to developing open source coSNARK tooling and building an alphanet for private proof delegation, it's been wild.
Full breakdown here: blog.taceo.io/eoy/

Poseidon Cryptanalysis Scrutinizing Poseidon for Good

The Ethereum Foundation is running a cryptanalysis project focusing on Poseidon, with grants and bounties up for grabs!
www.poseidon-initiative.info

✅Range checks in collaborative Noir
✅Support for asserts, and...
✅The first version of the Brillig VM in MPC!

Though still in early experimental stages, this is huge progress for private shared state in Noir
Read more in the coNoir releases: docs.taceo.io/docs/release...

If you’re curious about the design and analysis of encrypted algorithms and encrypted databases, I’m putting together a collection of resources at encryptedsystems.org

hi there. welcome to 2016.

CoSNARKs have been heating up since Devcon 🔥
and some of the leading ZK projects are currently onboarding to try our alphanet for private proof delegation.
There are a few slots left, so if you wanted to offload some proving in a privacy preserving way, our dms are open.

CoSnarks in Action at Devcon7 A blog about various topics in MPC, ZK and other privacy-preserving technologies, by TACEO.

It worked!
Almost flawlessly!
1800+ people generated 15000+ coSNARKs!
Last week we established a coSNARK Alphanet with the Cursive team and PSE so that the Cursive Devcon app could privately outsource proof generation. More details:
blog.taceo.io/devcon-demo/

I was asked if the exhibition had a website. It doesn't, yet, but I promised to add links to all the papers displayed in our Discord. Some of the papers are really nice, especially the earlier ones, as they are easy to read. See them here: discord.gg/XZxXQyfE

It was cool to see Jens Groth generating proofs, the Aztec team getting excited about Plonk's place in the museum, and best of all was Andrew Lu meeting Don Beaver.

Moreover, the Cursive experience was about generating ✨cryptographic connections✨ and I wanted to highlight that behind the science there are real people, (some even at the conference!) who have connected and worked and fought through years of ideas to get here.

I also had other motives - I wanted to create a space to learn about the underlying science, as such educational resources are scarce in web3. People stood and read for 30+ mins at the exhibition, which was wonderful to see.

Last week at Devcon, I exhibited as part of Cursive's Cryptographic Connections museum. Inspired by the experience of generating coSNARKs on the Alphanet, I wanted to showcase the history of MPC, tracing the development of coSNARKs and TACEO tooling from their beginnings.

Hello and thank you for having me.