.- Zero-Knowledge; Hardware and Embedded Systems.
.- Polylogarithmic Proofs for Multilinears over Binary Towers.
.- Cyclo: Lightweight Lattice-based Folding via Partial Range Checks.
.- Soloist: Distributed SNARK for R1CS with Constant Proof Size.
.- Query-Optimal IOPPs for Linear-Time Encodable Codes.
.- Jagged Polynomial Commitments (or: How to Stack Multilinears).
.- Spectra: Interval-Agnostic Vector Range Argument for Unstructured Range Assertions.
.- Dynark: Making Groth16 Dynamic.
.- Sum-check protocol for approximate computations.
.- Special Soundness and Binding Properties: A Framework for Tightly Secure zk-SNARKs.
.- $k$-out-of-$n$ Proofs and Applications to Privacy-Preserving Cryptocurrencies.
.- Robust Non-Interactive Zero-Knowledge Combiners.
.- Dynamic zk-SNARKs (with Applications to Sparse zk-SNARKs and IVC).
.- Critical Rounds in Multi-Round Proofs: Proof of Partial Knowledge and Trapdoor Commitments.
.- How to Prove Post-Quantum Security for Succinct Non-Interactive Reductions.
.- The Black-Box Simulation Barrier Persists in a Fully Quantum World.
.- A Modular Approach to Succinct Arguments for QMA.
.- On the Security of Linear Secret Sharing with General Noisy Side-Channel Leakage.
.- PERSEUS – Probabilistic Evaluation of Random probing SEcurity Using efficient Sampling.
.- PaCMan – Partition-Code Masking for Combined Security.
.- Single-Trace Key Recovery Attacks on HQC Using Valid and Invalid Ciphertexts.
.- Accelerating and verifying constant-time modular inversion.