1. Z. Guo, Chaoping Xing, C. Yuan and Z. Zhang: Random Gabidulin codes achieve list decoding capacity in rank metric, FOCS 2024
2. F. Lin, Chaoping Xing and Z. Yao: More Efficient Zero-Knowledge Protocols over $\mathbb{Z}_{2^k}$ via Galois Rings, CRYPTO 2024
3. S. Li, Chaoping Xing: Fast Fourier transform via automorphism groups of rational function fields. SODA 2024:
4. S. Liu, T. Wu and Chaoping Xing: Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vl?du?-Zink bounds. SODA 2023.
5. Venkatesan Guruswami, Chaoping Xing:
6. Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes. J. ACM 69(2): 10:1-10:48 (2022)
7. D. Escudero, Chaoping Xing, C. Yuan:More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings. CRYPTO (1) 2022:
8. R. Cramer and Chaoping Xing, Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes, Eurocrypt 2020.
9. R Cramer, I. Damgard, D. Escudero, P. Scholl and Chaoping Xing,: SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority: CRYPTO 2018.
10. I. Cascudo, R. Cramer, Chaoping Xing and C. Yuan: Amortized Complexity of (Information-Theoretically) Secure MPC Revisited, CRYPTO 2018.
11. R. Cramer, I. Damgard, Chaoping Xing, C. Yuan: Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack, Eurocrypt 2017.