| 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 | 114 | 2018 |
| How long can optimal locally repairable codes be? V Guruswami, C Xing, C Yuan IEEE Transactions on Information Theory 65 (6), 3662-3670, 2019 | 111 | 2019 |
| Amortized complexity of information-theoretically secure MPC revisited I Cascudo, R Cramer, C Xing, C Yuan Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 70 | 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 | 53 | 2019 |
| Construction of optimal locally recoverable codes and connection with hypergraph C Xing, C Yuan arXiv preprint arXiv:1811.09142, 2018 | 36 | 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 | 27 | 2017 |
| 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 | 26 | 2017 |
| Beating the Probabilistic Lower Bound on q-Perfect Hashing C Xing, C Yuan Combinatorica 43 (2), 347-366, 2023 | 18 | 2023 |
| Subspace designs based on algebraic function fields V Guruswami, C Xing, C Yuan Transactions of the American Mathematical Society 370 (12), 8757-8775, 2018 | 18 | 2018 |
| 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 | 17 | 2019 |
| List decodability of symbol-pair codes S Liu, C Xing, C Yuan IEEE Transactions on Information Theory 65 (8), 4815-4821, 2019 | 17 | 2019 |
| More Efficient Dishonest Majority Secure Computation over via Galois Rings D Escudero, C Xing, C Yuan Annual International Cryptology Conference, 383-412, 2022 | 15 | 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 | 14 | 2020 |
| 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 | 13 | 2022 |
| Robust secret sharing with almost optimal share size and security against rushing adversaries S Fehr, C Yuan Theory of Cryptography Conference, 470-498, 2020 | 10 | 2020 |
| 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 | 8 | 2018 |
| A new class of rank-metric codes and their list decoding beyond the unique decoding radius C Xing, C Yuan IEEE Transactions on Information Theory 64 (5), 3394-3402, 2017 | 8 | 2017 |
| A characterization of solvability for a class of networks C Yuan, H Kan Science China Information Sciences 55, 747-754, 2012 | 8 | 2012 |
| 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 | 7 | 2023 |
| Asymptotic Gilbert–Varshamov bound on frequency hopping sequences X Niu, C Xing, C Yuan IEEE Transactions on Information Theory 66 (2), 1213-1218, 2019 | 7 | 2019 |
Chaoping XINGShanghai Jiaotong UniversityVerified email at sjtu.edu.cn
