Lawrence Roy

Orcid: 0009-0003-8436-0029

According to our database1, Lawrence Roy authored at least 43 papers between 2016 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Adaptively Secure, Universally Composable Distributed Generation of Discrete-Logarithm Based Keys.
IACR Cryptol. ePrint Arch., 2026

Simulating Noisy Leakage with Bounded Leakage: Simpler, Better, Faster.
IACR Cryptol. ePrint Arch., 2026

Computationally Succinct Authentication from DCR - Attribute-Based Laconic Function Evaluation and More.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

OneTwoPAKE: Two-Round Strong Asymmetric PAKE with Ideal Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

New Upper and Lower Bounds for Perfectly Secure MPC.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

Client-Server Homomorphic Secret Sharing in the CRS Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

2025
Trapdoor Hash Functions and PIR from Low-Noise LPN.
IACR Cryptol. ePrint Arch., 2025

An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast.
Proceedings of the Theory of Cryptography - 23rd International Conference, 2025

Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank.
Proceedings of the Theory of Cryptography - 23rd International Conference, 2025

Slightly Sublinear Trapdoor Hash Functions and PIR from Low-Noise LPN.
Proceedings of the Theory of Cryptography - 23rd International Conference, 2025

Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Under What Conditions Is Encrypted Key Exchange Actually Secure?
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Key-Homomorphic Computations for RAM: Fully Succinct Randomised Encodings and More.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Information-Theoretic Random-Index PIR.
Proceedings of the 6th Conference on Information-Theoretic Cryptography, 2025

2024
Time-Based Cryptography From Weaker Assumptions: Randomness Beacons, Delay Functions and More.
IACR Cryptol. ePrint Arch., 2024

Efficient Maliciously Secure Oblivious Exponentiations.
IACR Commun. Cryptol., 2024

Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Efficient Secure Communication over Dynamic Incomplete Networks with Minimal Connectivity.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Succinct Homomorphic Secret Sharing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
A Universally Composable PAKE with Zero Communication Cost - (And Why It Shouldn't Be Considered UC-Secure).
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Faster coercion-resistant e-voting by encrypted sorting.
Proceedings of the Eight International Joint Conference on Electronic Voting, 2023

Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

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

Practical Privacy-Preserving Authentication for SSH.
Proceedings of the 31st USENIX Security Symposium, 2022

A Complete Characterization of Security for Linicrypt Block Cipher Modes.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction.
IEEE Trans. Vis. Comput. Graph., 2021


Large Message Homomorphic Secret Sharing from DCR and Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Batching Base Oblivious Transfers.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Multi-Scale Topological Analysis of Asymmetric Tensor Fields on Surfaces.
IEEE Trans. Vis. Comput. Graph., 2020

Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Robust and Fast Extraction of 3D Symmetric Tensor Field Topology.
IEEE Trans. Vis. Comput. Graph., 2019

2018
Interactive Design and Visualization of Branched Covering Spaces.
IEEE Trans. Vis. Comput. Graph., 2018

2017
Tensor field design in volumes.
ACM Trans. Graph., 2017

2016
Construction and visualization of branched covering spaces.
Proceedings of the SIGGRAPH ASIA 2016, Macao, December 5-8, 2016 - Technical Briefs, 2016


  Loading...