default search action
Jyun-Jie Liao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Eshan Chattopadhyay, Jyun-Jie Liao:
Recursive Error Reduction for Regular Branching Programs. ITCS 2024: 29:1-29:20 - [i12]Jelle Don, Serge Fehr, Yu-Hsuan Huang, Jyun-Jie Liao, Patrick Struck:
Hide-and-Seek and the Non-Resignability of the BUFF Transform. IACR Cryptol. ePrint Arch. 2024: 793 (2024) - 2023
- [c7]Eshan Chattopadhyay, Jyun-Jie Liao:
Hardness Against Linear Branching Programs and More. CCC 2023: 9:1-9:27 - [i11]Eshan Chattopadhyay, Jyun-Jie Liao:
Recursive Error Reduction for Regular Branching Programs. CoRR abs/2309.04551 (2023) - [i10]Eshan Chattopadhyay, Jyun-Jie Liao:
Recursive Error Reduction for Regular Branching Programs. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c6]Eshan Chattopadhyay, Jyun-Jie Liao:
Extractors for sum of two sources. STOC 2022: 1584-1597 - [i9]Eshan Chattopadhyay, Jyun-Jie Liao:
Hardness against Linear Branching Programs and More. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c5]Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao:
Affine Extractors for Almost Logarithmic Entropy. FOCS 2021: 622-633 - [i8]Eshan Chattopadhyay, Jyun-Jie Liao:
Extractors for Sum of Two Sources. CoRR abs/2110.12652 (2021) - [i7]Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao:
Affine Extractors for Almost Logarithmic Entropy. Electron. Colloquium Comput. Complex. TR21 (2021) - [i6]Eshan Chattopadhyay, Jyun-Jie Liao:
Extractors for Sum of Two Sources. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c4]Eshan Chattopadhyay, Jyun-Jie Liao:
Optimal Error Pseudodistributions for Read-Once Branching Programs. CCC 2020: 25:1-25:27 - [c3]Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan:
Non-malleability Against Polynomial Tampering. CRYPTO (3) 2020: 97-126 - [i5]Eshan Chattopadhyay, Jyun-Jie Liao:
Optimal Error Pseudodistributions for Read-Once Branching Programs. CoRR abs/2002.07208 (2020) - [i4]Marshall Ball
, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan:
Non-Malleability against Polynomial Tampering. Electron. Colloquium Comput. Complex. TR20 (2020) - [i3]Eshan Chattopadhyay, Jyun-Jie Liao:
Optimal Error Pseudodistributions for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i2]Marshall Ball
Non-Malleability against Polynomial Tampering. IACR Cryptol. ePrint Arch. 2020: 147 (2020)
2010 – 2019
- 2018
- [c2]Yi-Hsiu Chen, Kai-Min Chung
On the Complexity of Simulating Auxiliary Input. EUROCRYPT (3) 2018: 371-390 - [i1]Yi-Hsiu Chen, Kai-Min Chung, Jyun-Jie Liao:
On the Complexity of Simulating Auxiliary Input. IACR Cryptol. ePrint Arch. 2018: 171 (2018) - 2015
- [c1]Chuan-Yu Chang, Jyun-Jie Liao:
Combination of RFID and face recognition for access control system. ICCE-TW 2015: 470-471 - 2012
- [j2]Chin-Ling Chen, Jyun-Jie Liao:
Fair offline digital content transaction system. IET Inf. Secur. 6(3): 123-130 (2012) - 2011
- [j1]Chin-Ling Chen, Jyun-Jie Liao:
A fair online payment system for digital content via subliminal channel. Electron. Commer. Res. Appl. 10(3): 279-287 (2011)
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-07-02 20:41 CEST 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: