Tianren Liu (刘天任)

Assistant Professor, CFCS, Peking University

Tianren Liu 刘天任

I recently joined Center on Frontiers of Computing Studies (CFCS), Peking University as an assistant professor.

Previously, I was a postdoc researcher in UW, mentored by Prof. Huijia (Rachel) Lin. I received my master and Phd degrees from MIT, where I was fortunately advised by Prof. Vinod Vaikuntanathan. I received my bachelor degree from IIIS Tsinghua University, advised by Prof. John Steinberger.

So far, my research focuses on information theoretic (IT) cryptography, including

  • IT cryptography problems, such as CDS, PSM, secret sharing;
  • secure multi-party computation with IT "flavor";
  • garbled circutis with IT "flavor";
  • analysis of practical cryptography from an IT perspective;
  • (im)possibility of basing cryptography on NP-hardness.

[CV] [dblp] [google scholar]


Luojian Wei (Ph.D. 2023 - ongoing)
Liqiang Liu (Ph.D. 2023 - ongoing)


How to Garble Mixed Circuits that Combine Boolean and Arithmetic Computations.
Hanjun Li, Tianren Liu
eprint, slides (中文)
SODA 2024
On Deterministically Approximating Total Variation Distance.
Weiming Feng, Liqiang Liu, Tianren Liu
arxiv, slides
Layout Graphs, Random Walks and the t-wise Independence of SPN Block Ciphers.
STOC 2023
Succinct Computational Secret Sharing.
New Ways to Garble Arithmetic Circuits.
eprint, video
Two-Round MPC without Round Collapsing Revisited -- Towards Efficient Malicious Protocols.
Tianren Liu, Huijia Lin
eprint, slides, video
The t-wise Independence of Substitution-Permutation Networks.
eprint, slides, video
TCC 2021
Multi-Party PSM, Revisited: Improved Communication and Unbalanced Communication.
Leonard Assouline, Tianren Liu
eprint, slides, video
TCC 2020
Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More.
Huijia Lin, Tianren Liu, Hoeteck Wee
eprint, download, slides, video
ITCS 2020
On the Complexity of Decomposable Randomized Encodings, or: How Friendly Can a Garbling-Friendly PRF be?
download, drops
Reusable Non-Interactive Secure Computation.
eprint, slides
STOC 2018
Breaking the Circuit-Size Barrier in Secret Sharing.
Tianren Liu, Vinod Vaikuntanathan
eprint, slides, video, poster
Towards Breaking the Exponential Barrier for General Secret Sharing.
eprint, slides
TCC 2018
On Basing Search SIVP on NP-Hardness.
Tianren Liu
Best Student Paper, eprint, slides
Conditional Disclosure of Secrets via Non-linear Reconstruction.
eprint, slides, video
Indifferentiability of Confusion-Diffusion Networks.
eprint, video
TCC 2016-A
On Basing Private Information Retrieval on NP-Hardness.
Tianren Liu, Vinod Vaikuntanathan
eprint, slides
JAMIA 2013
An end-to-end system to identify temporal relation in discharge summaries: 2012 i2b2 challenge.
JAMIA 2013
Joint segmentation and named entity recognition using dual decomposition in Chinese discharge summaries.

Contact Me

Mail: (lastname)(firstname)@gmail.com,
(If you send email to my school mailbox, it's better to CC my gmail address.)

Skype: live:liutianren

Office Tel: +86 10 6275-0405

Office: Room 103, Courtyard No.5, Jingyuan, Peking University


The site is built upon themes from Start Bootstrap.
My "artwork":