| Blog | https://www.bybaro.it |
| The Salmon Series | https://www.bybaro.it/tss |
| https://twitter.com/AndreaBaro77 | |
| Bluesky | https://bsky.app/profile/bybaro.it |
Come molti della mia generazione ho iniziato a usare i computer quando la RAM si misurava ancora in kilobyte, e per un bel pezzo il lusso erano i megabyte. I gigabyte sono arrivati relativamente tardi, quando ormai avevamo giĂ visto e fatto di tutto con molto meno. E non erano
Essere finito in uno dei progetti per la "sovranita' digitale" mi da' alcuni superpoteri. Uno di questi e' il potere del link. Avete presente quando, lavorando nell'IT, chiedete documentazione e vi rispondono "E' su Confluence"? Sapete gia' che non la troverete mai, a meno che qualcuno non vi dia l'URL
Lo dico da cliente. Il mondo del commercio oggi e' rovinato dai fighettismi, cioe' da quelle finte competenze che il cliente deve mostrare quando e' in negozio, o in un ristorante, al fine di soddisfare le altrettanto finte competenze del venditore. E quando dico "finte" intendo dire "finte". Succede ovunque,
https://ia.cr/2025/1296 sounds disrupting.. looking 4 qualified opinions…
Tags to improve post exposure: #ZKP #simulator #cryptography #trustedsetup #interactive #soundness
A zero-knowledge proof demonstrates that a fact (like that a Sudoku puzzle has a solution) is true while, counterintuitively, revealing nothing else (like what the solution actually is). This remarkable guarantee is extremely useful in cryptographic applications, but it comes at a cost. A classical impossibility result by Goldreich and Oren [J. Cryptol. '94] shows that zero-knowledge proofs must necessarily sacrifice basic properties of traditional mathematical proofs --- namely perfect soundness (that no proof of a false statement exists) and non-interactivity (that a proof can be transmitted in a single message). Contrary to this impossibility, we show that zero-knowledge with perfect soundness and no interaction is effectively possible. We do so by defining and constructing a powerful new relaxation of zero-knowledge. Intuitively, while the classical zero-knowledge definition requires that an object called a simulator actually exists, our new definition only requires that one cannot rule out that a simulator exists (in a particular logical sense). Using this, we show that **every falsifiable security property of (classical) zero-knowledge can be achieved with no interaction, no setup, and perfect soundness.** This enables us to remove interaction and setup from (classical) zero-knowledge in essentially all of its applications in the literature, at the relatively mild cost that such applications now have security that is "game-based" instead of "simulation-based." Our construction builds on the work of Kuykendall and Zhandry [TCC '20] and relies on two central, longstanding, and well-studied assumptions that we show are also necessary. The first is the existence of non-interactive witness indistinguishable proofs, which follows from standard assumptions in cryptography. The second is KrajĂcek and Pudlák's 1989 conjecture that no optimal proof system exists. This is one of the main conjectures in the field of proof complexity and is the natural finitistic analogue of the impossibility of Hilbert's second problem (and, hence, also Gödel's incompleteness theorem). Our high-level idea is to use these assumptions to construct a prover and verifier where no simulator exists, but the non-existence of a simulator is independent (in the logical sense of unprovability) of an arbitrarily strong logical system. One such logical system is the standard axioms of mathematics: ZFC.
A essere meno politically-correct si potrebbe considerare che, visto quello che conta il voto di maturità e visto quanta visibilità danno questi atteggiamenti nel mondo dell’apparire moderno, uno potrebbe anche essersi fatto due conti: meno sbatti, molta visibilità , zero ripercussioni… quindi ci potrebbe anche essere molto poco idealismo e molta concretezza trash: il meccanismo di incentivi e disincentivi di fatto autorizza anche a questa lettura.
