default search action
Tianren Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Hanjun Li
, Tianren Liu
How to Garble Mixed Circuits that Combine Boolean and Arithmetic Computations. EUROCRYPT (6) 2024: 331-360 - [c16]Weiming Feng, Liqiang Liu, Tianren Liu:
On Deterministically Approximating Total Variation Distance. SODA 2024: 1766-1791 - [i19]Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan:
Layout Graphs, Random Walks and the t-wise Independence of SPN Block Ciphers. IACR Cryptol. ePrint Arch. 2024: 83 (2024) - [i18]Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan:
How Fast Does the Inverse Walk Approximate a Random Permutation? IACR Cryptol. ePrint Arch. 2024: 1795 (2024) - 2023
- [c15]Tianren Liu
Layout Graphs, Random Walks and the t-Wise Independence of SPN Block Ciphers. CRYPTO (3) 2023: 694-726 - [c14]Marshall Ball, Hanjun Li
New Ways to Garble Arithmetic Circuits. EUROCRYPT (2) 2023: 3-34 - [c13]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. STOC 2023: 1553-1566 - [i17]Weiming Feng, Liqiang Liu, Tianren Liu:
On Deterministically Approximating Total Variation Distance. CoRR abs/2309.14696 (2023) - [i16]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. Electron. Colloquium Comput. Complex. TR23 (2023) - [i15]Marshall Ball
New Ways to Garble Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2023: 501 (2023) - [i14]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. IACR Cryptol. ePrint Arch. 2023: 955 (2023) - [i13]Hanjun Li, Tianren Liu:
How to Garble Mixed Circuits that Combine Boolean and Arithmetic Computations. IACR Cryptol. ePrint Arch. 2023: 1584 (2023) - 2022
- [c12]Huijia Lin, Tianren Liu:
Two-Round MPC Without Round Collapsing Revisited - Towards Efficient Malicious Protocols. CRYPTO (1) 2022: 353-382 - [i12]Huijia Lin, Tianren Liu:
Two-Round MPC without Round Collapsing Revisited - Towards Efficient Malicious Protocols. IACR Cryptol. ePrint Arch. 2022: 944 (2022) - 2021
- [c11]Tianren Liu, Stefano Tessaro, Vinod Vaikuntanathan:
The t-wise Independence of Substitution-Permutation Networks. CRYPTO (4) 2021: 454-483 - [c10]Léonard Assouline, Tianren Liu:
Multi-party PSM, Revisited: - Improved Communication and Unbalanced Communication. TCC (2) 2021: 194-223 - [i11]Tianren Liu, Stefano Tessaro, Vinod Vaikuntanathan:
The t-wise Independence of Substitution-Permutation Networks. IACR Cryptol. ePrint Arch. 2021: 507 (2021) - 2020
- [c9]Marshall Ball
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? ITCS 2020: 86:1-86:22 - [c8]Huijia Lin, Tianren Liu, Hoeteck Wee:
Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More. TCC (2) 2020: 502-531 - [i10]Huijia Lin, Tianren Liu, Hoeteck Wee:
Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More. IACR Cryptol. ePrint Arch. 2020: 1431 (2020)
2010 – 2019
- 2019
- [c7]Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu
Reusable Non-Interactive Secure Computation. CRYPTO (3) 2019: 462-488 - [i9]Leonard Assouline, Tianren Liu:
Multi-Party PSM, Revisited. IACR Cryptol. ePrint Arch. 2019: 657 (2019) - 2018
- [c6]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
Towards Breaking the Exponential Barrier for General Secret Sharing. EUROCRYPT (1) 2018: 567-596 - [c5]Tianren Liu
Breaking the circuit-size barrier in secret sharing. STOC 2018: 699-708 - [c4]Tianren Liu
On Basing Search SIVP on NP-Hardness. TCC (1) 2018: 98-119 - [i8]Tianren Liu, Vinod Vaikuntanathan:
Breaking the Circuit-Size Barrier in Secret Sharing. IACR Cryptol. ePrint Arch. 2018: 333 (2018) - [i7]Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, Vinod Vaikuntanathan:
Reusable Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2018: 940 (2018) - 2017
- [c3]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
Conditional Disclosure of Secrets via Non-linear Reconstruction. CRYPTO (1) 2017: 758-790 - [i6]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
New Protocols for Conditional Disclosure of Secrets (and More). Electron. Colloquium Comput. Complex. TR17 (2017) - [i5]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
New Protocols for Conditional Disclosure of Secrets (and More). IACR Cryptol. ePrint Arch. 2017: 359 (2017) - [i4]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
Towards Breaking the Exponential Barrier for General Secret Sharing. IACR Cryptol. ePrint Arch. 2017: 1062 (2017) - 2016
- [c2]Yevgeniy Dodis, Martijn Stam, John P. Steinberger, Tianren Liu
Indifferentiability of Confusion-Diffusion Networks. EUROCRYPT (2) 2016: 679-704 - [c1]Tianren Liu, Vinod Vaikuntanathan:
On Basing Private Information Retrieval on NP-Hardness. TCC (A1) 2016: 372-386 - [i3]Tianren Liu:
On Basing Search SIVP on NP-Hardness. IACR Cryptol. ePrint Arch. 2016: 906 (2016) - 2015
- [i2]Yevgeniy Dodis, Tianren Liu, Martijn Stam, John P. Steinberger:
Indifferentiability of Confusion-Diffusion Networks. IACR Cryptol. ePrint Arch. 2015: 680 (2015) - [i1]Tianren Liu, Vinod Vaikuntanathan:
On Basing Private Information Retrieval on NP-Hardness. IACR Cryptol. ePrint Arch. 2015: 1061 (2015) - 2013
- [j1]Yan Xu
An end-to-end system to identify temporal relation in discharge summaries: 2012 i2b2 challenge. J. Am. Medical Informatics Assoc. 20(5): 849-858 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: