PIC

Lawrence Roy

Ph.D. Student, Oregon State University

Updated:
August 31, 2021

Cryptography Multi-Party Computation Cybersecurity

 GitHub
github.com/ldr709
 GitLab
gitlab.com/ldr709
 Email
ldr709@gmail.com
 Google Scholar
tinyurl.com/RoyGScholar

Education

Sep. 2017 – Ongoing

Ph.D. in Computer Science – Cryptography Oregon State University

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.
Advisor: Mike Rosulek.

Sep. 2017 – Mar. 2020

M.S. in Computer Science – Cryptography Oregon State University

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

Publications

I previously did research in computer graphics, before switching to cryptography. I also contributed to some systems research during my internship at IBM in 2018. These fields have different author ordering conventions.

Peer-Reviewed Publications

2019 – Present

Cryptography Authors are ordered alphabetically.
1.
Ian McQuoid, Mike Rosulek, and Lawrence Roy. “Batching Base Oblivious Transfers”. In: ASIACRYPT 2021. LNCS. To be published. Springer, Heidelberg, Dec. 2021. url: https://eprint.iacr.org/2021/682
2.

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
3.
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
4.
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

2018

Systems Authors are ordered by contribution.
5.
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

2016 – 2019

Computer Graphics Authors are ordered by contribution.
6.
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: https://yuezhang2016.files.wordpress.com/2018/08/linear_3d_tensor_field_transition_point.pdf
7.
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
8.
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
9.
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
10.
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
11.
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
12.
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

Presentations

Talks

Aug. 2021

IACR Crypto Virtual

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

Nov. 2020

ACM Conference on Computer and Communications Security Virtual

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

Oct. 2017

IEEE Visualization Conference Phoenix, Arizona

Interactive Design and Visualization of Branched Covering Spaces

Posters

Jul. 2021

DOE CSGF Program Review Virtual

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

Jul. 2019

DOE CSGF Program Review Arlington, Virginia

Characterizing and Synthesizing CPA-Secure Block Cipher Modes

Feb. 2018

Oregon State University Graduate Research Showcase Corvallis, Oregon

Tensor Field Design in Volumes

Service

Ad Hoc Reviewing

2021

IACR Crypto

2020

IACR Crypto, Conference on Security and Cryptography for Networks

2019

ACM Transactions on Graphics, IEEE Transactions on Visualization and Computer Graphics

2018

SIGGRAPH, ACM Transactions on Graphics

2017

Pacific Graphics, Graphical Models, Computer Graphics Forum

Other

Oct. 2020

Challenge Author, DamCTF Virtual

Oct. 2017

Student Volunteer, IEEE Visualization Conference Phoenix, Arizona


Proudly compiled from LATEX source with tex4ht.