Tianren Liu

Available identifiers

Publication	Date of Publication	Type
On deterministically approximating total variation distance	2024-11-28	Paper
How to garble mixed circuits that combine Boolean and arithmetic computations	2024-11-13	Paper
Succinct computational secret sharing	2024-05-08	Paper
Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers	2024-02-02	Paper
New ways to garble arithmetic circuits	2023-12-08	Paper
On Deterministically Approximating Total Variation Distance	2023-09-26	Paper
Two-round MPC without round collapsing revisited -- towards efficient malicious protocols	2023-06-12	Paper
Multi-party PSM, revisited: improved communication and unbalanced communication	2023-04-13	Paper
https://portal.mardi4nfdi.de/entity/Q5875794	2023-02-03	Paper
The \(t\)-wise independence of substitution-permutation networks	2022-05-18	Paper
Information-theoretic 2-round MPC without round collapsing: adaptive security, and more	2022-03-23	Paper
Reusable non-interactive secure computation	2020-03-09	Paper
Breaking the circuit-size barrier in secret sharing	2019-08-22	Paper
On basing search SIVP on \(\mathbf{NP}\)-hardness	2018-12-11	Paper
Towards breaking the exponential barrier for general secret sharing	2018-07-09	Paper
Conditional disclosure of secrets via non-linear reconstruction	2017-11-03	Paper
Indifferentiability of Confusion-Diffusion Networks	2016-07-15	Paper
On Basing Private Information Retrieval on NP-Hardness	2016-03-23	Paper

This page was built for person: Tianren Liu