Biography

I am a Ph.D. candidate at the Shanghai Jiao Tong University (2021- now), fortunately supervised by Prof. Chaoping Xing. In general, I have broad interests in zero-knowledge proofs and secure multi-party computation. More concretely, these days I am paying particular attentions to pseudorandom correlation generators/functions, code-based succinct arguments, batch arguments, and so on.

Education

• Ph.D. in Cyber Security
  Shanghai Jiao Tong University (Sept 2021- Sept 2026)

• Visiting Ph.D. in Cryptography, hosted by Prof. Claudio Orlandi
  Aarhus University (Sept 2025- Feb 2026)

• Bachelor of Engineering, Information Security and Second Bachelor of Science, Applied Mathematics
  Shanghai Jiao Tong University (Sept 2017 - June 2021)

Peer-Reviewed Publications

(Authors listed in alphabet order)

2026:
-11. Batched Oblivious Transfer with Square-Root Communication
Yicheng Li, Claudio Orlandi, Lawrence Roy, and Yizhou Yao
To appear at CIC 2026 ePrint

-10. Efficient Pseudorandom Correlation Generators over Binary Extension Fields and More
Zhe Li, Hongqing Liu, Chaoping Xing, Yizhou Yao, and Chen Yuan
To appear at ASIACRYPT 2026 ePrint

-9. Faster Pseudorandom Correlation Generators via Walsh-Hadamard Transform
Zhe Li, Hongqing Liu, Chaoping Xing, Yizhou Yao, and Chen Yuan
CRYPTO 2026 Springer ePrint

-8. On the Power of Sumcheck in Secure Multiparty Computation
Zhe Li, Chaoping Xing, Yizhou Yao, and Chen Yuan
PKC 2026 Springer ePrint

2025:
-7. Succinct Line-Point Zero-Knowledge from Homomorphic Secret Sharing
Zhe Li, Chaoping Xing, Yizhou Yao, and Chen Yuan
ASIACRYPT 2025 ePrint Springer

-6. Polynomial Commitments for Galois rings and Applications to SNARKs over \mathbb{Z}_{2^k}
Yuhao Jia, Songsong Li, Chaoping Xing, Yizhou Yao, and Chen Yuan
CRYPTO 2025 Springer

-5. Efficient Pseudorandom Correlation Generators over \mathbb{Z}/p^k\mathbb{Z}
Zhe Li, Chaoping Xing, Yizhou Yao, and Chen Yuan
CRYPTO 2025 ePrint Springer

-4. Efficient Pseudorandom Correlation Generators for Any Finite Field
Zhe Li, Chaoping Xing, Yizhou Yao, and Chen Yuan
EUROCRYPT 2025 ePrint Springer

2024:
-3. Interactive Line-Point Zero-Knowledge Proofs with Sublinear Communication and Linear Computation
Fuchun Lin, Chaoping Xing, and Yizhou Yao
ASIACRYPT 2024 ePrint Springer

-2. More Efficient Zero-Knowledge Protocols over Z_{2^k} via Galois Rings
Fuchun Lin, Chaoping Xing, and Yizhou Yao
CRYPTO 2024 ePrint Springer

2023:
-1. Amortized NISC over Z_{2^k} from RMFE
Fuchun Lin, Chaoping Xing, Yizhou Yao, and Chen Yuan
ASIACRYPT 2023 ePrint Springer

Manuscripts

• More Efficient SNARKs via Quasi-Abelian Codes: Faster, Smaller, and Field-Agnostic
  Zhe Li, Hongqing Liu, Chaoping Xing, Yizhou Yao, and Chen Yuan ePrint

• How to Fold Linear Error-Correcting Codes with Optimal Proximity Gaps
  Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan, and Ruiqi Zhu ePrint

• ReedWeave: Faster Reed-Solomon Polynomial Commitments from Interleaving and Folding
  Yuhao Jia, Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan, and Jielong Zhang ePrint

• Quasar: A Field-Agnostic Polynomial Commitment Scheme with Polylogarithmic Verification from Quasi-Abelian Codes
  Yuhao Jia, Zhe Li, Chaoping Xing, Yizhou Yao, and Chen Yuan ePrint

Experience & Service

• Externel review at ASIACRYPT 2023 & 2024, EUROCRYPT 2026, CRYPTO 2026, also serve as a volunteer at TCC 2025.

Awards

• I was awarded the National Scholarship for Doctoral Students in 2024 & 2025.
• I was awarded the 2026 Ant-Intech (Future) Scholarship