Lawrence Roy ldr709@gmail.com Postdoc, Aarhus University Updated: April 15, 2023

Research Interests

I research a range of topics related to secure multi-party computation, including oblivious transfer (OT), OT extension, garbled circuits, and homomorphic secret sharing. I am also interested in formal verification and proofs for cryptography and cybersecurity more generally.

Education

Thesis: “Communication-Efficient Secure Two-Party Computation From Minicrypt and OT”.
Advisor: Mike Rosulek.

Admitted following high school, undergraduate degree requirement waived.
Project: “A Complete Characterization of Security for Linicrypt Block Cipher Modes”.

Publications

I started my research in computer graphics. During my internship at IBM in 2018, I gained some experience in systems security, and its intersection with cryptography. I then switched fully to cryptography in 2019, though I maintain a side interest in systems security. These fields have different author ordering conventions.

Peer-Reviewed Publications

1.

Lawrence Roy and Jiayu Xu. “A Universally Composable PAKE with Zero Communication Cost (And Why It Shouldn’t Be Considered UC-Secure)”. In: PKC 2023, Part I. Ed. by Alexandra Boldyreva and Vladimir Kolesnikov. Springer, Heidelberg, May 2023. url: https://eprint.iacr.org/2022/1607

2.

Lawrence Roy. “SoftSpokenOT: Communication–Computation Tradeoffs in OT Extension”. In: CRYPTO 2022. Ed. by Yevgeniy Dodis and Thomas Shrimpton. Vol. 13507. LNCS. To be published. Springer, Heidelberg, Aug. 2022. url: https://eprint.iacr.org/2022/192

3.

Tommy Hollenberg, Mike Rosulek, and Lawrence Roy. “A Complete Characterization of Security for Linicrypt Block Cipher Modes”. In: CSF 2022 Computer Security Foundations Symposium. To be published. IEEE Computer Society Press, 2022

4.

Ian McQuoid, Mike Rosulek, and Lawrence Roy. “Batching Base Oblivious Transfers”. In: ASIACRYPT 2021. Ed. by Mehdi Tibouchi and Huaxiong Wang. Cham: Springer International Publishing, 2021, pp. 281–310. isbn: 978-3-030-92078-4. doi: 10.1007/978-3-030-92078-4_10. url: https://eprint.iacr.org/2021/682

5.

Honorable Mention for Best Paper!

Mike Rosulek and Lawrence Roy. “Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits”. In: CRYPTO 2021, Part I. Ed. by Tal Malkin and Chris Peikert. Vol. 12825. LNCS. Virtual Event: Springer, Heidelberg, Aug. 2021, pp. 94–124. doi: 10.1007/978-3-030-84242-0_5. url: https://eprint.iacr.org/2021/749

6.

Lawrence Roy and Jaspal Singh. “Large Message Homomorphic Secret Sharing from DCR and Applications”. In: CRYPTO 2021, Part III. Ed. by Tal Malkin and Chris Peikert. Vol. 12827. LNCS. Virtual Event: Springer, Heidelberg, Aug. 2021, pp. 687–717. doi: 10.1007/978-3-030-84252-9_23. url: https://eprint.iacr.org/2021/274

7.

Ian McQuoid, Mike Rosulek, and Lawrence Roy. “Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions”. In: ACM CCS 2020. Ed. by Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna. ACM Press, Nov. 2020, pp. 425–442. doi: 10.1145/3372297.3417870. url: https://eprint.iacr.org/2020/1043

8.

Lawrence Roy, Stan Lyakhov, Yeongjin Jang, and Mike Rosulek. “Practical Privacy-Preserving Authentication for SSH”. In: USENIX Security 2022. Ed. by Kevin R. B. Butler and Kurt Thomas. To be published. USENIX Association, Aug. 2022. url: https://eprint.iacr.org/2022/740

9.

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, and Wendel Voigt. “Confidential Computing for OpenPOWER”. In: Proceedings of the Sixteenth European Conference on Computer Systems. New York, NY, USA: Association for Computing Machinery, 2021, pp. 294–310. isbn: 9781450383349. url: https://doi.org/10.1145/3447786.3456243

10.

Yue Zhang, Lawrence Roy, Ritesh Sharma, and Eugene Zhang. “Maximum Number of Transition Points in 3D Linear Symmetric Tensor Fields”. In: Topological Methods in Data Analysis and Visualization V. Ed. by Hamish Carr, Issei Fujishiro, Filip Sadlo, and Shigeo Takahashi. Springer International Publishing, 2020, pp. 237–250. isbn: 978-3-030-43036-8. url: linear_3d_tensor_field_transition_point.pdf

11.

Botong Qu, Lawrence Roy, Yue Zhang, and Eugene Zhang. “Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction”. In: IEEE Transactions on Visualization and Computer Graphics (2020). url: https://arxiv.org/pdf/2009.04601

12.

Fariba Khan, Lawrence Roy, Eugene Zhang, Botong Qu, Shih-Hsuan Hung, Harry Yeh, Robert S Laramee, and Yue Zhang. “Multi-Scale Topological Analysis of Asymmetric Tensor Fields on Surfaces”. In: IEEE Transactions on Visualization and Computer Graphics 26.1 (2019), pp. 270–279. url: https://web.engr.oregonstate.edu/~zhange/images/2Dasymmetric_multiscale.pdf

13.

Lawrence Roy, Prashant Kumar, Yue Zhang, and Eugene Zhang. “Robust and Fast Extraction of 3D Symmetric Tensor Field Topology”. In: IEEE Transactions on Visualization and Computer Graphics 25.1 (2018), pp. 1102–1111. url: http://web.engr.oregonstate.edu/~zhange/images/3DTensorTopology_Detection.pdf

14.

Jonathan Palacios, Lawrence Roy, Prashant Kumar, Chen-Yuan Hsu, Weikai Chen, Chongyang Ma, Li-Yi Wei, and Eugene Zhang. “Tensor Field Design in Volumes”. In: ACM Trans. Graph. 36.6 (Nov. 2017). issn: 0730-0301. doi: 10.1145/3130800.3130844. url: https://web.engr.oregonstate.edu/~zhange/images/3Dtensor_design.pdf

15.

Lawrence Roy, Prashant Kumar, Sanaz Golbabaei, Yue Zhang, and Eugene Zhang. “Interactive Design and Visualization of Branched Covering Spaces”. In: IEEE Transactions on Visualization and Computer Graphics 24.1 (2017), pp. 843–852. url: http://web.engr.oregonstate.edu/~zhange/images/Paper_BCSVis.pdf

16.

Sanaz Golbabaei, Lawrence Roy, Prashant Kumar, and Eugene Zhang. “Construction and Visualization of Branched Covering Spaces”. In: SIGGRAPH ASIA 2016 Technical Briefs. SA ’16. Macau: Association for Computing Machinery, 2016. isbn: 9781450345415. doi: 10.1145/3005358.3005367

Preprint Publications

17.

Yashvanth Kondi, Claudio Orlandi, and Lawrence Roy. Two-Round Stateless Deterministic Two-Party Schnorr Signatures From Pseudorandom Correlation Functions. Cryptology ePrint Archive, Report 2023/216. https://eprint.iacr.org/2023/216. 2023

Presentations

Talks

Communication-Efficient Secure Two-Party Computation From Minimal Assumptions

SoftSpokenOT: Communication–Computation Tradeoffs in OT Extension
Video ($23min$)

Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits
Prerecorded Video ($25min$), Live Presentation ($10min$)

Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions ($10min$)

Interactive Design and Visualization of Branched Covering Spaces

Posters

Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits

Characterizing and Synthesizing CPA-Secure Block Cipher Modes

Tensor Field Design in Volumes

Service

Ad Hoc Reviewing

Other