jon
LightNews LightNews
rouach.net
jon
@rouach.net
40 followers 71 following 10 posts
Jonathan Rouach
Exec Director - ZKProof.org
CEO - QEDIT
Posts Replies Media Videos
Reposted by jon
eprint.ing.bot
Efficient Verifiable Mixnets from Lattices, Revisited (Jonathan Bootle, Vadim Lyubashevsky, Antonio Merino-Gallardo) ia.cr/2025/658
Abstract. Mixnets are powerful building blocks for providing anonymity in applications like electronic voting and anonymous messaging. The en- cryption schemes upon which traditional mixnets are built, as well as the zero-knowledge proofs used to provide verifiability, will, however, soon become insecure once a cryptographically-relevant quantum computer is built. In this work, we construct the most compact verifiable mixnet that achieves privacy and verifiability through encryption and zero-knowledge proofs based on the hardness of lattice problems, which are believed to be quantum-safe. A core component of verifiable mixnets is a proof of shuffle. The starting point for our construction is the proof of shuffle of Aranha et al. (CT- RSA 2021). We first identify an issue with the soundness proof in that work, which is also present in the adaptation of this proof in the mixnets of Aranha et al. (ACM CCS 2023) and Hough et al. (IACR CiC 2025). The issue is that one cannot directly adapt classical proofs of shuffle to the lattice setting due to the splitting structure of the rings used in lattice-based cryptography. This is not just an artifact of the proof, but a problem that manifests itself in practice, and we successfully mount an attack against the implementation of the first of the mixnets. We fix the problem and introduce a general approach for proving shuffles in split- ting rings that can be of independent interest. The efficiency improvement of our mixnet over prior work is achieved by switching from re-encryption mixnets (as in the works of Aranha et al. and Hough et al.) to decryption mixnets with very efficient layering based on the hardness of the LWE and LWR problems over polynomial rings. The ciphertexts in our scheme are smaller by approximately a factor of 10X and 2X over the aforementioned instantiations, while the linear-size zero-knowledge proofs are smaller by a factor of 4X and 2X. Image showing part 2 of abstract.
April 13, 2025 at 3:05 AM
rouach.net
@zkproof.org workshop in Sofia has started!

Welcome everyone :)
March 23, 2025 at 3:50 PM
Reposted by jon
zkproof.org
🔥🔥🔥 Get ready for #ZKProof 2025!

Keynote speaker: Dan Boneh from Stanford University

Join us in Sofia March 23-25 to discuss the future of ZKP standardization, zkEVM Formal Verification, TLSNotarization & more.

For more details - link in the first comment.
March 20, 2025 at 5:55 PM
Reposted by jon
zkproof.org
Be part of the future of ZKproof cryptography.

Counting down to ZKProof 7 - just one week left!

Join us in Sofia March 23-25 to discuss the future of ZKP standardization, zkEVM Formal Verification, TLSNotarization & more.

For more details - link in the first comment.
March 16, 2025 at 4:00 PM
rouach.net
scottaaronson.blog?p=8693
My TLDR Scott Aaronson's warning:
- He tried to put himself in the shoes of POTUS, doesn't compute.
- So he used a new AI result, showing AI will go cruel if asked to code evil code.
- Now the mental model is: tune yourself to evil once, shit, you've turned full-Hitler.
The Evil Vector
Last week something world-shaking happened, something that could change the whole trajectory of humanity’s future. No, not that—we’ll get to that later. For now I’m talking …
scottaaronson.blog
March 4, 2025 at 1:52 PM
rouach.net
My first commands on a brand new Ubuntu:

sudo apt install pipx
pipx install uv llm
pipx ensurepath

re-login..

llm install llm-anthropic llm-perplexity llm-gemini
llm keys set openai
llm keys set anthropic
llm keys set perplexity
llm keys set gemini

Now we're @simonwillison.net compatible :)
February 7, 2025 at 10:34 AM
rouach.net
who's following the geoguessr vancouver show? man it's entertaining!!!

for those who don't - there's this bro-dude, looks 1sec at a google map and pins it on the globe, "nice".

now he's trying to guess the country for indoor pictures, and it's so funny his struggle with vancouver the nemesis :)
January 16, 2025 at 7:12 AM
Reposted by jon
durumcrustulum.com
AWS plans to support pure ML-DSA signing via roots of trust:
To address this need for long-lived roots of trust for code and document signing, AWS will adopt ML-DSA, a new digital signature algorithm that is believed to be secure against adversaries in possession of a cryptographically relevant quantum computer. We will first offer ML-DSA as a feature within AWS Key Management Service (AWS KMS), enabling customers to generate and use PQC keys as roots of trust for signing operations within the FIPS-140-3 Level 3 validated hardware security modules (HSMs) used in AWS KMS. This integration represents a crucial milestone in our PQC roadmap, providing customers with the capability to establish secure, quantum-resistant roots of trust and authentication for their long-term security needs.
December 6, 2024 at 2:17 AM
rouach.net
@simonwillison.net can you please approve github.com/simonw/datas...
love your work
this closes github.com/simonw/datas... which is where i stole the fix (and tested)
Fix add plugin screen Error 500 by jonmrjr · Pull Request #27 · simonw/datasette-app-support
github.com
November 30, 2024 at 7:11 PM