Yifan Song

Orcid: 0009-0009-4169-3257

Affiliations:
  • Tsinghua University, Beijing, China


According to our database1, Yifan Song authored at least 27 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Protecting Computations Against Continuous Bounded-Communication Leakage.
IACR Cryptol. ePrint Arch., 2025

Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing.
IACR Cryptol. ePrint Arch., 2025

2024
Sublinear Distributed Product Checks on Replicated Secret-Shared Data over ℤ<sub>2<sup>k</sup></sub> without Ring Extensions.
IACR Cryptol. ePrint Arch., 2024

Leakage-Tolerant Circuits.
IACR Cryptol. ePrint Arch., 2024

Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience.
IACR Cryptol. ePrint Arch., 2024

Dishonest Majority Constant-Round MPC with Linear Communication from DDH.
IACR Cryptol. ePrint Arch., 2024

Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus.
IACR Cryptol. ePrint Arch., 2024

Dishonest Majority Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.
IACR Cryptol. ePrint Arch., 2024

Concretely Efficient Asynchronous MPC from Lightweight Cryptography.
IACR Cryptol. ePrint Arch., 2024

Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Efficient 3PC for Binary Circuits with Application to Maliciously-Secure DNN Inference.
IACR Cryptol. ePrint Arch., 2023

SUPERPACK: Dishonest Majority MPC with Constant Online Communication.
IACR Cryptol. ePrint Arch., 2023

2022
Communication Complexity of Information-Theoretic Multiparty Computation
PhD thesis, 2022

Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing.
IACR Cryptol. ePrint Arch., 2022

Tight Bounds on the Randomness Complexity of Secure Multiparty Computation.
IACR Cryptol. ePrint Arch., 2022

Private Circuits with Quasilinear Randomness.
IACR Cryptol. ePrint Arch., 2022

TurboPack: Honest Majority MPC with Constant Online Communication.
IACR Cryptol. ePrint Arch., 2022

2021
Traceable Secret Sharing and Applications.
IACR Cryptol. ePrint Arch., 2021

Unconditional Communication-Efficient MPC via Hall's Marriage Theorem.
IACR Cryptol. ePrint Arch., 2021

Blockchains Enable Non-Interactive MPC.
IACR Cryptol. ePrint Arch., 2021

ATLAS: Efficient and Scalable MPC in the Honest Majority Setting.
IACR Cryptol. ePrint Arch., 2021

ACCO: Algebraic Computation with Comparison.
Proceedings of the CCSW@CCS '21: Proceedings of the 2021 on Cloud Computing Security Workshop, 2021

2020
Guaranteed Output Delivery Comes Free in Honest Majority MPC.
IACR Cryptol. ePrint Arch., 2020

Malicious Security Comes Free in Honest-Majority MPC.
IACR Cryptol. ePrint Arch., 2020

Storing and Retrieving Secrets on a Blockchain.
IACR Cryptol. ePrint Arch., 2020

2019
Correlated-Source Extractors and Cryptography with Correlated-Random Tapes.
IACR Cryptol. ePrint Arch., 2019

Communication-Efficient Unconditional MPC with Guaranteed Output Delivery.
IACR Cryptol. ePrint Arch., 2019


  Loading...