2025

1. C

   Key-Homomorphic Computations for RAM: Fully Succinct Randomised Encodings and More

   CRYPTO 2025, Santa Barbara , 2025
2. STOC

   Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits

   STOC 2025 (Recorded talk) , 2025
3. TPLC

   Laconic Function Evaluation for RAM from LWE (and How to Make it Adaptively Secure)

   TPLC: Theory and Practice of Laconic Cryptography 2025, Madrid , 2025

2024

1. EC

   Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output

   EUROCRYPT 2024, Zurich , 2024
2. Bocconi

   Cryptography from Planted Graphs: Security with Logarithmic-Size Messages

   Conceptual Challenges in AI: from ML to Average-Case Computation and Cryptography, Milan , 2024

2023

1. TCC

   Cryptography from Planted Graphs: Security with Logarithmic-Size Messages

   TCC 2023, Taipei , 2023
2. C

   Security-Preserving Distributed Samplers: How to Generate any CRS in One Round without Random Oracles

   CRYPTO 2023, Santa Barbara , 2023
3. NORDICRYPT

   A Story about Removing Trusted Setups in One Round

   NORDICRYPT 2023, Copenhagen , 2023

2022

1. C

   An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security

   CRYPTO 2022, Santa Barbara , 2022
2. TPMPC

   An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security

   TPMPC 2022, Aarhus , 2022
3. EC

   Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round

   EUROCRYPT 2022, Trondheim , 2022
4. PKC

   Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN

   PKC 2022 (online) , 2022

2021

1. CT-RSA

   Oblivious TLS via Multi-party Computation

   CT-RSA 2021 (online) , 2021