1. R. Cramer and Chaoping Xing, Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes, Eurocrypt 2020.
2. R Cramer, I. Damg?rd, D. Escudero, P. Scholl and Chaoping Xing, SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority, CRYPTO 2018.
3. I. Cascudo, R. Cramer, Chaoping Xing and C. Yuan, Amortized Complexity of (Information-Theoretically) Secure MPC Revisited, CRYPTO 2018.
4. R. Cramer, I. Damgard, Chaoping Xing, C. Yuan, Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack, Eurocrypt 2017.
5. V. Guruswami and Chaoping Xing, Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets, SODA 2014.
6. V. Guruswami and Chaoping Xing, List decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin subcodes up to the Singleton bound, STOC 2013
7. V. Guruswami and Chaoping Xing, Folded codes from function fields and improved list decoding, STOC 2012
8. Cascudo, R. Cramer and Chaoping Xing, The torsion-limit for algebraic function fields and its application to arithmetic secret sharing, CRYPTO 2011
9. Farràs, C. Padró, Chaoping Xing and A. Yang, Natural Generalizations of Threshold Secret Sharing, Asiacrypt 2011.
10. I. Cascudo, H. Chen, R. Cramer and Chaoping Xing, Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field, CRYPTO 2009