Russell W. F. Lai

Orcid: 0000-0001-9126-1887

According to our database1, Russell W. F. Lai authored at least 47 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lattice-Based Timed Cryptography.
IACR Cryptol. ePrint Arch., 2024

Traitor Tracing without Trusted Authority from Registered Functional Encryption.
IACR Cryptol. ePrint Arch., 2024

2023
On Provable White-Box Security in the Strong Incompressibility Model.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

Efficient Laconic Cryptography from Learning With Errors.
IACR Cryptol. ePrint Arch., 2023

Lattice-based Succinct Arguments from Vanishing Polynomials.
IACR Cryptol. ePrint Arch., 2023

On Sustainable Ring-based Anonymous Systems.
IACR Cryptol. ePrint Arch., 2023

Chainable Functional Commitments for Unbounded-Depth Circuits.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract).
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Succinct Arguments: Constructions and Applications.
PhD thesis, 2022

On Defeating Graph Analysis of Anonymous Transactions.
Proc. Priv. Enhancing Technol., 2022

Quantum Rewinding for Many-Round Protocols.
IACR Cryptol. ePrint Arch., 2022

Functional Commitments for Circuits from Falsifiable Assumptions.
IACR Cryptol. ePrint Arch., 2022

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable.
IACR Cryptol. ePrint Arch., 2022

Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable - (Extended Abstract).
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Foundations of Ring Sampling.
Proc. Priv. Enhancing Technol., 2021

A Geometric Approach to Homomorphic Secret Sharing.
IACR Cryptol. ePrint Arch., 2021

Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices.
IACR Cryptol. ePrint Arch., 2021

Polynomial-Time Construction of Two-Channel Prefix-Free Codes with Given Codeword Lengths.
Proceedings of the IEEE Information Theory Workshop, 2021

On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
On Computational Shortcuts for Information-Theoretic PIR.
IACR Cryptol. ePrint Arch., 2020

Multi-Client Oblivious RAM with Poly-Logarithmic Communication.
IACR Cryptol. ePrint Arch., 2020

Threshold Password-Hardened Encryption Services.
IACR Cryptol. ePrint Arch., 2020

2019
Another Look at Anonymous Communication.
IEEE Trans. Dependable Secur. Comput., 2019

Omniring: Scaling Up Private Payments Without Trusted Setup - Formal Foundations and Constructions of Ring Confidential Transactions with Log-size Proofs.
IACR Cryptol. ePrint Arch., 2019

Succinct Arguments for Bilinear Group Arithmetic: Practical Structure-Preserving Cryptography.
IACR Cryptol. ePrint Arch., 2019

Incremental Proofs of Sequential Work.
IACR Cryptol. ePrint Arch., 2019

Efficient Invisible and Unlinkable Sanitizable Signatures.
IACR Cryptol. ePrint Arch., 2019

Decision Procedure for the Existence of Two-Channel Prefix-Free Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Subvector Commitments with Application to Succinct Arguments.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Omniring: Scaling Private Payments Without Trusted Setup.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Searchable Encryption over Feature-Rich Data.
IEEE Trans. Dependable Secur. Comput., 2018

Homomorphic Secret Sharing for Low Degree Polynomials.
IACR Cryptol. ePrint Arch., 2018

Optimal Succinct Arguments via Hidden Order Groups.
IACR Cryptol. ePrint Arch., 2018

Simple Password-Hardened Encryption Services.
Proceedings of the 27th USENIX Security Symposium, 2018

Multi-key Homomorphic Signatures Unforgeable Under Insider Corruption.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Efficient Sanitizable Signatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2017

Forward-Secure Searchable Encryption on Labeled Bipartite Graphs.
IACR Cryptol. ePrint Arch., 2017

Phoenix: Rebirth of a Cryptographic Password-Hardening Service.
Proceedings of the 26th USENIX Security Symposium, 2017

2016
A Zoo of Homomorphic Signatures: Multi-Key and Key-Homomorphism.
IACR Cryptol. ePrint Arch., 2016

Parallel and Dynamic Structured Encryption.
Proceedings of the Security and Privacy in Communication Networks, 2016

Privacy Preserving Credit Systems.
Proceedings of the Network and System Security - 10th International Conference, 2016

Another Look at Anonymous Communication - Security and Modular Constructions.
Proceedings of the Paradigms in Cryptology - Mycrypt 2016. Malicious and Exploratory Cryptology, 2016

Cryptography for Parallel RAM from Indistinguishability Obfuscation.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Computation-Trace Indistinguishability Obfuscation and its Applications.
IACR Cryptol. ePrint Arch., 2015

Structured Encryption with Non-interactive Updates and Parallel Traversal.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014
Trapdoors for Ideal Lattices with Applications.
Proceedings of the Information Security and Cryptology - 10th International Conference, 2014


  Loading...