| How long can optimal locally repairable codes be? V Guruswami, C Xing, C Yuan IEEE Transactions on Information Theory 65 (6), 3662-3670, 2019 | 125 | 2019 |
| Optimal locally repairable codes of distance 3 and 4 via cyclic codes Y Luo, C Xing, C Yuan IEEE Transactions on Information Theory 65 (2), 1048-1053, 2018 | 124 | 2018 |
| Amortized complexity of information-theoretically secure MPC revisited I Cascudo, R Cramer, C Xing, C Yuan Annual International Cryptology Conference, 395-426, 2018 | 94 | 2018 |
| Efficient information-theoretic secure multiparty computation over via galois rings M Abspoel, R Cramer, I Damgård, D Escudero, C Yuan Theory of Cryptography Conference, 471-501, 2019 | 69 | 2019 |
| Construction of optimal locally recoverable codes and connection with hypergraph C Xing, C Yuan arXiv preprint arXiv:1811.09142, 2018 | 39 | 2018 |
| Multipartite entangled states, symmetric matrices, and error-correcting codes K Feng, L Jin, C Xing, C Yuan IEEE Transactions on Information Theory 63 (9), 5618-5627, 2017 | 34 | 2017 |
| More Efficient Dishonest Majority Secure Computation over via Galois Rings D Escudero, C Xing, C Yuan Annual International Cryptology Conference, 383-412, 2022 | 29 | 2022 |
| Amortized complexity of zero-knowledge proofs revisited: Achieving linear soundness slack R Cramer, I Damgård, C Xing, C Yuan Annual International Conference on the Theory and Applications of …, 2017 | 27 | 2017 |
| Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory C Xing, C Yuan IEEE Transactions on Information Theory 68 (7), 4320-4328, 2022 | 25 | 2022 |
| Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over M Abspoel, R Cramer, I Damgård, D Escudero, M Rambaud, C Xing, ... International Conference on the Theory and Application of Cryptology and …, 2020 | 23 | 2020 |
| List decodability of symbol-pair codes S Liu, C Xing, C Yuan IEEE Transactions on Information Theory 65 (8), 4815-4821, 2019 | 21 | 2019 |
| Subspace designs based on algebraic function fields V Guruswami, C Xing, C Yuan Transactions of the American Mathematical Society 370 (12), 8757-8775, 2018 | 21 | 2018 |
| Beating the Probabilistic Lower Bound on q-Perfect Hashing C Xing, C Yuan Combinatorica 43 (2), 347-366, 2023 | 19 | 2023 |
| Towards optimal robust secret sharing with security against a rushing adversary S Fehr, C Yuan Annual International Conference on the Theory and Applications of …, 2019 | 18 | 2019 |
| Efficient pseudorandom correlation generators for any finite field Z Li, C Xing, Y Yao, C Yuan Annual International Conference on the Theory and Applications of …, 2025 | 17 | 2025 |
| Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications D Escudero, C Hong, H Liu, C Xing, C Yuan International Conference on the Theory and Application of Cryptology and …, 2023 | 15 | 2023 |
| Evolving secret sharing schemes based on polynomial evaluations and algebraic geometry codes C Xing, C Yuan IEEE Transactions on Information Theory 70 (5), 3718-3728, 2024 | 12 | 2024 |
| Robust secret sharing with almost optimal share size and security against rushing adversaries S Fehr, C Yuan Theory of Cryptography Conference, 470-498, 2020 | 11 | 2020 |
| Asymptotic Gilbert–Varshamov bound on frequency hopping sequences X Niu, C Xing, C Yuan IEEE Transactions on Information Theory 66 (2), 1213-1218, 2019 | 10 | 2019 |
| List decoding of cover metric codes up to the Singleton bound S Liu, C Xing, C Yuan IEEE Transactions on Information Theory 64 (4), 2410-2416, 2018 | 9 | 2018 |
Chaoping XINGShanghai Jiaotong UniversityVerified email at sjtu.edu.cn
