Selected Publications
-
[CCS'26] LogVOLE: Succinct and Efficient Chosen-Input VOLE for ZK and Beyond
Lucien K. L. Ng, Peter Rindal, Akash Shah
Full
Version
Code
TL;DR
Problem: Can two parties generate additive shares of
\(\mathbf{x} \cdot \Delta\), where the receiver chooses a vector \(\mathbf{x}\) and the sender holds a scalar
\(\Delta\), with communication sublinear to the size of \(\mathbf{x}\)?
Result: We propose LogVOLE, which solves this problem with concrete
efficiency and polylogarithmic communication. Our scheme can also be non-interactive in a
public-key setting.
Implication: We obtain designated-verifier zero-knowledge proofs with
efficient prover time and polylogarithmic proof size, and they can be upgraded to be
non-interactive. The scheme can also be used to transfer garbled input labels.
-
[S&P'26] Sort, Sweep, Mirror: Batch Private Interval Lookup with Logarithmic Cost
Andes Y. L. Kei, Lucien K. L. Ng, Jack P. K. Ma, Sherman S. M. Chow
Paper
TL;DR
Problem: Can we improve the efficiency of lookup table gates in multi-party computation?
Result: Yes, by batching multiple queries and viewing the problem as a sorting problem, we reduce both the amortized computation and communication cost to logarithmic in the batch size and the table size.
-
[CCS'25] Lite-PoT: Practical Powers-of-Tau Setup Ceremony
Lucien K. L. Ng, Pedro Moreno-Sanchez, Mohsen Minaei, Panagiotis Chatzigiannis, Adithya
Bhat, Duc V. Le
Full
Version
Slides
TL;DR
Problem: Powers-of-Tau (PoT) parameters are the cornerstone of KZG-based zk-SNARKs and
many blockchain applications. Yet, generating PoT parameters requires a trusted setup ceremony
that should involve as many contributors as possible.
Hosting the ceremony on a smart contract can attract more contributors and resist censorship, but
the high gas cost of verifying each contribution on-chain deters contributors and limits parameter size.
Result: We propose Lite-PoT, which makes participation in the ceremony inexpensive through
two mechanisms: (1) a fraud-proof mechanism that allows the contract to accept updates optimistically;
(2) aggregatable update proofs that combine many off-chain contributions into a single proof, amortizing the gas cost.
Implication: Less expensive participation attracts more contributors and supports larger
parameter sets, strengthening users' confidence in the security of PoT-based applications.
-
[CCS'25] Toss: Garbled PIR from Table-Only Stacking
Lucien K. L. Ng, Vladimir Kolesnikov
Full
Version
Slides
TL;DR
Problem: Garbled private information retrieval (GPIR) lets two parties retrieve an entry
from a public table using a private index within a garbled-circuit computation. How can we reduce its
communication cost without sacrificing computational efficiency?
Result: Toss introduces table-only stacking, which combines stacked garbling
with logrow but stacks only the table data. It reduces communication to
O(√N m√κ) while keeping its computational cost comparable to, or slightly lower
than, that of logrow.
Implication: Toss makes private access to much larger public tables practical within
garbled circuits, enabling more efficient lookup-based designs for privacy-preserving computation.
-
-
-
-
-
-
-
Academic Service
Tutoring on Undergraduate Research Projects
-
Secure DNN Training and Inference with Intel SGX @ CUHK
-
Deep Neural Network in Secure Linux Container with Trusted Processor @ CUHK
