Marco Patrignani
where else to find them
what they talk about
all 5 in the filters
where they keep going back
on a stage with
all 27 in the filters
who talks about the same things
- Marco Vassena8 talks
- Bryan Parno22 talks
- Deepak Garg18 talks
- Guido Martínez10 talks
- Conrad Watt12 talks
- Marco Gaboardi18 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… | ||
| Do You Even Lift? Strengthening Compiler Security Guarantees Against Spectre Attacks | POPL 2025 | 2025-01-19 |
Paper introduces a lifting framework that upgrades compiler guarantees proved for weaker speculative semantics to stronger ones without redoing full secure… | ||
| Universal Composability is Robust Compilation | POPL 2025 | 2025-01-19 |
Paper claims UC security and robust compilation are equivalent under clear axioms and gives a recipe to mechanize UC proofs. It axiomatizes UC semantics, maps… | ||
| Introduction | PriSC 2024 | 2024-01-20 |
PriSC 2024 opens by naming the Principles of Secure Compilation Workshop, noting 11 accepted papers and thanking 22 program committee members who reviewed… | ||
| 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… | ||
| Blame-Preserving Secure Compilation | PriSC 2023 | 2023-01-21 |
Proposes a new secure-compilation criterion, Blame-Preserving Compilation, that refuses trivial proofs when the source language (e.g., C) cannot robustly… | ||
| 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… | ||
| Composing Secure Compilers | PriSC 2022 | 2022-01-16 |
Formal results show that composing compilers preserves concrete classes of hyperproperties: sequential and upper composition guarantee that two compilers that… | ||
| On the Semantic Expressiveness of Recursive Types | POPL 2021 | 2021-01-17 |
Paper proves iso-recursive types, equirecursive types, and a term-level fix are semantically equivalent by constructing three fully abstract compilers… | ||
| Universal Composability is Secure Compilation | PriSC 2020 | 2020-01-25 |
Claims a correspondence between universal composability and a robust compilation criterion: UC ↔ RHC equivalence. Argues that for every target attacker a… | ||
| Exorcising Spectres with Secure Compilers | PriSC 2020 | 2020-01-25 |
Ongoing work builds a formal semantics that pairs a standard non‑speculative semantics with a prediction oracle–driven speculative semantics and an attacker… | ||
| nothing matches | ||