| 2026 | PKC | IND-CCA Lattice Threshold KEM Under 30 KiB. | Katharina Boudgoust, Rafal del Pino, Oleksandra Lapiha, Thomas Prest |
| 2025 | CCS | Poster: Efficient Threshold ML-DSA up to 6 Parties. | Sofa Celi, Rafal del Pino, Thomas Espitau, Guilhem Niot, Thomas Prest |
| 2024 | CRYPTO | Raccoon: A Masking-Friendly Signature Proven in the Probing Model. | Rafal del Pino, Shuichi Katsumata, Thomas Prest, Mlissa Rossi |
| 2023 | SP | High-Order Masking of Lattice Signatures in Quasilinear Time. | Rafal del Pino, Thomas Prest, Mlissa Rossi, Markku-Juhani O. Saarinen |
| 2022 | CRYPTO | A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling. | Rafal del Pino, Shuichi Katsumata |
| 2019 | PKC | Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts. | Rafal del Pino, Vadim Lyubashevsky, Gregor Seiler |
| 2018 | CCS | Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. | Rafal del Pino, Vadim Lyubashevsky, Gregor Seiler |
| 2018 | CRYPTO | Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. | Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafal del Pino, Jens Groth, Vadim Lyubashevsky |
| 2017 | CCS | Practical Quantum-Safe Voting from Lattices. | Rafal del Pino, Vadim Lyubashevsky, Gregory Neven, Gregor Seiler |
| 2017 | CRYPTO | Amortization with Fewer Equations for Proving Knowledge of Small Secrets. | Rafal del Pino, Vadim Lyubashevsky |
| 2016 | SCN | The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs. | Rafal del Pino, Vadim Lyubashevsky, David Pointcheval |