Chen Yuan - RankMe

107 papers A* 8A 3B 2Journal 77Unranked 17

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Bounds on the size of (r,δ)-locally repairable codes for fixed values q and d. Finite Fields Their Appl. Wenqin Zhang, Chen Yuan, Yuan Luo, Nian Li
2026	J	`jnl`	Explicit List-Decodable Linearized Reed-Solomon and Folded Linearized Reed-Solomon Subcodes. CoRR Kuo Shang, Chen Yuan, Ruiqi Zhu
2026	J	`jnl`	Faster Pseudorandom Correlation Generators via Walsh-Hadamard Transform. IACR Cryptol. ePrint Arch. Zhe Li, Hongqing Liu, Chaoping Xing, Yizhou Yao, Chen Yuan
2026	J	`jnl`	Improvement of the Gilbert-Varshamov Bound for Linear Codes and Quantum Codes. CoRR Chen Yuan, Ruiqi Zhu
2026	J	`jnl`	Multi-Committee MPC: From Unanimous to Identifiable Abort. IACR Cryptol. ePrint Arch. Lichun Li, Hongqing Liu, Jiawei Ni, Chaoping Xing, Chen Yuan
2025	J	`jnl`	Degree-D Reverse Multiplication-Friendly Embeddings. IEEE Trans. Inf. Theory Daniel Escudero, Cheng Hong, Hongqing Liu, Chaoping Xing, Chen Yuan
2025	—	`conf`	Efficient Pseudorandom Correlation Generators for Any Finite Field. EUROCRYPT (5) Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan
2025	J	`jnl`	Efficient Pseudorandom Correlation Generators for Any Finite Field. IACR Cryptol. ePrint Arch. Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan
2025	—	`conf`	Efficient Pseudorandom Correlation Generators over $\mathbb {Z}/p^k\mathbb {Z}$. CRYPTO (4) Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan
2025	J	`jnl`	Efficient Pseudorandom Correlation Generators over ℤ/p IACR Cryptol. ePrint Arch. Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan
2025	A	`conf`	Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio. APPROX/RANDOM Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang
2025	J	`jnl`	List Decoding of Folded Reed-Solomon Codes Over Galois Ring. CoRR Chen Yuan, Ruiqi Zhu
2025	J	`jnl`	On the Power of Sumcheck in Secure Multiparty Computation. IACR Cryptol. ePrint Arch. Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan
2025	—	`conf`	Polynomial Commitments for Galois Rings and Applications to SNARKs Over $\mathbb {Z}_{2^k}$. CRYPTO (6) Yuhao Jia, Songsong Li, Chaoping Xing, Yizhou Yao, Chen Yuan
2025	B	`conf`	Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. ISIT Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan
2025	—	`conf`	Succinct Line-Point Zero-Knowledge Arguments from Homomorphic Secret Sharing. ASIACRYPT (5) Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan, Mengmeng Zhou
2025	J	`jnl`	Succinct Line-Point Zero-Knowledge Arguments from Homomorphic Secret Sharing. IACR Cryptol. ePrint Arch. Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan, Mengmeng Zhou
2025	A	`conf`	Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. ITCS Nicolas Resch, Chen Yuan, Yihan Zhang
2024	—	`conf`	Dishonest Majority Multiparty Computation over Matrix Rings. ASIACRYPT (6) Hongqing Liu, Chaoping Xing, Chen Yuan, Taoxu Zou
2024	J	`jnl`	Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IEEE Trans. Inf. Theory Chaoping Xing, Chen Yuan
2024	J	`jnl`	Explicit Cyclic and Quasi-Cyclic Codes With Optimal, Best Known Parameters, and Large Relative Minimum Distances. IEEE Trans. Inf. Theory Conghui Xie, Hao Chen, Chen Yuan
2024	J	`jnl`	On Lengths of Singleton-Optimal Locally Repairable Codes. IEEE Trans. Commun. Shu Liu, Ting-Yi Wu, Chaoping Xing, Chen Yuan
2024	A*	`conf`	Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. FOCS Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang
2024	J	`jnl`	Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. CoRR Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang
2024	J	`jnl`	Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. CoRR Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan
2024	J	`jnl`	Threshold Rates of Code Ensembles: Linear Is Best. IEEE Trans. Inf. Theory Nicolas Resch, Chen Yuan
2024	J	`jnl`	Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. IEEE Trans. Inf. Theory Nicolas Resch, Chen Yuan, Yihan Zhang
2023	—	`conf`	Amortized NISC over $\mathbb {Z}_{2^k}$ from RMFE. ASIACRYPT (1) Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan
2023	J	`jnl`	Amortized NISC over ℤ IACR Cryptol. ePrint Arch. Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan
2023	J	`jnl`	Beating the Probabilistic Lower Bound on q-Perfect Hashing. Comb. Chaoping Xing, Chen Yuan
2023	J	`jnl`	Constructions of k-Uniform States in Heterogeneous Systems. IEEE Trans. Inf. Theory Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan
2023	J	`jnl`	Constructions of k-uniform states in heterogeneous systems. CoRR Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan
2023	—	`conf`	Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. ASIACRYPT (1) Daniel Escudero, Cheng Hong, Hongqing Liu, Chaoping Xing, Chen Yuan
2023	J	`jnl`	Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. IACR Cryptol. ePrint Arch. Daniel Escudero, Hongqing Liu, Chaoping Xing, Chen Yuan
2023	J	`jnl`	Dishonest Majority Multiparty Computation over Matrix Rings. IACR Cryptol. ePrint Arch. Hongqing Liu, Chaoping Xing, Chen Yuan, Taoxu Zou
2023	A*	`conf`	List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. ICALP Shu Liu, Chaoping Xing, Chen Yuan
2023	—	`conf`	Ramp Hyper-invertible Matrices and Their Applications to MPC Protocols. ASIACRYPT (1) Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan
2023	J	`jnl`	Ramp hyper-invertible matrices and their applications to MPC protocols. IACR Cryptol. ePrint Arch. Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan
2023	J	`jnl`	Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. CoRR Nicolas Resch, Chen Yuan, Yihan Zhang
2023	A	`conf`	Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. ITC Nicolas Resch, Chen Yuan
2023	A*	`conf`	Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. ICALP Nicolas Resch, Chen Yuan, Yihan Zhang
2022	J	`jnl`	Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory. IEEE Trans. Inf. Theory Chaoping Xing, Chen Yuan
2022	—	`conf`	More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings. CRYPTO (1) Daniel Escudero, Chaoping Xing, Chen Yuan
2022	J	`jnl`	More Efficient Dishonest Majority Secure Computation over ℤ IACR Cryptol. ePrint Arch. Daniel Escudero, Chaoping Xing, Chen Yuan
2022	A*	`conf`	Threshold Rates of Code Ensembles: Linear Is Best. ICALP Nicolas Resch, Chen Yuan
2022	J	`jnl`	Threshold Rates of Codes Ensembles: Linear is Best. CoRR Nicolas Resch, Chen Yuan
2022	J	`jnl`	Upper bounds on maximum lengths of Singleton-optimal locally repairable codes. CoRR Shu Liu, Tingyi Wu, Chaoping Xing, Chen Yuan
2022	J	`jnl`	Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. CoRR Nicolas Resch, Chen Yuan, Yihan Zhang
2021	A*	`conf`	Beating the probabilistic lower bound on perfect hashing. SODA Chaoping Xing, Chen Yuan
2021	J	`jnl`	Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IACR Cryptol. ePrint Arch. Chaoping Xing, Chen Yuan
2021	J	`jnl`	Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. IACR Cryptol. ePrint Arch. Nicolas Resch, Chen Yuan
2020	J	`jnl`	Asymptotic Gilbert-Varshamov Bound on Frequency Hopping Sequences. IEEE Trans. Inf. Theory Xianhua Niu, Chaoping Xing, Chen Yuan
2020	—	`conf`	Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $. ASIACRYPT (3) Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
2020	J	`jnl`	Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. IACR Cryptol. ePrint Arch. Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
2020	J	`jnl`	Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex. IEEE Trans. Inf. Theory Ronald Cramer, Chaoping Xing, Chen Yuan
2020	—	`conf`	On the Complexity of Arithmetic Secret Sharing. TCC (3) Ronald Cramer, Chaoping Xing, Chen Yuan
2020	—	`conf`	Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries. TCC (3) Serge Fehr, Chen Yuan
2019	J	`jnl`	Beating the probabilistic lower bound on perfect hashing. CoRR Chaoping Xing, Chen Yuan
2019	J	`jnl`	Beating the probabilistic lower bound on perfect hashing. Electron. Colloquium Comput. Complex. Chaoping Xing, Chen Yuan
2019	A*	`conf`	Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph. ICALP Chaoping Xing, Chen Yuan
2019	—	`conf`	Efficient Information-Theoretic Secure Multiparty Computation over Z/p TCC (1) Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan
2019	J	`jnl`	Efficient Information-Theoretic Secure Multiparty Computation over ℤ/p IACR Cryptol. ePrint Arch. Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan
2019	J	`jnl`	How Long Can Optimal Locally Repairable Codes Be? IEEE Trans. Inf. Theory Venkatesan Guruswami, Chaoping Xing, Chen Yuan
2019	J	`jnl`	List Decodability of Symbol-Pair Codes. IEEE Trans. Inf. Theory Shu Liu, Chaoping Xing, Chen Yuan
2019	J	`jnl`	On the Complexity of Arithmetic Secret Sharing. IACR Cryptol. ePrint Arch. Ronald Cramer, Chaoping Xing, Chen Yuan
2019	J	`jnl`	Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes. IEEE Trans. Inf. Theory Yuan Luo, Chaoping Xing, Chen Yuan
2019	J	`jnl`	Robust Secret Sharing with Optimal Share Size and Security Against Rushing Adversaries. IACR Cryptol. ePrint Arch. Serge Fehr, Chen Yuan
2019	—	`conf`	Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary. EUROCRYPT (3) Serge Fehr, Chen Yuan
2019	J	`jnl`	Towards optimal robust secret sharing with security against a rushing adversary. IACR Cryptol. ePrint Arch. Serge Fehr, Chen Yuan
2018	J	`jnl`	A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius. IEEE Trans. Inf. Theory Chaoping Xing, Chen Yuan
2018	—	`conf`	Amortized Complexity of Information-Theoretically Secure MPC Revisited. CRYPTO (3) Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan
2018	J	`jnl`	Amortized Complexity of Information-Theoretically Secure MPC Revisited. IACR Cryptol. ePrint Arch. Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan
2018	J	`jnl`	Asymptotic Gilbert-Varshamov bound on Frequency Hopping. CoRR Xianhua Niu, Chaoping Xing, Chen Yuan
2018	J	`jnl`	Construction of optimal locally recoverable codes and connection with hypergraph. CoRR Chaoping Xing, Chen Yuan
2018	—	`conf`	How Long Can Optimal Locally Repairable Codes Be?. APPROX-RANDOM Venkatesan Guruswami, Chaoping Xing, Chen Yuan
2018	J	`jnl`	How long can optimal locally repairable codes be? CoRR Venkatesan Guruswami, Chaoping Xing, Chen Yuan
2018	J	`jnl`	List Decodability of Symbol-Pair Codes. CoRR Shu Liu, Chaoping Xing, Chen Yuan
2018	J	`jnl`	List Decoding of Cover Metric Codes Up to the Singleton Bound. IEEE Trans. Inf. Theory Shu Liu, Chaoping Xing, Chen Yuan
2018	J	`jnl`	Optimal locally repairable codes of distance 3 and 4 via cyclic codes. CoRR Yuan Luo, Chaoping Xing, Chen Yuan
2017	—	`conf`	Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. EUROCRYPT (1) Ronald Cramer, Ivan Damgård, Chaoping Xing, Chen Yuan
2017	J	`jnl`	Linear Tail-Biting Trellis and Its Sectionalization. J. Inf. Sci. Eng. Ya-Li Liu, Chen Yuan
2017	J	`jnl`	List Decodability of Random Subcodes of Gabidulin Codes. IEEE Trans. Inf. Theory Shu Liu, Chaoping Xing, Chen Yuan
2017	J	`jnl`	Multipartite Entangled States, Symmetric Matrices, and Error-Correcting Codes. IEEE Trans. Inf. Theory Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan
2017	A*	`conf`	Subspace Designs Based on Algebraic Function Fields. ICALP Venkatesan Guruswami, Chaoping Xing, Chen Yuan
2017	J	`jnl`	Subspace Designs based on Algebraic Function Fields. CoRR Venkatesan Guruswami, Chaoping Xing, Chen Yuan
2017	J	`jnl`	Subspace Designs based on Algebraic Function Fields. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Chaoping Xing, Chen Yuan
2016	J	`jnl`	On Multi-Point Local Decoding of Reed-Muller Codes. CoRR Ronald Cramer, Chaoping Xing, Chen Yuan
2016	J	`jnl`	On Multi-Point Local Decoding of Reed-Muller Codes. Electron. Colloquium Comput. Complex. Ronald Cramer, Chaoping Xing, Chen Yuan
2016	J	`jnl`	On Multi-Point Local Decoding of Reed-Muller Codes. IACR Cryptol. ePrint Arch. Ronald Cramer, Chaoping Xing, Chen Yuan
2016	B	`conf`	Probabilistic Autoreductions. SOFSEM Liyu Zhang, Chen Yuan, Haibin Kan
2015	J	`jnl`	A new class of rank-metric codes and their list decoding beyond the unique decoding radius. CoRR Chaoping Xing, Chen Yuan
2015	J	`jnl`	A new class of rank-metric codes and their list decoding beyond the unique decoding radius. Electron. Colloquium Comput. Complex. Chaoping Xing, Chen Yuan
2015	J	`jnl`	A refined analysis on the jump number problem of interval orders. Inf. Process. Lett. Chen Yuan, Haibin Kan
2015	J	`jnl`	Computing on binary strings. Theor. Comput. Sci. Tian-Ming Bu, Chen Yuan, Peng Zhang
2015	J	`jnl`	Multipartite entangled states, symmetric matrices and error-correcting codes. CoRR Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan
2015	J	`jnl`	Revisiting a randomized algorithm for the minimum rainbow subgraph problem. Theor. Comput. Sci. Chen Yuan, Haibin Kan
2014	J	`jnl`	A note on sparse solutions of sparse linear systems. Theor. Comput. Sci. Chen Yuan, Haibin Kan
2014	J	`jnl`	Linear Exact-Repair Construction of Hybrid MSR Codes in Distributed Storage Systems. IEEE Commun. Lett. Songtao Liang, Chen Yuan, Haibin Kan
2013	J	`jnl`	Explicit-form complex orthogonal design for space-time block codes. Sci. China Inf. Sci. Yuan Li, Chen Yuan, Haibin Kan
2012	J	`jnl`	A characterization of solvability for a class of networks. Sci. China Inf. Sci. Chen Yuan, Haibin Kan
2012	J	`jnl`	A construction method of matroidal networks. Sci. China Inf. Sci. Chen Yuan, Haibin Kan, Xin Wang, Hideki Imai
2012	J	`jnl`	A novel elementary construction of matching vectors. Inf. Process. Lett. Chen Yuan, Qian Guo, Haibin Kan
2012	A*	`conf`	Novel constructions of complex orthogonal designs for space-time block codes. INFOCOM Yuan Li, Chen Yuan, Haibin Kan
2012	J	`jnl`	Smaller Bound of Superconcentrator. IEICE Trans. Inf. Syst. Chen Yuan, Haibin Kan
2011	J	`jnl`	Computing on Binary Strings CoRR Tian-Ming Bu, Chen Yuan, Peng Zhang
2011	J	`jnl`	Holographic reduction for some counting problems. Inf. Process. Lett. Chen Yuan, Haibin Kan
2010	J	`jnl`	The maximal rates and minimal decoding delay of more general complex orthogonal designs. Sci. China Inf. Sci. Yuan Li, Haibin Kan, Chen Yuan, Huanfei Ma