An end-to-end system to identify temporal relation in discharge summaries: 2012 i2b2 challenge. - Yan Xu 001; Yining Wang; Tianren Liu; Junichi Tsujii; Eric I-Chao Chang (J. Am. Medical Informatics Assoc., 2013)

Indifferentiability of Confusion-Diffusion Networks. - Yevgeniy Dodis; Tianren Liu; Martijn Stam; John P. Steinberger (IACR Cryptol. ePrint Arch., 2015)

On Basing Private Information Retrieval on NP-Hardness. - Tianren Liu; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2015)

On Basing Search SIVP on NP-Hardness. - Tianren Liu (IACR Cryptol. ePrint Arch., 2016)

Conditional Disclosure of Secrets via Non-linear Reconstruction. - Tianren Liu; Vinod Vaikuntanathan; Hoeteck Wee (CRYPTO (1), 2017)

New Protocols for Conditional Disclosure of Secrets (and More). - Tianren Liu; Vinod Vaikuntanathan; Hoeteck Wee (Electron. Colloquium Comput. Complex., 2017)

Towards Breaking the Exponential Barrier for General Secret Sharing. - Tianren Liu; Vinod Vaikuntanathan; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2017)

Reusable Non-Interactive Secure Computation. - Melissa Chase; Yevgeniy Dodis; Yuval Ishai; Daniel Kraschewski; Tianren Liu; Rafail Ostrovsky; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2018)

Breaking the Circuit-Size Barrier in Secret Sharing. - Tianren Liu; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2018)

Multi-Party PSM, Revisited. - Leonard Assouline; Tianren Liu (IACR Cryptol. ePrint Arch., 2019)

On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? - Marshall Ball; Justin Holmgren; Yuval Ishai; Tianren Liu; Tal Malkin (ITCS, 2020)

Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More. - Huijia Lin; Tianren Liu; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2020)

Multi-party PSM, Revisited: - Improved Communication and Unbalanced Communication. - Léonard Assouline; Tianren Liu (TCC (2), 2021)

The t-wise Independence of Substitution-Permutation Networks. - Tianren Liu; Stefano Tessaro; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2021)

Two-Round MPC without Round Collapsing Revisited - Towards Efficient Malicious Protocols. - Huijia Lin; Tianren Liu (IACR Cryptol. ePrint Arch., 2022)

Succinct Computational Secret Sharing. - Benny Applebaum; Amos Beimel; Yuval Ishai; Eyal Kushilevitz; Tianren Liu; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2023)

New Ways to Garble Arithmetic Circuits. - Marshall Ball; Hanjun Li 001; Huijia Lin; Tianren Liu (IACR Cryptol. ePrint Arch., 2023)

How to Garble Mixed Circuits that Combine Boolean and Arithmetic Computations. - Hanjun Li 001; Tianren Liu (IACR Cryptol. ePrint Arch., 2023)

On Deterministically Approximating Total Variation Distance. - Weiming Feng 001; Liqiang Liu; Tianren Liu (SODA, 2024)

Layout Graphs, Random Walks and the t-wise Independence of SPN Block Ciphers. - Tianren Liu; Angelos Pelecanos; Stefano Tessaro; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2024)

How Fast Does the Inverse Walk Approximate a Random Permutation? - Tianren Liu; Angelos Pelecanos; Stefano Tessaro; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2024)

Garbled Lookup Tables from Homomorphic Secret Sharing. - Liqiang Liu; Tianren Liu; Bo Peng (IACR Cryptol. ePrint Arch., 2025)