Construction and visualization of branched covering spaces. - Sanaz Golbabaei; Lawrence Roy; Prashant Kumar; Eugene Zhang (SIGGRAPH Asia Technical Briefs, 2016)

Tensor field design in volumes. - Jonathan Palacios; Lawrence Roy; Prashant Kumar; Chen-Yuan Hsu; Weikai Chen 001; Chongyang Ma; Li-Yi Wei; Eugene Zhang (ACM Trans. Graph., 2017)

Interactive Design and Visualization of Branched Covering Spaces. - Lawrence Roy; Prashant Kumar; Sanaz Golbabaei; Yue Zhang 009; Eugene Zhang (IEEE Trans. Vis. Comput. Graph., 2018)

Robust and Fast Extraction of 3D Symmetric Tensor Field Topology. - Lawrence Roy; Prashant Kumar; Yue Zhang 009; Eugene Zhang (IEEE Trans. Vis. Comput. Graph., 2019)

Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions. - Ian McQuoid; Mike Rosulek; Lawrence Roy (IACR Cryptol. ePrint Arch., 2020)

Multi-Scale Topological Analysis of Asymmetric Tensor Fields on Surfaces. - Fariba Khan; Lawrence Roy; Eugene Zhang; Botong Qu; Shih-Hsuan Hung; Harry Yeh; Robert S. Laramee; Yue Zhang 009 (IEEE Trans. Vis. Comput. Graph., 2020)

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; et al. (EuroSys, 2021)

Batching Base Oblivious Transfers. - Ian McQuoid; Mike Rosulek; Lawrence Roy (IACR Cryptol. ePrint Arch., 2021)

Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits. - Mike Rosulek; Lawrence Roy (IACR Cryptol. ePrint Arch., 2021)

Large Message Homomorphic Secret Sharing from DCR and Applications. - Lawrence Roy; Jaspal Singh (IACR Cryptol. ePrint Arch., 2021)

Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction. - Botong Qu; Lawrence Roy; Yue Zhang 009; Eugene Zhang (IEEE Trans. Vis. Comput. Graph., 2021)

SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model. - Lawrence Roy (CRYPTO (1), 2022)

A Complete Characterization of Security for Linicrypt Block Cipher Modes. - Tommy Hollenberg; Mike Rosulek; Lawrence Roy (IACR Cryptol. ePrint Arch., 2022)

SoftSpokenOT: Communication-Computation Tradeoffs in OT Extension. - Lawrence Roy (IACR Cryptol. ePrint Arch., 2022)

Practical Privacy-Preserving Authentication for SSH. - Lawrence Roy; Stanislav Lyakhov; Yeongjin Jang; Mike Rosulek (IACR Cryptol. ePrint Arch., 2022)

A Universally Composable PAKE with Zero Communication Cost (And Why It Shouldn't Be Considered UC-Secure). - Lawrence Roy; Jiayu Xu 001 (IACR Cryptol. ePrint Arch., 2022)

Faster coercion-resistant e-voting by encrypted sorting. - Diego F. Aranha; Michele Battagliola; Lawrence Roy (IACR Cryptol. ePrint Arch., 2023)

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 (IACR Cryptol. ePrint Arch., 2023)

Two-Round Stateless Deterministic Two-Party Schnorr Signatures From Pseudorandom Correlation Functions. - Yashvanth Kondi; Claudio Orlandi; Lawrence Roy (IACR Cryptol. ePrint Arch., 2023)

Efficient Maliciously Secure Oblivious Exponentiations. - Carsten Baum; Jens Berlips; Walther Chen; Ivan Bjerre Damgård; Kevin M. Esvelt; Leonard Foner; Dana Gretton; Martin Kysel; Ronald L. Rivest; Lawrence Roy; Francesca Sage-Ling; Adi Shamir; et al. (IACR Commun. Cryptol., 2024)

Time-Based Cryptography From Weaker Assumptions: Randomness Beacons, Delay Functions and More. - Damiano Abram; Lawrence Roy; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2024)

Succinct Homomorphic Secret Sharing. - Damiano Abram; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2024)

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 (IACR Cryptol. ePrint Arch., 2024)

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 (IACR Cryptol. ePrint Arch., 2024)

Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity. - Ivan Damgård; Divya Ravi 001; Lawrence Roy; Daniel Tschudi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2024)

Under What Conditions Is Encrypted Key Exchange Actually Secure? - Jake Januzelli; Lawrence Roy; Jiayu Xu 001 (IACR Cryptol. ePrint Arch., 2024)

Rate-1 Arithmetic Garbling from Homomorphic Secret-Sharing. - Pierre Meyer; Claudio Orlandi; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2024)

Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. - Maciej Obremski; João Ribeiro 002; Lawrence Roy; François-Xavier Standaert; Daniele Venturi 001 (IACR Cryptol. ePrint Arch., 2024)

Information-Theoretic Random-Index PIR. - Sebastian Kolby; Lawrence Roy; Jure Sternad; Sophia Yakoubov (ITC, 2025)

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 (CRYPTO (6), 2025)

Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits. - Damiano Abram; Giulio Malavolta; Lawrence Roy (IACR Cryptol. ePrint Arch., 2025)

Key-Homomorphic Computations for RAM: Fully Succinct Randomised Encodings and More. - Damiano Abram; Giulio Malavolta; Lawrence Roy (IACR Cryptol. ePrint Arch., 2025)

Trapdoor Hash Functions and PIR from Low-Noise LPN. - Damiano Abram; Giulio Malavolta; Lawrence Roy (IACR Cryptol. ePrint Arch., 2025)

Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank. - Amik Raj Behera; Pierre Meyer; Claudio Orlandi; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)

New Upper and Lower Bounds for Perfectly Secure MPC. - Ivan Damgård; Shravani Patil; Arpita Patra; Lawrence Roy (IACR Cryptol. ePrint Arch., 2025)

Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities. - Jake Januzelli; Mike Rosulek; Lawrence Roy (IACR Cryptol. ePrint Arch., 2025)

Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR. - Pierre Meyer; Claudio Orlandi; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)