Tianren Liu

Orcid: 0009-0007-8697-2327

According to our database1, Tianren Liu authored at least 21 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
How Fast Does the Inverse Walk Approximate a Random Permutation?
IACR Cryptol. ePrint Arch., 2024

Layout Graphs, Random Walks and the t-wise Independence of SPN Block Ciphers.
IACR Cryptol. ePrint Arch., 2024

On Deterministically Approximating Total Variation Distance.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
How to Garble Mixed Circuits that Combine Boolean and Arithmetic Computations.
IACR Cryptol. ePrint Arch., 2023

New Ways to Garble Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2023

Succinct Computational Secret Sharing.
Electron. Colloquium Comput. Complex., 2023

2022
Two-Round MPC without Round Collapsing Revisited - Towards Efficient Malicious Protocols.
IACR Cryptol. ePrint Arch., 2022

2021
The t-wise Independence of Substitution-Permutation Networks.
IACR Cryptol. ePrint Arch., 2021

Multi-party PSM, Revisited: - Improved Communication and Unbalanced Communication.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

2020
Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More.
IACR Cryptol. ePrint Arch., 2020

On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Multi-Party PSM, Revisited.
IACR Cryptol. ePrint Arch., 2019

2018
Breaking the Circuit-Size Barrier in Secret Sharing.
IACR Cryptol. ePrint Arch., 2018

Reusable Non-Interactive Secure Computation.
IACR Cryptol. ePrint Arch., 2018

2017
Towards Breaking the Exponential Barrier for General Secret Sharing.
IACR Cryptol. ePrint Arch., 2017

New Protocols for Conditional Disclosure of Secrets (and More).
Electron. Colloquium Comput. Complex., 2017

Conditional Disclosure of Secrets via Non-linear Reconstruction.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
On Basing Search SIVP on NP-Hardness.
IACR Cryptol. ePrint Arch., 2016

2015
On Basing Private Information Retrieval on NP-Hardness.
IACR Cryptol. ePrint Arch., 2015

Indifferentiability of Confusion-Diffusion Networks.
IACR Cryptol. ePrint Arch., 2015

2013
An end-to-end system to identify temporal relation in discharge summaries: 2012 i2b2 challenge.
J. Am. Medical Informatics Assoc., 2013


  Loading...