Tianren Liu

Orcid: 0009-0007-8697-2327

According to our database1, Tianren Liu authored at least 22 papers between 2013 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Garbled Lookup Tables from Homomorphic Secret Sharing.
IACR Cryptol. ePrint Arch., 2025

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

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

How to Garble Mixed Circuits that Combine Boolean and Arithmetic Computations.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023
Succinct Computational Secret Sharing.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

New Ways to Garble Arithmetic Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Layout Graphs, Random Walks and the t-Wise Independence of SPN Block Ciphers.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Two-Round MPC Without Round Collapsing Revisited - Towards Efficient Malicious Protocols.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

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

The t-wise Independence of Substitution-Permutation Networks.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More.
Proceedings of the Theory of Cryptography - 18th International Conference, 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

Reusable Non-Interactive Secure Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
On Basing Search SIVP on NP-Hardness.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Breaking the circuit-size barrier in secret sharing.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Towards Breaking the Exponential Barrier for General Secret Sharing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

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 Private Information Retrieval on NP-Hardness.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Indifferentiability of Confusion-Diffusion Networks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

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


  Loading...