Marco Vassena
where else to find them
what they talk about
where they keep going back
on a stage with
all 17 in the filters
who talks about the same things
- Marco Patrignani14 talks
- Craig Disselkoen4 talks
- Deian Stefan14 talks
- Sunjay Cauligi4 talks
- Matthew Kolosick3 talks
- Bryan Parno22 talks
| title | conference | date |
|---|---|---|
| Robust Constant-Time Cryptography | PLDI 2025 | 2025-06-16 |
Defines an operational semantics and a new property Robust Constant Time (RCT) that is parameterized by attacker models (read gadgets, speculative read… | ||
| Robust Constant-Time Cryptography | PriSC 2023 | 2023-01-21 |
Constant-time is insufficient: code that avoids secret-dependent branches still leaks when keys live in memory or the application misbehaves. The work defines… | ||
| MSWasm: Soundly Enforcing Memory-Safe Execution of Unsafe Code | POPL 2023 | 2023-01-15 |
Extends Wasm with segmented memory and unforgeable handles that carry colored provenance, a formal semantics, and a proof that well-typed MSWasm modules are… | ||
| Automatically Eliminating Speculative Leaks from Cryptographic Code with Blade | POPL 2021 | 2021-01-17 |
Blade automatically finds data-flow paths from memory reads that can speculatively carry secrets to cache-leaking sinks, models them with a transient vs stable… | ||
| Automatically Eliminating Speculative Leaks with Blade | PriSC 2020 | 2020-01-25 |
Blade is a static detector for speculative leaks that combines a transient-flow type system with an automatic repair pass that inserts a provably minimal set… | ||
| Memory Safety Preservation for WebAssembly | PriSC 2020 | 2020-01-25 |
Claims a compiler-based way to preserve memory safety when compiling C to WebAssembly by translating checked pointers into capabilities stored in private… | ||
| nothing matches | ||