| 2026 | CRYPTO | Faster Pseudorandom Correlation Generators via Walsh-Hadamard Transform. | Zhe Li, Hongqing Liu, Chaoping Xing, Yizhou Yao, Chen Yuan |
| 2026 | PKC | Multi-committee MPC: From Unanimous to Identifiable Abort. | Lichun Li, Hongqing Liu, Jiawei Ni, Chaoping Xing, Chen Yuan |
| 2026 | PKC | On the Power of Sumcheck in Secure Multiparty Computation. | Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan |
| 2025 | ASIACRYPT | Succinct Line-Point Zero-Knowledge Arguments from Homomorphic Secret Sharing. | Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan, Mengmeng Zhou |
| 2025 | CRYPTO | Polynomial Commitments for Galois Rings and Applications to SNARKs Over $\mathbb {Z}_{2^k}$. | Yuhao Jia, Songsong Li, Chaoping Xing, Yizhou Yao, Chen Yuan |
| 2025 | CRYPTO | Efficient Pseudorandom Correlation Generators over $\mathbb {Z}/p^k\mathbb {Z}$. | Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan |
| 2025 | EuroCrypt | Efficient Pseudorandom Correlation Generators for Any Finite Field. | Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan |
| 2024 | ASIACRYPT | Interactive Line-Point Zero-Knowledge with Sublinear Communication and Linear Computation. | Fuchun Lin, Chaoping Xing, Yizhou Yao |
| 2024 | ASIACRYPT | Dishonest Majority Multiparty Computation over Matrix Rings. | Hongqing Liu, Chaoping Xing, Chen Yuan, Taoxu Zou |
| 2024 | CRYPTO | More Efficient Zero-Knowledge Protocols over $\mathbb {Z}_{2^k}$ via Galois Rings. | Fuchun Lin, Chaoping Xing, Yizhou Yao |
| 2024 | FOCS | Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. | Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang |
| 2024 | ISIT | Repairing Reed-Solomon Codes with Less Bandwidth. | Shu Liu, Yunqi Wan, Chaoping Xing |
| 2024 | ISIT | Nonlinear Codes with Low Redundancy. | Shu Liu, Chaoping Xing |
| 2024 | ISIT | Asymptotic Construction of Locally Repairable Codes with Multiple Recovering Sets. | Songsong Li, Shu Liu, Liming Ma, Yunqi Wan, Chaoping Xing |
| 2024 | PKC | On Information-Theoretic Secure Multiparty Computation with Local Repairability. | Daniel Escudero, Ivan Tjuawinata, Chaoping Xing |
| 2024 | SODA | Fast Fourier transform via automorphism groups of rational function fields. | Songsong Li, Chaoping Xing |
| 2023 | ASIACRYPT | Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. | Daniel Escudero, Cheng Hong, Hongqing Liu, Chaoping Xing, Chen Yuan |
| 2023 | ASIACRYPT | Amortized NISC over $\mathbb {Z}_{2^k}$ from RMFE. | Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan |
| 2023 | ASIACRYPT | Ramp Hyper-invertible Matrices and Their Applications to MPC Protocols. | Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan |
| 2023 | ICALP | List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. | Shu Liu, Chaoping Xing, Chen Yuan |
| 2023 | SODA | Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds. | Shu Liu, Tingyi Wu, Chaoping Xing |
| 2022 | CRYPTO | More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings. | Daniel Escudero, Chaoping Xing, Chen Yuan |
| 2021 | ASIACRYPT | Improved Single-Round Secure Multiplication Using Regenerating Codes. | Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgrd, Chaoping Xing |
| 2021 | CRYPTO | Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC. | Ronald Cramer, Matthieu Rambaud, Chaoping Xing |
| 2021 | SODA | Beating the probabilistic lower bound on perfect hashing. | Chaoping Xing, Chen Yuan |
| 2020 | ASIACRYPT | Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $. | Mark Abspoel, Ronald Cramer, Ivan Damgrd, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan |
| 2020 | EuroCrypt | Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. | Ronald Cramer, Chaoping Xing |
| 2020 | TCC | On the Complexity of Arithmetic Secret Sharing. | Ronald Cramer, Chaoping Xing, Chen Yuan |
| 2019 | ICALP | Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields. | Venkatesan Guruswami, Lingfei Jin, Chaoping Xing |
| 2019 | ICALP | Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph. | Chaoping Xing, Chen Yuan |
| 2019 | PKC | Reducing the Key Size of McEliece Cryptosystem from Automorphism-induced Goppa Codes via Permutations. | Zhe Li, Chaoping Xing, Sze Ling Yeo |
| 2018 | CRYPTO | Amortized Complexity of Information-Theoretically Secure MPC Revisited. | Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan |
| 2018 | CRYPTO | SPDℤ | Ronald Cramer, Ivan Damgrd, Daniel Escudero, Peter Scholl, Chaoping Xing |
| 2017 | EuroCrypt | Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. | Ronald Cramer, Ivan Damgrd, Chaoping Xing, Chen Yuan |
| 2017 | ICALP | Subspace Designs Based on Algebraic Function Fields. | Venkatesan Guruswami, Chaoping Xing, Chen Yuan |
| 2015 | TCC | Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. | Ronald Cramer, Carles Padr, Chaoping Xing |
| 2014 | ISIT | Correcting on curves and highly sound locally correctable codes of high rate. | Yeow Meng Chee, Liyasi Wu, Chaoping Xing |
| 2014 | SODA | Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets. | Venkatesan Guruswami, Chaoping Xing |
| 2013 | STOC | List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound. | Venkatesan Guruswami, Chaoping Xing |
| 2012 | ISIT | A construction of quantum codes via a class of classical polynomial codes. | Lingfei Jin, Chaoping Xing |
| 2012 | ITW | The arithmetic codex. | Ignacio Cascudo, Ronald Cramer, Chaoping Xing |
| 2012 | STOC | Folded codes from function field towers and improved optimal rate list decoding. | Venkatesan Guruswami, Chaoping Xing |
| 2011 | ASIACRYPT | Natural Generalizations of Threshold Secret Sharing. | Oriol Farrs, Carles Padr, Chaoping Xing, An Yang |
| 2011 | CRYPTO | The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. | Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing |
| 2011 | ISIT | Quantum Gilbert-Varshamov bound through symplectic self-orthogonal codes. | Lingfei Jin, Chaoping Xing |
| 2009 | CRYPTO | Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over | Ignacio Cascudo Pueyo, Hao Chen, Ronald Cramer, Chaoping Xing |
| 2001 | INDOCRYPT | Linear Authentication Codes: Bounds and Constructions. | Reihaneh Safavi-Naini, Huaxiong Wang, Chaoping Xing |
| 2001 | SETA | Constructions of Sequences from Algebraic Curves over Finite Fields. | Chaoping Xing |
| 1999 | ASIACRYPT | A Class of Explicit Perfect Multi-sequences. | Chaoping Xing, Kwok-Yan Lam, Zhenghong Wei |
| 1998 | SETA | Explicit Sequence Expansions. | David R. Kohel, San Ling, Chaoping Xing |