Russell W. F. Lai
Orcid: 0000-0001-9126-1887
According to our database1,
Russell W. F. Lai
authored at least 54 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
Adaptive Special Soundness: Improved Knowledge Extraction by Adaptive Useful Challenge Sampling.
IACR Cryptol. ePrint Arch., 2024
IACR Commun. Cryptol., 2024
IACR Commun. Cryptol., 2024
Dataset, Noise Analysis, and Automated Parameter Estimation for Natural Steganography.
Proceedings of the ACM Workshop on Information Hiding and Multimedia Security, 2024
RoK, Paper, SISsors Toolkit for Lattice-Based Succinct Arguments - (Extended Abstract).
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024
2023
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
Proceedings of the Theory of Cryptography - 21st International Conference, 2023
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023
2022
Proc. Priv. Enhancing Technol., 2022
IACR Cryptol. ePrint Arch., 2022
Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable.
IACR Cryptol. ePrint Arch., 2022
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
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
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
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
IACR Cryptol. ePrint Arch., 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019
2018
IEEE Trans. Dependable Secur. Comput., 2018
IACR Cryptol. ePrint Arch., 2018
Proceedings of the 27th USENIX Security Symposium, 2018
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018
2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Proceedings of the 26th USENIX Security Symposium, 2017
2016
IACR Cryptol. ePrint Arch., 2016
Proceedings of the Security and Privacy in Communication Networks, 2016
Proceedings of the Network and System Security - 10th International Conference, 2016
Proceedings of the Paradigms in Cryptology - Mycrypt 2016. Malicious and Exploratory Cryptology, 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
2015
IACR Cryptol. ePrint Arch., 2015
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015
2014
Proceedings of the Information Security and Cryptology - 10th International Conference, 2014