Mark Simkin
@simk1n
ID: 897955167215210498
https://msimkin.github.io/ 16-08-2017 22:56:09
195 Tweet
476 Takipçi
42 Takip Edilen
new paper out with Angus Gruen! eprint.iacr.org/2024/1351. in this paper, we prove that if a linear code over a field exhibits proximity gaps over affine lines, then its interleavings also do. we also amend the "general conjecture" for proximity gaps in the UDR [DP23, Conj. 2.4].
Congrats to Lennart Braun of #aarhuskrypto who last week defended his PhD "Cryptography After Prime Time -- Protocols for Z2k and Groups of Unknown Order" Computer Science at Aarhus University
My work on restaking risks with Naveen Durvasula now has an accompanying talk, from the SBC Consensus workshop organized by Ertem Nusret Tas Srivatsan Sridhar David Tse: youtube.com/watch?v=81jXwz…
People often DM me saying that I am brutal in criticizing projects and that I should tone it down a bit. Thing is criticism is good. It means I care. It's how you react to criticism that tells a lot about you and your project. So now I want to speak a bit about EigenLayer. I
🇩🇪 prosecutors appear to be able to **deanonymize Tor ** by tapping servers, for years (!) and doing "timing analysis". In one case – Ricochet, related to CSAM – they did this four times, ordered telco provider to identify customer connecting to entry node tagesschau.de/investigativ/p…
New paper out! We present a simple way to construct OR-proofs from collision-resistant hashing with logarithmic (in the number of statements) proof sizes. To appear at TCC 2024, joint work with Katharina Boudgoust. Link: ia.cr/2024/1482