伟德国际(betvlctor·1946)始于英国-Macau Bellwether

您当前所在的位置：首页 > 团队队伍 > 教师名录

团队队伍

人才招聘

教师名录

袁晨

长聘教轨副教授

邮箱：chen_yuan@sjtu.edu.cn

所在研究所：信息安全与密码学研究所

个人简介

入选国家级青年人才计划，上海市海外高层次人才计划，主要研究方向为安全多方计算，秘密分享，代数编码，局部可修复码，列表译码等。论文发表于FOCS，Crypto，Eurocrypt，SODA，Asiacrypt，TCC，ICALP，IEEE transactions on Information Theory，Transactions of AMS，Combinatorica等重要学术会议和期刊上。

教育背景

2008年6月毕业于复旦大学数学科学公司，获数学学士学位。2013年6月毕业于复旦大学1946伟德国际源自英国，获计算机软件与理论博士学位，2017年6月毕业于新加坡南洋理工大学，获数学博士学位。

工作履历

2018年至2020年期间，在荷兰国家数学计算机中心CWI密码组从事博士后研究。2021年加入1946伟德国际源自英国，任长聘教轨副教授。

教授课程

信息安全的数学基础、数理统计

论文发表

1. Yuhao Jia, Songsong Li, Chaoping Xing, Yizhou Yao, Chen Yuan: Polynomial Commitments for Galois Rings and Applications to SNARKs over Z_{2^k}. To appear in CRYPTO 2025 (CCF A, CACR A)

2. Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan: Efficient Pseudorandom Correlation Generators over Z/p^kZ. To appear in CRYPTO 2025 (CCF A, CACR A)

3. Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan: Efficient Pseudorandom Correlation Generators for Any Finite Field. EUROCRYPT (5) 2025: 145-175 (CCF A, CACR A)

4. Hongqing Liu, Chaoping Xing, Chen Yuan, Taoxu Zou: Dishonest Majority Multiparty Computation over Matrix Rings. ASIACRYPT (6) 2024: 299-327 (CCF B, CACR A)

5. Nicolas Resch, Chen Yuan, Yihan Zhang: Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. ITCS 2025: 82:1-82:21

6. Chaoping Xing, Chen Yuan: Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IEEE Trans. Inf. Theory 70(5): 3718-3728 (2024) (CCF A, CACR A)

7. Nicolas Resch, Chen Yuan: Threshold Rates of Code Ensembles: Linear Is Best. IEEE Trans. Inf. Theory 70(7): 4823-4842 (2024) (CCF A, CACR A)

8. Nicolas Resch, Chen Yuan, Yihan Zhang: Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. IEEE Trans. Inf. Theory 70(9): 6211-6238 (2024) (CCF A, CACR A)

9. Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan: Constructions of k-Uniform States in Heterogeneous Systems. IEEE Trans. Inf. Theory 69(9): 5845-5856 (2023) (CCF A, CACR A)

10. 5. Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang: Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. FOCS 2024: 1846-1873 (CCF A)

11. Chaoping Xing, Chen Yuan: Beating the Probabilistic Lower Bound on q-Perfect Hashing. Combinatorica 43(2): 347-366 (2023)

12. Daniel Escudero, Cheng Hong, Hongqing Liu, Chaoping Xing, Chen Yuan: Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. ASIACRYPT (1) 2023: 106-138 (CCF B, CACR A)

13. Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan: Amortized NISC over Z_2^k from RMFE. ASIACRYPT (1) 2023: 38-70 (CCF B, CACR A)

14. Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan: Ramp Hyper-invertible Matrices and Their Applications to MPC Protocols. ASIACRYPT (1) 2023: 204-236 (CCF B, CACR A)

15. Nicolas Resch, Chen Yuan, Yihan Zhang: Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. ICALP 2023: 99:1-99:18 (CCF B)

16. Shu Liu, Chaoping Xing, Chen Yuan: List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. ICALP 2023: 89:1-89:14 (CCF B)

17. Daniel Escudero, Chaoping Xing, Chen Yuan: More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings. CRYPTO (1) 2022: 383-412 (CCF A, CACR A)

18. Nicolas Resch, Chen Yuan: Threshold Rates of Code Ensembles: Linear Is Best. ICALP 2022: 104:1-104:19 (CCF B)

19. Chaoping Xing, Chen Yuan: Construction of Optimal (r, \delta)-Locally Recoverable Codes and Connection With Graph Theory. IEEE Trans. Inf. Theory 68(7): 4320-4328 (2022) (CCF A, CACR A)

20. Chaoping Xing, Chen Yuan: Beating the probabilistic lower bound on perfect hashing. SODA 2021: 33-41 (CCF A)

资助项目

国家自然基金青年项目：局部可修复码的构造及上界研究（主持）
国家自然基金面上项目：表可译码的译码半径及其相关问题（主持）
上海市科技创新行动区块链专项：恶意安全的高效SPDZ协议（主持）
CCF-蚂蚁隐私计算科研基金项目：面对宽松恶意安全敌手安全多方计算协议的研究（主持）