default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLawrence Roy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]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, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu:
Efficient Maliciously Secure Oblivious Exponentiations. IACR Commun. Cryptol. 1(3): 10 (2024)- [c16]Maciej Obremski, João Ribeiro, Lawrence Roy, François-Xavier Standaert, Daniele Venturi:
Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. CRYPTO (6) 2024: 461-491 - [c15]Damiano Abram, Lawrence Roy, Peter Scholl:
Succinct Homomorphic Secret Sharing. EUROCRYPT (6) 2024: 301-330 - [c14]Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl:
Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing. TCC (4) 2024: 71-97 - [c13]Ivan Damgård, Divya Ravi, Lawrence Roy, Daniel Tschudi, Sophia Yakoubov:
Efficient Secure Communication over Dynamic Incomplete Networks with Minimal Connectivity. TCC (4) 2024: 266-292 - [i21]Jake Januzelli, Lawrence Roy, Jiayu Xu:
Under What Conditions Is Encrypted Key Exchange Actually Secure? IACR Cryptol. ePrint Arch. 2024: 324 (2024) - [i20]Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl:
One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. IACR Cryptol. ePrint Arch. 2024: 490 (2024) - [i19]Damiano Abram, Lawrence Roy, Mark Simkin:
Time-Based Cryptography From Weaker Assumptions: Randomness Beacons, Delay Functions and More. IACR Cryptol. ePrint Arch. 2024: 769 (2024) - [i18]Damiano Abram, Lawrence Roy, Peter Scholl:
Succinct Homomorphic Secret Sharing. IACR Cryptol. ePrint Arch. 2024: 814 (2024) - [i17]Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl:
Rate-1 Arithmetic Garbling from Homomorphic Secret-Sharing. IACR Cryptol. ePrint Arch. 2024: 820 (2024) - [i16]Ivan Damgård, Divya Ravi, Lawrence Roy, Daniel Tschudi, Sophia Yakoubov:
Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity. IACR Cryptol. ePrint Arch. 2024: 972 (2024) - [i15]Maciej Obremski, João Ribeiro, Lawrence Roy, François-Xavier Standaert, Daniele Venturi:
Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. IACR Cryptol. ePrint Arch. 2024: 1009 (2024) - [i14]Carsten Baum, Jens Berlips, Walther Chen, Ivan Damgård, Kevin M. Esvelt, Leonard Foner, Dana Gretton, Martin Kysel, Ronald L. Rivest, Lawrence Roy, Francesca Sage-Ling, Adi Shamir, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu:
Efficient Maliciously Secure Oblivious Exponentiations. IACR Cryptol. ePrint Arch. 2024: 1613 (2024) - [i13]Ran Cohen, Jack Doerner, Eysa Lee, Anna Lysyanskaya, Lawrence Roy:
An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast. IACR Cryptol. ePrint Arch. 2024: 1807 (2024) - 2023
- [c12]Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl:
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. CRYPTO (5) 2023: 581-615 - [c11]Yashvanth Kondi, Claudio Orlandi, Lawrence Roy:
Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions. CRYPTO (1) 2023: 646-677 - [c10]Lawrence Roy, Jiayu Xu:
A Universally Composable PAKE with Zero Communication Cost - (And Why It Shouldn't Be Considered UC-Secure). Public Key Cryptography (1) 2023: 714-743 - [i12]Yashvanth Kondi, Claudio Orlandi, Lawrence Roy:
Two-Round Stateless Deterministic Two-Party Schnorr Signatures From Pseudorandom Correlation Functions. IACR Cryptol. ePrint Arch. 2023: 216 (2023) - [i11]Diego F. Aranha, Michele Battagliola, Lawrence Roy:
Faster coercion-resistant e-voting by encrypted sorting. IACR Cryptol. ePrint Arch. 2023: 837 (2023) - [i10]Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl:
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head. IACR Cryptol. ePrint Arch. 2023: 996 (2023) - 2022
- [c9]Lawrence Roy:
SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model. CRYPTO (1) 2022: 657-687 - [c8]Tommy Hollenberg, Mike Rosulek, Lawrence Roy:
A Complete Characterization of Security for Linicrypt Block Cipher Modes. CSF 2022: 439-454 - [c7]Lawrence Roy, Stanislav Lyakhov, Yeongjin Jang, Mike Rosulek:
Practical Privacy-Preserving Authentication for SSH. USENIX Security Symposium 2022: 3345-3362 - [i9]Lawrence Roy:
SoftSpokenOT: Communication-Computation Tradeoffs in OT Extension. IACR Cryptol. ePrint Arch. 2022: 192 (2022) - [i8]Lawrence Roy, Stanislav Lyakhov, Yeongjin Jang, Mike Rosulek:
Practical Privacy-Preserving Authentication for SSH. IACR Cryptol. ePrint Arch. 2022: 740 (2022) - [i7]Tommy Hollenberg, Mike Rosulek, Lawrence Roy:
A Complete Characterization of Security for Linicrypt Block Cipher Modes. IACR Cryptol. ePrint Arch. 2022: 1033 (2022) - [i6]Lawrence Roy, Jiayu Xu:
A Universally Composable PAKE with Zero Communication Cost (And Why It Shouldn't Be Considered UC-Secure). IACR Cryptol. ePrint Arch. 2022: 1607 (2022) - 2021
- [j5]Botong Qu, Lawrence Roy, Yue Zhang, Eugene Zhang:
Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction. IEEE Trans. Vis. Comput. Graph. 27(2): 583-592 (2021) - [c6]Ian McQuoid, Mike Rosulek, Lawrence Roy:
Batching Base Oblivious Transfers. ASIACRYPT (3) 2021: 281-310 - [c5]Mike Rosulek, Lawrence Roy:
Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits. CRYPTO (1) 2021: 94-124 - [c4]Lawrence Roy, Jaspal Singh:
Large Message Homomorphic Secret Sharing from DCR and Applications. CRYPTO (3) 2021: 687-717 - [c3]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:
Confidential computing for OpenPOWER. EuroSys 2021: 294-310 - [i5]Lawrence Roy, Jaspal Singh:
Large Message Homomorphic Secret Sharing from DCR and Applications. IACR Cryptol. ePrint Arch. 2021: 274 (2021) - [i4]Ian McQuoid, Mike Rosulek, Lawrence Roy:
Batching Base Oblivious Transfers. IACR Cryptol. ePrint Arch. 2021: 682 (2021) - [i3]Mike Rosulek, Lawrence Roy:
Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits. IACR Cryptol. ePrint Arch. 2021: 749 (2021) - 2020
- [j4]Fariba Khan, Lawrence Roy, Eugene Zhang, Botong Qu, Shih-Hsuan Hung, Harry Yeh, Robert S. Laramee, Yue Zhang:
Multi-Scale Topological Analysis of Asymmetric Tensor Fields on Surfaces. IEEE Trans. Vis. Comput. Graph. 26(1): 270-279 (2020) - [c2]Ian McQuoid, Mike Rosulek, Lawrence Roy:
Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions. CCS 2020: 425-442 - [i2]Botong Qu, Lawrence Roy, Yue Zhang, Eugene Zhang:
Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction. CoRR abs/2009.04601 (2020) - [i1]Ian McQuoid, Mike Rosulek, Lawrence Roy:
Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions. IACR Cryptol. ePrint Arch. 2020: 1043 (2020)
2010 – 2019
- 2019
- [j3]Lawrence Roy, Prashant Kumar, Yue Zhang, Eugene Zhang:
Robust and Fast Extraction of 3D Symmetric Tensor Field Topology. IEEE Trans. Vis. Comput. Graph. 25(1): 1102-1111 (2019) - 2018
- [j2]Lawrence Roy, Prashant Kumar, Sanaz Golbabaei, Yue Zhang, Eugene Zhang:
Interactive Design and Visualization of Branched Covering Spaces. IEEE Trans. Vis. Comput. Graph. 24(1): 843-852 (2018) - 2017
- [j1]Jonathan Palacios, Lawrence Roy, Prashant Kumar, Chen-Yuan Hsu, Weikai Chen, Chongyang Ma, Li-Yi Wei, Eugene Zhang:
Tensor field design in volumes. ACM Trans. Graph. 36(6): 188:1-188:15 (2017) - 2016
- [c1]Sanaz Golbabaei, Lawrence Roy, Prashant Kumar, Eugene Zhang:
Construction and visualization of branched covering spaces. SIGGRAPH Asia Technical Briefs 2016: 16
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
