Faculty

Email:xingcp@sjtu.edu.cn; xingcp@gmail.com
Institute:Institute of Information Security and Cryptography
MainPage:https://xingcp.github.io/
Brief Introduction
Chaoping XING is currently a Chair Professor at Shanghai Jiao Tong University. After obtaining his Ph.D. from the University of Science and Technology of China (USTC) in 1990, he remained at the university to work. In 1993, he was awarded the Alexander von Humboldt Fellowship and worked at the University of Essen in Germany, after which he conducted research at the Austrian Academy of Sciences. In 1998, he joined the National University of Singapore, where he served successively as Assistant Professor, tenured Associate Professor, and Professor. In 2007, he began working as a Professor at Nanyang Technological University in Singapore. He joined Shanghai Jiao Tong University in 2019.
His research has long focused on cryptography, coding theory, secure multi-party computation, and algebraic number theory. He has been selected for prestigious programs including the National Overseas High-Level Talent Program, the Shanghai Overseas High-Level Talent Program, and the Chinese Academy of Sciences' Hundred Talents Program.
He has received numerous awards and honors, including the Singapore National Science Award, the Kloosterman Chair Professorship at Leiden University in the Netherlands, and the Alexander von Humboldt Fellowship in Germany. He has served as a member of the expert committee for the Hamming Medal, the highest award in the international coding community, and as a Visiting Professor at Stanford University.
He has authored four books. His book "Coding Theory – A First Course," published by Cambridge University Press, has been used as a textbook by many universities worldwide, including in Europe, America, and Asia. He has published one article in the Journal of the ACM, over 20 papers in cryptography at conferences such as Crypto, Eurocrypt, Asiacrypt, TCC, and PKC, and more than 20 papers at theoretical computer science conferences including FOCS, STOC, SODA, ICALP, CCC, and RANDOM. He has published over 80 papers on coding theory in the IEEE Transactions on Information Theory and more than 20 papers in mathematics journals such as Advances in Mathematics and the Transactions of the American Mathematical Society.
He has led numerous research projects, including key projects from the National Natural Science Foundation of China, key research and development projects from the Chinese Ministry of Science and Technology, key projects from the Singapore National Science Foundation, as well as projects funded by the Singapore Ministry of Defence and the Singapore Ministry of Education. He currently serves on the editorial boards of several SCI-indexed journals, including the CCF-A journals IEEE Transactions on Information Theory and Information and Computation, and the CRCA-B journal Finite Fields and Their Applications.
Publications
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-Vladut-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.