YSYifan Song
Yifan Song
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yifan Song has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Junru Li
Tsinghua University
6 shared publications - Vipul Goyal
NTT Research and Carnegie Mellon University, Sunnyvale, USA
3 shared publications - Xiaoyu Ji
Tsinghua University
3 shared publications - Chen-Da Liu-Zhang
Lucerne University of Applied Sciences and Arts
2 shared publications - Rafail Ostrovsky
UCLA
2 shared publications - Xiaxi Ye
Tsinghua University
2 shared publications
Latest Publications
- 13 August 2026
- Published by Springer Nature
- p. 262-293
Leakage-Tolerant Circuits Against $\textsf{AC}^0$ Leakage- 13 August 2026
- Published by Springer Nature
- p. 262-293
Leakage-Tolerant Circuits Against $\textsf{AC}^0$ Leakage- Open Access
- 12 August 2026
- Published by Springer Nature
- p. 70-102
Achieving Guaranteed Output Delivery MPC with Constant Rounds and Linear Communication in Minicrypt
- 12 August 2026
- Published by Springer Nature
- p. 70-102
Open AccessAchieving Guaranteed Output Delivery MPC with Constant Rounds and Linear Communication in Minicrypt
- 12 August 2026
- Published by Springer Nature
- p. 36-69
Statistically Secure Asynchronous MPC with Linear Communication and $\mathcal {O}(n^5)$ Additive Overhead- 12 August 2026
- Published by Springer Nature
- p. 36-69
Statistically Secure Asynchronous MPC with Linear Communication and $\mathcal {O}(n^5)$ Additive Overhead- 12 August 2026
- Published by Springer Nature
- p. 561-593
Breaking the $\varOmega (|C|\kappa )$ Barrier on Garbled Circuit Size in the Random Oracle Model- 12 August 2026
- Published by Springer Nature
- p. 561-593
Breaking the $\varOmega (|C|\kappa )$ Barrier on Garbled Circuit Size in the Random Oracle Model- Open Access
- 2 December 2025
- Published by Springer Nature
- p. 3-32
Honest Majority Constant-Round MPC with Linear Communication from One-Way Functions
- 2 December 2025
- Published by Springer Nature
- p. 3-32
Open AccessHonest Majority Constant-Round MPC with Linear Communication from One-Way Functions
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 70-104
Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
- 17 August 2025
- Published by Springer Nature
- p. 70-104
Open AccessTowards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 261-294
Computationally Efficient Asynchronous MPC with Linear Communication and Low Additive Overhead
- 17 August 2025
- Published by Springer Nature
- p. 261-294
Open AccessComputationally Efficient Asynchronous MPC with Linear Communication and Low Additive Overhead
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 36-69
Constant-Round Asynchronous MPC with Optimal Resilience and Linear Communication
- 17 August 2025
- Published by Springer Nature
- p. 36-69
Open AccessConstant-Round Asynchronous MPC with Optimal Resilience and Linear Communication
- 28 April 2025
- Published by Springer Nature
- p. 453-483
Honest Majority MPC with $\tilde{O}(|C|)$ Communication in Minicrypt- 28 April 2025
- Published by Springer Nature
- p. 453-483
Honest Majority MPC with $\tilde{O}(|C|)$ Communication in Minicrypt- 12 December 2024
- Published by Springer Nature
- p. 167-199
Dishonest Majority Constant-Round MPC with Linear Communication from DDH
- 12 December 2024
- Published by Springer Nature
- p. 167-199
Dishonest Majority Constant-Round MPC with Linear Communication from DDH