| 2026 | ISSAC | Fast Decomposition of Sparse Polynomials. | Mark Giesbrecht, Pascal Koiran, Saiyue Lyu, Daniel S. Roche |
| 2025 | ACNS | Optimal Communication Unbalanced Private Set Union. | Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche |
| 2024 | ISSAC | Fast interpolation and multiplication of unbalanced polynomials. | Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche |
| 2024 | ISSAC | Corrigimus, verificamus, vincimus: Ensuring algorithmic accuracy in an age of uncertainty. | Daniel S. Roche |
| 2022 | ISSAC | Random Primes without Primality Testing. | Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche |
| 2022 | ISSAC | Sparse Polynomial Interpolation and Division in Soft-linear Time. | Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche |
| 2022 | NDSS | Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). | Linsheng Liu, Daniel S. Roche, Austin Theriault, Arkady Yerukhimovich |
| 2021 | NDSS | Improving Signal's Sealed Sender. | Ian Martiny, Gabriel Kaptchuk, Adam J. Aviv, Daniel S. Roche, Eric Wustrow |
| 2020 | CHI | Twice as Nice? A Preliminary Evaluation of Double Android Unlock Patterns. | Timothy J. Forman, Daniel S. Roche, Adam J. Aviv |
| 2020 | ISSAC | Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. | Pascal Giorgi, Bruno Grenet, Daniel S. Roche |
| 2019 | CCS | Poster: Proofs of Retrievability with Low Server Storage. | Michael Hanling, Gaspard Anthoine, Jean-Guillaume Dumas, Aude Maignan, Clment Pernet, Daniel S. Roche |
| 2019 | ISSAC | LU Factorization with Errors. | Jean-Guillaume Dumas, Joris van der Hoeven, Clment Pernet, Daniel S. Roche |
| 2019 | ISSAC | Generic Reductions for In-place Polynomial Multiplication. | Pascal Giorgi, Bruno Grenet, Daniel S. Roche |
| 2019 | NDSS | rORAM: Efficient Range ORAM with O(log2 N) Locality. | Anrin Chakraborti, Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche, Radu Sion |
| 2018 | ASIACRYPT | New Instantiations of the CRYPTO 2017 Masking Schemes. | Pierre Karpman, Daniel S. Roche |
| 2018 | ISSAC | What Can (and Can't) we Do with Sparse Polynomials? | Daniel S. Roche |
| 2018 | ISSAC | Error Correction in Fast Matrix Multiplication and Inverse. | Daniel S. Roche |
| 2017 | CCS | Deterministic, Stash-Free Write-Only ORAM. | Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry |
| 2017 | NDSS | ObliviSync: Practical Oblivious File Backup and Synchronization. | Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche |
| 2016 | CCS | POPE: Partial Order Preserving Encoding. | Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich |
| 2016 | SP | A Practical Oblivious Map Data Structure with Secure Deletion and History Independence. | Daniel S. Roche, Adam J. Aviv, Seung Geol Choi |
| 2015 | ISSAC | Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication. | Andrew Arnold, Daniel S. Roche |
| 2014 | ISSAC | Sparse interpolation over finite fields via low-order roots of unity. | Andrew Arnold, Mark Giesbrecht, Daniel S. Roche |
| 2014 | ISSAC | Multivariate sparse interpolation using randomized Kronecker substitutions. | Andrew Arnold, Daniel S. Roche |
| 2013 | CASC | Faster Sparse Interpolation of Straight-Line Programs. | Andrew Arnold, Mark Giesbrecht, Daniel S. Roche |
| 2011 | ISSAC | Diversification improves interpolation. | Mark Giesbrecht, Daniel S. Roche |
| 2010 | ISAAC | Computing Sparse Multiples of Polynomials. | Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak |
| 2010 | ISSAC | An in-place truncated fourier transform and applications to polynomial multiplication. | David Harvey, Daniel S. Roche |
| 2009 | ISSAC | Space- and time-efficient polynomial multiplication. | Daniel S. Roche |
| 2008 | ISSAC | On lacunary polynomial perfect powers. | Mark Giesbrecht, Daniel S. Roche |