About Me

A second-year phd student in cryptography at Northwestern University, advised by Prof. Xiao Wang.
Before joining Northwestern, I obtained my bachelor's degree from the ACM Honors Class, Shanghai Jiao Tong University.
In my junior year (in SJTU), I worked as a student intern at LATTICE lab, advised by Prof. Yu Yu. During this internship, I mainly worked on how to prove the security of cryptographic primitives in a low-level method.

Research Interests

Zero-Knowledge Proof/Argument: I'm interested in zero-knowledge protocols across the entire spectrum—from enhancing the efficiency of interactive protocols with a designated, centralized verifier to minimizing prover overhead and setup costs in zk-SNARKs, where proofs need to be both succinct and publicly verifiable. I have experience implementing in both realms: I used the EMP-toolkit to develop a VOLE-based ZK protocol and plonky2 to design a SNARK circuit for evaluation in my paper.
Oblivious Message Retrieval: An alternative approach to adding privacy in distributed systems is through oblivious message retrieval. While existing methods often rely on fully homomorphic encryption (FHE) or trusted execution environments (TEE), my work aims to developing efficient methodologies that avoid these heavy-weight techniques.

Publications

An Efficient ZK Compiler from SIMD Circuits to General Circuits
Dung Bui, Haotian Chu, Geoffroy Couteau, Xiao Wang, Chenkai Weng, Kang Yang, Yu Yu
This work is done during my internship in Xiao's lab (in my senior year).
In this paper, we find a way to construct efficient ZKP by making the best of circuit parallelization.
We build a methodology compiler that can transform SIMD ZK into general one.
We also present some instansiation based on well-known protocols as well as concrete evaluation.
This paper is accepted by Journal of Cryptology 2024.