| 2026 | CRYPTO | Adaptively Secure, Universally Composable Distributed Generation of Discrete-Logarithm Based Keys from Standard Assumptions. | Hanna Ek, Kelsey Melissaris, Lawrence Roy |
| 2026 | EuroCrypt | Client-Server Homomorphic Secret Sharing in the CRS Model. | Damiano Abram, Geoffroy Couteau, Lalita Devadas, Aditya Hegde, Abhishek Jain, Lawrence Roy, Sacha Servan-Schreiber |
| 2026 | EuroCrypt | New Upper and Lower Bounds for Perfectly Secure MPC. | Ivan Damgrd, Shravani Patil, Arpita Patra, Lawrence Roy |
| 2026 | EuroCrypt | OneTwoPAKE: Two-Round Strong Asymmetric PAKE with Ideal Security. | Yashvanth Kondi, Ian McQuoid, Kelsey Melissaris, Claudio Orlandi, Lawrence Roy, LaKyah Tyner |
| 2026 | EuroCrypt | Computationally Succinct Authentication from DCR - Attribute-Based Laconic Function Evaluation and More. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2025 | CRYPTO | Key-Homomorphic Computations for RAM: Fully Succinct Randomised Encodings and More. | Damiano Abram, Giulio Malavolta, Lawrence Roy |
| 2025 | CRYPTO | Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures. | Carsten Baum, Ward Beullens, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Kloo, Christian Majenz, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl |
| 2025 | CRYPTO | Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities. | Jake Januzelli, Mike Rosulek, Lawrence Roy |
| 2025 | CRYPTO | Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2025 | EuroCrypt | Under What Conditions Is Encrypted Key Exchange Actually Secure? | Jake Januzelli, Lawrence Roy, Jiayu Xu |
| 2025 | STOC | Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits. | Damiano Abram, Giulio Malavolta, Lawrence Roy |
| 2025 | TCC | Slightly Sublinear Trapdoor Hash Functions and PIR from Low-Noise LPN. | Damiano Abram, Giulio Malavolta, Lawrence Roy |
| 2025 | TCC | Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank. | Amik Raj Behera, Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2025 | TCC | An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast. | Ran Cohen, Jack Doerner, Eysa Lee, Anna Lysyanskaya, Lawrence Roy |
| 2024 | ASIACRYPT | One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. | Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl |
| 2024 | CRYPTO | Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. | Maciej Obremski, Joo Ribeiro, Lawrence Roy, Franois-Xavier Standaert, Daniele Venturi |
| 2024 | EuroCrypt | Succinct Homomorphic Secret Sharing. | Damiano Abram, Lawrence Roy, Peter Scholl |
| 2024 | TCC | Efficient Secure Communication over Dynamic Incomplete Networks with Minimal Connectivity. | Ivan Damgrd, Divya Ravi, Lawrence Roy, Daniel Tschudi, Sophia Yakoubov |
| 2024 | TCC | Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2023 | CRYPTO | Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. | Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Kloo, Emmanuela Orsini, Lawrence Roy, Peter Scholl |
| 2023 | CRYPTO | Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions. | Yashvanth Kondi, Claudio Orlandi, Lawrence Roy |
| 2023 | PKC | A Universally Composable PAKE with Zero Communication Cost - (And Why It Shouldn't Be Considered UC-Secure). | Lawrence Roy, Jiayu Xu |
| 2022 | CRYPTO | SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model. | Lawrence Roy |
| 2021 | ASIACRYPT | Batching Base Oblivious Transfers. | Ian McQuoid, Mike Rosulek, Lawrence Roy |
| 2021 | CRYPTO | Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits. | Mike Rosulek, Lawrence Roy |
| 2021 | CRYPTO | Large Message Homomorphic Secret Sharing from DCR and Applications. | Lawrence Roy, Jaspal Singh |
| 2021 | EuroSys | Confidential computing for OpenPOWER. | Guerney D. H. Hunt, Ramachandra Pai, Michael V. Le, Hani Jamjoom, Sukadev Bhattiprolu, Rick Boivie, Laurent Dufour, Brad Frey, Mohit Kapur, Kenneth A. Goldman, Ryan Grimm, Janani Janakirman, John M. Ludden, Paul Mackerras, Cathy May, Elaine R. Palmer, Bharata Bhasker Rao, Lawrence Roy, William A. Starke, Jeff Stuecheli, Enriquillo Valdez, Wendel Voigt |
| 2020 | CCS | Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions. | Ian McQuoid, Mike Rosulek, Lawrence Roy |
| 2016 | SIGGRAPH | Construction and visualization of branched covering spaces. | Sanaz Golbabaei, Lawrence Roy, Prashant Kumar, Eugene Zhang |