Communication-Efficient Unconditional MPC with Guaranteed Output Delivery. - Vipul Goyal; Yanyi Liu; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2019)

Correlated-Source Extractors and Cryptography with Correlated-Random Tapes. - Vipul Goyal; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2019)

Storing and Retrieving Secrets on a Blockchain. - Vipul Goyal; Abhiram Kothapalli; Elisaweta Masserova; Bryan Parno; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2020)

Malicious Security Comes Free in Honest-Majority MPC. - Vipul Goyal; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2020)

Guaranteed Output Delivery Comes Free in Honest Majority MPC. - Vipul Goyal; Yifan Song 001; Chenzhi Zhu (IACR Cryptol. ePrint Arch., 2020)

ACCO: Algebraic Computation with Comparison. - Xiaoqi Duan; Vipul Goyal; Hanjun Li 001; Rafail Ostrovsky; Antigoni Polychroniadou; Yifan Song 001 (CCSW, 2021)

ATLAS: Efficient and Scalable MPC in the Honest Majority Setting. - Vipul Goyal; Hanjun Li 001; Rafail Ostrovsky; Antigoni Polychroniadou; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2021)

Blockchains Enable Non-Interactive MPC. - Vipul Goyal; Elisaweta Masserova; Bryan Parno; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2021)

Unconditional Communication-Efficient MPC via Hall's Marriage Theorem. - Vipul Goyal; Antigoni Polychroniadou; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2021)

Traceable Secret Sharing and Applications. - Vipul Goyal; Yifan Song 001; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2021)

TurboPack: Honest Majority MPC with Constant Online Communication. - Daniel Escudero 001; Vipul Goyal; Antigoni Polychroniadou; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2022)

Private Circuits with Quasilinear Randomness. - Vipul Goyal; Yuval Ishai; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2022)

Tight Bounds on the Randomness Complexity of Secure Multiparty Computation. - Vipul Goyal; Yuval Ishai; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2022)

Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing. - Vipul Goyal; Antigoni Polychroniadou; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2022)

Communication Complexity of Information-Theoretic Multiparty Computation - Yifan Song 001 (2022)

SUPERPACK: Dishonest Majority MPC with Constant Online Communication. - Daniel Escudero 001; Vipul Goyal; Antigoni Polychroniadou; Yifan Song 001; Chenkai Weng (IACR Cryptol. ePrint Arch., 2023)

Efficient 3PC for Binary Circuits with Application to Maliciously-Secure DNN Inference. - Yun Li 010; Yufei Duan; Zhicong Huang; Cheng Hong 001; Chao Zhang 008; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2023)

Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers. - Daniel Escudero 001; Antigoni Polychroniadou; Yifan Song 001; Chenkai Weng (CCS, 2024)

Concretely Efficient Asynchronous MPC from Lightweight Cryptography. - Akhil Bandarupalli; Xiaoyu Ji; Aniket Kate; Chen-Da Liu-Zhang; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2024)

Dishonest Majority Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers. - Daniel Escudero 001; Antigoni Polychroniadou; Yifan Song 001; Chenkai Weng (IACR Cryptol. ePrint Arch., 2024)

Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus. - Daniel Escudero 001; Yifan Song 001; Wenhao Wang (IACR Cryptol. ePrint Arch., 2024)

Dishonest Majority Constant-Round MPC with Linear Communication from DDH. - Vipul Goyal; Junru Li; Ankit Kumar Misra; Rafail Ostrovsky; Yifan Song 001; Chenkai Weng (IACR Cryptol. ePrint Arch., 2024)

Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience. - Vipul Goyal; Chen-Da Liu-Zhang; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2024)

Leakage-Tolerant Circuits. - Yuval Ishai; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2024)

Sublinear Distributed Product Checks on Replicated Secret-Shared Data over ℤ2k without Ring Extensions. - Yun Li 010; Daniel Escudero 001; Yufei Duan; Zhicong Huang; Cheng Hong 001; Chao Zhang 008; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2024)

Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing. - Vipul Goyal; Junru Li; Rafail Ostrovsky; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2025)

Protecting Computations Against Continuous Bounded-Communication Leakage. - Yuval Ishai; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2025)