![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Russell W. F. Lai
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c34]Ivy K. Y. Woo
, Sheung Yiu
, Hoover H. F. Yin
, Russell W. F. Lai
:
Dataset, Noise Analysis, and Automated Parameter Estimation for Natural Steganography. IH&MMSec 2024: 13-18 - [i31]Christoph Egger, Russell W. F. Lai, Viktoria Ronge, Ivy K. Y. Woo, Hoover H. F. Yin
:
On Defeating Graph Analysis of Anonymous Transactions. CoRR abs/2402.18755 (2024) - [i30]Pedro Branco, Russell W. F. Lai, Monosij Maitra, Giulio Malavolta, Ahmadreza Rahimi, Ivy K. Y. Woo:
Traitor Tracing without Trusted Authority from Registered Functional Encryption. IACR Cryptol. ePrint Arch. 2024: 179 (2024) - [i29]Russell W. F. Lai, Giulio Malavolta:
Lattice-Based Timed Cryptography. IACR Cryptol. ePrint Arch. 2024: 540 (2024) - [i28]Cecilia Boschini, Darya Kaviani, Russell W. F. Lai, Giulio Malavolta, Akira Takahashi, Mehdi Tibouchi:
Ringtail: Practical Two-Round Threshold Signatures from Learning with Errors. IACR Cryptol. ePrint Arch. 2024: 1113 (2024) - 2023
- [j5]Estuardo Alpirez Bock, Chris Brzuska, Russell W. F. Lai
:
On Provable White-Box Security in the Strong Incompressibility Model. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(4): 167-187 (2023) - [c33]Valerio Cini, Russell W. F. Lai
, Giulio Malavolta
:
Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract). CRYPTO (2) 2023: 72-105 - [c32]Russell W. F. Lai
, Giulio Malavolta
:
Lattice-Based Timed Cryptography. CRYPTO (5) 2023: 782-804 - [c31]Sherman S. M. Chow, Christoph Egger
, Russell W. F. Lai
, Viktoria Ronge, Ivy K. Y. Woo
:
On Sustainable Ring-Based Anonymous Systems. CSF 2023: 568-583 - [c30]Nico Döttling, Dimitris Kolonelos, Russell W. F. Lai
, Chuanwei Lin, Giulio Malavolta
, Ahmadreza Rahimi:
Efficient Laconic Cryptography from Learning with Errors. EUROCRYPT (3) 2023: 417-446 - [c29]David Balbás
, Dario Catalano
, Dario Fiore
, Russell W. F. Lai
:
Chainable Functional Commitments for Unbounded-Depth Circuits. TCC (3) 2023: 363-393 - [i27]Nico Döttling, Dimitris Kolonelos, Russell W. F. Lai, Chuanwei Lin, Giulio Malavolta, Ahmadreza Rahimi:
Efficient Laconic Cryptography from Learning With Errors. IACR Cryptol. ePrint Arch. 2023: 404 (2023) - [i26]Sherman S. M. Chow, Christoph Egger, Russell W. F. Lai, Viktoria Ronge, Ivy K. Y. Woo:
On Sustainable Ring-based Anonymous Systems. IACR Cryptol. ePrint Arch. 2023: 743 (2023) - [i25]Estuardo Alpirez Bock, Chris Brzuska, Russell W. F. Lai:
On Provable White-Box Security in the Strong Incompressibility Model. IACR Cryptol. ePrint Arch. 2023: 1007 (2023) - [i24]Valerio Cini, Russell W. F. Lai, Giulio Malavolta:
Lattice-based Succinct Arguments from Vanishing Polynomials. IACR Cryptol. ePrint Arch. 2023: 1405 (2023) - 2022
- [b1]Russell W. F. Lai:
Succinct Arguments: Constructions and Applications. University of Erlangen-Nuremberg, Germany, 2022 - [j4]Christoph Egger
, Russell W. F. Lai
, Viktoria Ronge, Ivy K. Y. Woo
, Hoover H. F. Yin
:
On Defeating Graph Analysis of Anonymous Transactions. Proc. Priv. Enhancing Technol. 2022(3): 538-557 (2022) - [c28]Martin R. Albrecht, Valerio Cini, Russell W. F. Lai
, Giulio Malavolta
, Sri Aravinda Krishnan Thyagarajan
:
Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable - (Extended Abstract). CRYPTO (2) 2022: 102-132 - [c27]Hoover H. F. Yin
, Harry W. H. Wong
, Mehrdad Tahernia, Russell W. F. Lai
:
Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes. ISIT 2022: 1-6 - [c26]Russell W. F. Lai
, Giulio Malavolta
, Nicholas Spooner:
Quantum Rewinding for Many-Round Protocols. TCC (1) 2022: 80-109 - [i23]Hoover H. F. Yin
, Harry W. H. Wong
, Mehrdad Tahernia, Russell W. F. Lai:
Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes. CoRR abs/2205.05122 (2022) - [i22]Christoph Egger, Russell W. F. Lai, Viktoria Ronge, Ivy K. Y. Woo, Hoover H. F. Yin:
On Defeating Graph Analysis of Anonymous Transactions. IACR Cryptol. ePrint Arch. 2022: 132 (2022) - [i21]Russell W. F. Lai, Giulio Malavolta, Nicholas Spooner:
Quantum Rewinding for Many-Round Protocols. IACR Cryptol. ePrint Arch. 2022: 889 (2022) - [i20]Martin R. Albrecht, Valerio Cini, Russell W. F. Lai, Giulio Malavolta, Sri Aravinda Krishnan Thyagarajan:
Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable. IACR Cryptol. ePrint Arch. 2022: 941 (2022) - [i19]David Balbás, Dario Catalano, Dario Fiore, Russell W. F. Lai:
Functional Commitments for Circuits from Falsifiable Assumptions. IACR Cryptol. ePrint Arch. 2022: 1365 (2022) - 2021
- [j3]Viktoria Ronge, Christoph Egger
, Russell W. F. Lai
, Dominique Schröder, Hoover H. F. Yin
:
Foundations of Ring Sampling. Proc. Priv. Enhancing Technol. 2021(3): 265-288 (2021) - [c25]Martin R. Albrecht, Russell W. F. Lai
:
Subtractive Sets over Cyclotomic Rings - Limits of Schnorr-Like Arguments over Lattices. CRYPTO (2) 2021: 519-548 - [c24]Hoover H. F. Yin
, Xishi Wang, Ka Hei Ng, Russell W. F. Lai
, Lucien K. L. Ng, Jack P. K. Ma
:
On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels. ISIT 2021: 2024-2029 - [c23]Hoover H. F. Yin
, Ka Hei Ng, Yu Ting Shing, Russell W. F. Lai
, Xishi Wang:
Polynomial-Time Construction of Two-Channel Prefix-Free Codes with Given Codeword Lengths. ITW 2021: 1-6 - [c22]Yuval Ishai, Russell W. F. Lai
, Giulio Malavolta
:
A Geometric Approach to Homomorphic Secret Sharing. Public Key Cryptography (2) 2021: 92-119 - [i18]Hoover H. F. Yin, Xishi Wang, Ka Hei Ng, Russell W. F. Lai, Lucien K. L. Ng, Jack P. K. Ma:
On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels. CoRR abs/2105.03606 (2021) - [i17]Martin R. Albrecht, Russell W. F. Lai:
Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices. IACR Cryptol. ePrint Arch. 2021: 202 (2021) - [i16]Yuval Ishai, Russell W. F. Lai, Giulio Malavolta:
A Geometric Approach to Homomorphic Secret Sharing. IACR Cryptol. ePrint Arch. 2021: 260 (2021) - 2020
- [c21]Sherman S. M. Chow
, Katharina Fech, Russell W. F. Lai
, Giulio Malavolta
:
Multi-client Oblivious RAM with Poly-logarithmic Communication. ASIACRYPT (2) 2020: 160-190 - [c20]Julian Brost, Christoph Egger
, Russell W. F. Lai
, Fritz Schmid, Dominique Schröder
, Markus Zoppelt:
Threshold Password-Hardened Encryption Services. CCS 2020: 409-424 - [c19]Matthew M. Hong, Yuval Ishai, Victor I. Kolobov, Russell W. F. Lai
:
On Computational Shortcuts for Information-Theoretic PIR. TCC (1) 2020: 504-534 - [i15]Matthew M. Hong, Yuval Ishai, Victor I. Kolobov, Russell W. F. Lai:
On Computational Shortcuts for Information-Theoretic PIR. IACR Cryptol. ePrint Arch. 2020: 1429 (2020) - [i14]Viktoria Ronge, Christoph Egger, Russell W. F. Lai, Dominique Schröder, Hoover H. F. Yin:
Foundations of Ring Sampling. IACR Cryptol. ePrint Arch. 2020: 1550 (2020) - [i13]Sherman S. M. Chow, Katharina Fech, Russell W. F. Lai, Giulio Malavolta:
Multi-Client Oblivious RAM with Poly-Logarithmic Communication. IACR Cryptol. ePrint Arch. 2020: 1551 (2020) - [i12]Julian Brost, Christoph Egger, Russell W. F. Lai, Fritz Schmid, Dominique Schröder, Markus Zoppelt:
Threshold Password-Hardened Encryption Services. IACR Cryptol. ePrint Arch. 2020: 1552 (2020)
2010 – 2019
- 2019
- [j2]Russell W. F. Lai
, Kam-Fung Cheung
, Sherman S. M. Chow
, Anthony Man-Cho So
:
Another Look at Anonymous Communication. IEEE Trans. Dependable Secur. Comput. 16(5): 731-742 (2019) - [c18]Russell W. F. Lai
, Viktoria Ronge, Tim Ruffing, Dominique Schröder
, Sri Aravinda Krishnan Thyagarajan
, Jiafan Wang:
Omniring: Scaling Private Payments Without Trusted Setup. CCS 2019: 31-48 - [c17]Russell W. F. Lai
, Giulio Malavolta
, Viktoria Ronge:
Succinct Arguments for Bilinear Group Arithmetic: Practical Structure-Preserving Cryptography. CCS 2019: 2057-2074 - [c16]Russell W. F. Lai
, Giulio Malavolta
:
Subvector Commitments with Application to Succinct Arguments. CRYPTO (1) 2019: 530-560 - [c15]Nico Döttling, Russell W. F. Lai
, Giulio Malavolta
:
Incremental Proofs of Sequential Work. EUROCRYPT (2) 2019: 292-323 - [c14]Hoover H. F. Yin
, Ka Hei Ng
, Yu Ting Shing, Russell W. F. Lai
, Xishi Wang:
Decision Procedure for the Existence of Two-Channel Prefix-Free Codes. ISIT 2019: 1522-1526 - [c13]Xavier Bultel, Pascal Lafourcade
, Russell W. F. Lai
, Giulio Malavolta
, Dominique Schröder
, Sri Aravinda Krishnan Thyagarajan
:
Efficient Invisible and Unlinkable Sanitizable Signatures. Public Key Cryptography (1) 2019: 159-189 - [i11]Hoover H. F. Yin, Ka Hei Ng, Yu Ting Shing, Russell W. F. Lai, Xishi Wang:
Decision Procedure for the Existence of Two-Channel Prefix-Free Codes. CoRR abs/1904.12112 (2019) - [i10]Russell W. F. Lai, Viktoria Ronge, Tim Ruffing, Dominique Schröder, Sri Aravinda Krishnan Thyagarajan, Jiafan Wang:
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: 580 (2019) - [i9]Xavier Bultel, Pascal Lafourcade, Russell W. F. Lai, Giulio Malavolta, Dominique Schröder, Sri Aravinda Krishnan Thyagarajan:
Efficient Invisible and Unlinkable Sanitizable Signatures. IACR Cryptol. ePrint Arch. 2019: 648 (2019) - [i8]Nico Döttling, Russell W. F. Lai, Giulio Malavolta:
Incremental Proofs of Sequential Work. IACR Cryptol. ePrint Arch. 2019: 650 (2019) - [i7]Russell W. F. Lai, Giulio Malavolta, Viktoria Ronge:
Succinct Arguments for Bilinear Group Arithmetic: Practical Structure-Preserving Cryptography. IACR Cryptol. ePrint Arch. 2019: 969 (2019) - 2018
- [j1]Qian Wang
, Meiqi He, Minxin Du
, Sherman S. M. Chow
, Russell W. F. Lai, Qin Zou
:
Searchable Encryption over Feature-Rich Data. IEEE Trans. Dependable Secur. Comput. 15(3): 496-510 (2018) - [c12]Russell W. F. Lai
, Giulio Malavolta
, Dominique Schröder
:
Homomorphic Secret Sharing for Low Degree Polynomials. ASIACRYPT (3) 2018: 279-309 - [c11]Russell W. F. Lai
, Raymond K. H. Tai, Harry W. H. Wong
, Sherman S. M. Chow:
Multi-key Homomorphic Signatures Unforgeable Under Insider Corruption. ASIACRYPT (2) 2018: 465-492 - [c10]Russell W. F. Lai, Christoph Egger, Manuel Reinert, Sherman S. M. Chow, Matteo Maffei, Dominique Schröder:
Simple Password-Hardened Encryption Services. USENIX Security Symposium 2018: 1405-1421 - [i6]Russell W. F. Lai, Giulio Malavolta:
Optimal Succinct Arguments via Hidden Order Groups. IACR Cryptol. ePrint Arch. 2018: 705 (2018) - [i5]Russell W. F. Lai, Giulio Malavolta, Dominique Schröder:
Homomorphic Secret Sharing for Low Degree Polynomials. IACR Cryptol. ePrint Arch. 2018: 1065 (2018) - 2017
- [c9]Russell W. F. Lai
, Sherman S. M. Chow
:
Forward-Secure Searchable Encryption on Labeled Bipartite Graphs. ACNS 2017: 478-497 - [c8]Russell W. F. Lai, Christoph Egger, Dominique Schröder, Sherman S. M. Chow:
Phoenix: Rebirth of a Cryptographic Password-Hardening Service. USENIX Security Symposium 2017: 899-916 - [i4]Russell W. F. Lai, Tao Zhang, Sherman S. M. Chow, Dominique Schröder:
Efficient Sanitizable Signatures without Random Oracles. IACR Cryptol. ePrint Arch. 2017: 268 (2017) - [i3]Russell W. F. Lai, Sherman S. M. Chow:
Forward-Secure Searchable Encryption on Labeled Bipartite Graphs. IACR Cryptol. ePrint Arch. 2017: 659 (2017) - 2016
- [c7]Russell W. F. Lai, Tao Zhang, Sherman S. M. Chow
, Dominique Schröder
:
Efficient Sanitizable Signatures Without Random Oracles. ESORICS (1) 2016: 363-380 - [c6]Yu-Chi Chen
, Sherman S. M. Chow
, Kai-Min Chung
, Russell W. F. Lai
, Wei-Kai Lin, Hong-Sheng Zhou
:
Cryptography for Parallel RAM from Indistinguishability Obfuscation. ITCS 2016: 179-190 - [c5]Russell W. F. Lai
, Henry K. F. Cheung
, Sherman S. M. Chow
, Anthony Man-Cho So
:
Another Look at Anonymous Communication - Security and Modular Constructions. Mycrypt 2016: 56-82 - [c4]Sherman S. M. Chow
, Russell W. F. Lai, Xiuhua Wang, Yongjun Zhao
:
Privacy Preserving Credit Systems. NSS 2016: 184-199 - [c3]Russell W. F. Lai, Sherman S. M. Chow
:
Parallel and Dynamic Structured Encryption. SecureComm 2016: 219-238 - [i2]Russell W. F. Lai, Raymond K. H. Tai, Harry W. H. Wong, Sherman S. M. Chow:
A Zoo of Homomorphic Signatures: Multi-Key and Key-Homomorphism. IACR Cryptol. ePrint Arch. 2016: 834 (2016) - 2015
- [c2]Russell W. F. Lai, Sherman S. M. Chow
:
Structured Encryption with Non-interactive Updates and Parallel Traversal. ICDCS 2015: 776-777 - [i1]Yu-Chi Chen, Sherman S. M. Chow, Kai-Min Chung, Russell W. F. Lai, Wei-Kai Lin, Hong-Sheng Zhou:
Computation-Trace Indistinguishability Obfuscation and its Applications. IACR Cryptol. ePrint Arch. 2015: 406 (2015) - 2014
- [c1]Russell W. F. Lai, Henry K. F. Cheung
, Sherman S. M. Chow
:
Trapdoors for Ideal Lattices with Applications. Inscrypt 2014: 239-256
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint