Gregor Mitscha-Baude's Avatar

Gregor Mitscha-Baude

@gregor.plusepsilon.com

Co-founder zksecurity.xyz | Math & crypto | ๐Ÿ‡ฆ๐Ÿ‡น

170 Followers  |  200 Following  |  18 Posts  |  Joined: 30.07.2023  |  1.7594

Latest posts by gregor.plusepsilon.com on Bluesky

Post image

this is so much fun xD

27.03.2025 10:21 โ€” ๐Ÿ‘ 0    ๐Ÿ” 0    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 0
Preview
GitHub - MichiganTypeScript/typescript-types-only-wasm-runtime: A WebAssembly runtime implemented in TypeScript types A WebAssembly runtime implemented in TypeScript types - MichiganTypeScript/typescript-types-only-wasm-runtime

Code base: github.com/MichiganType...

27.02.2025 08:48 โ€” ๐Ÿ‘ 0    ๐Ÿ” 0    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 0

I think this is testament to the power and usefulness of TS "literal types", and I wonder why these don't seem to be common in type systems

Correct me if I'm wrong but don't think you can replicate this with e.g. Rust's or Lean4's types, even if they are generally seen as more advanced than TS

27.02.2025 08:44 โ€” ๐Ÿ‘ 1    ๐Ÿ” 0    ๐Ÿ’ฌ 1    ๐Ÿ“Œ 0

ridiculous and beautiful, TS types running Doom

27.02.2025 08:40 โ€” ๐Ÿ‘ 1    ๐Ÿ” 0    ๐Ÿ’ฌ 1    ๐Ÿ“Œ 0

Ein LLM sollte mehr wie ein Lexikon sein als wie ein Schulbuch. Es sollte Informationen liefern, ohne den Anspruch diese moralisch korrekt zu interpretieren.

17.02.2025 08:03 โ€” ๐Ÿ‘ 0    ๐Ÿ” 0    ๐Ÿ’ฌ 1    ๐Ÿ“Œ 0

Danke fรผrs Teilen! Fรผr mich hรถren sich die ร„nderungen am Model Spec nicht falsch an, selbst wenn sie durch den politischen Rechtsshift motiviert sind.

Ich glaub dass sich LLMs bei heiklen Themen selbst zensieren war nie im Interesse der User, sondern eher nur um รถffentlichen Aufschrei zu vermeiden

17.02.2025 07:43 โ€” ๐Ÿ‘ 0    ๐Ÿ” 0    ๐Ÿ’ฌ 1    ๐Ÿ“Œ 0
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.

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.

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

27.01.2025 01:58 โ€” ๐Ÿ‘ 38    ๐Ÿ” 17    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 6
Post image Post image

context:

23.01.2025 11:29 โ€” ๐Ÿ‘ 3    ๐Ÿ” 0    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 0
Post image Post image

wurde das erste mal hier geblockt, und es fรผhlt sich nicht gut an. nur weil ich in der crypto industrie arbeite hab ich nichts mit irgendeinem scam zu tun

als linker finde ich es extrem schade wie negativ crypto (& tech generell) bei vielen konnotiert ist. speziell v einem politikwissenschaftler :(

23.01.2025 11:28 โ€” ๐Ÿ‘ 3    ๐Ÿ” 0    ๐Ÿ’ฌ 1    ๐Ÿ“Œ 0

Ich bin das Gegenteil von einem Trump-Fan, aber bin froh รผber diese Entscheidung. Warum soll jemand der einen "wild west" Marktplatz betrieben hat ein Leben lang im Gefรคngnis sitzen?? (Er hat auch nicht selbst mit Drogen gehandelt, btw, sondern nur die Plattform betrieben)

22.01.2025 08:13 โ€” ๐Ÿ‘ 0    ๐Ÿ” 0    ๐Ÿ’ฌ 1    ๐Ÿ“Œ 0

Thanks, yep the aggregation of events is actually the biggest lift probably!

19.12.2024 07:00 โ€” ๐Ÿ‘ 4    ๐Ÿ” 0    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 0

"Profit/loss report" sounds relevant ๐Ÿค”

18.12.2024 09:09 โ€” ๐Ÿ‘ 3    ๐Ÿ” 0    ๐Ÿ’ฌ 1    ๐Ÿ“Œ 0

can it help me compute my taxes that are due to realized crypto gains? (Austria-style, where gains are only "realized" once you off-ramp to Euro or goods & services)

18.12.2024 09:07 โ€” ๐Ÿ‘ 3    ๐Ÿ” 0    ๐Ÿ’ฌ 1    ๐Ÿ“Œ 0

Great thesis explaining the weird state of politics

06.12.2024 08:24 โ€” ๐Ÿ‘ 1    ๐Ÿ” 0    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 0

Seems like .at ๐Ÿ‡ฆ๐Ÿ‡น suddenly became a cool TLD because of atproto :D

02.12.2024 12:03 โ€” ๐Ÿ‘ 1    ๐Ÿ” 0    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 0

Abgesehen davon ist solches Signaling extrem gut und wichtig fรผr die Adoption von Bluesky! Ich wรคre nie hierher gewechselt wenn es nicht schon Traction gegeben hรคtte -- und von dieser Traction weiรŸ ich in erster Linie durch die Ankรผndigungen auf X

02.12.2024 11:34 โ€” ๐Ÿ‘ 10    ๐Ÿ” 0    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 0

Wtf this makes no sense

28.11.2024 19:59 โ€” ๐Ÿ‘ 1    ๐Ÿ” 0    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 0

Yep - git was designed for merging, it's a much more natural flow

27.11.2024 14:35 โ€” ๐Ÿ‘ 0    ๐Ÿ” 0    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 0

Watching this great talk about the AT protocol
+ seeing the #eXit of big Austrian journalist accounts
= genuinely excited about BlueSky โค๏ธ

26.11.2024 14:25 โ€” ๐Ÿ‘ 0    ๐Ÿ” 0    ๐Ÿ’ฌ 0    ๐Ÿ“Œ 0

@gregor.plusepsilon.com is following 20 prominent accounts