default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYao-Ting Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu, Yao-Ting Lin:
Pseudorandom Isometries. EUROCRYPT (4) 2024: 226-254- [c5]Prabhanjan Ananth, Yao-Ting Lin, Henry Yuen:
Pseudorandom Strings from Pseudorandom Quantum States. ITCS 2024: 6:1-6:22 - [i12]Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin:
A Note on the Common Haar State Model. CoRR abs/2404.05227 (2024) - [i11]Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin:
Cryptography in the Common Haar State Model: Feasibility Results and Separations. CoRR abs/2407.07908 (2024) - [i10]Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin:
A Note on the Common Haar State Model. IACR Cryptol. ePrint Arch. 2024: 543 (2024) - [i9]Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin:
Cryptography in the Common Haar State Model: Feasibility Results and Separations. IACR Cryptol. ePrint Arch. 2024: 1043 (2024) - 2023
- [c4]Abtin Afshar, Kai-Min Chung, Yao-Ching Hsieh, Yao-Ting Lin, Mohammad Mahmoody:
On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model. ASIACRYPT (4) 2023: 339-368 - [c3]Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh
, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen:
On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation. CCC 2023: 33:1-33:45 - [c2]Kai-Min Chung, Yao-Ting Lin, Mohammad Mahmoody:
Black-Box Separations for Non-interactive Classical Commitments in a Quantum World. EUROCRYPT (1) 2023: 144-172 - [i8]Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen:
On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation. CoRR abs/2305.12444 (2023) - [i7]Prabhanjan Ananth, Yao-Ting Lin, Henry Yuen:
Pseudorandom Strings from Pseudorandom Quantum States. CoRR abs/2306.05613 (2023) - [i6]Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu, Yao-Ting Lin:
Pseudorandom Isometries. CoRR abs/2311.02901 (2023) - [i5]Kai-Min Chung, Yao-Ting Lin, Mohammad Mahmoody:
Black-Box Separations for Non-Interactive Commitments in a Quantum World. IACR Cryptol. ePrint Arch. 2023: 570 (2023) - [i4]Prabhanjan Ananth, Yao-Ting Lin, Henry Yuen:
Pseudorandom Strings from Pseudorandom Quantum States. IACR Cryptol. ePrint Arch. 2023: 904 (2023) - [i3]Abtin Afshar, Kai-Min Chung, Yao-Ching Hsieh, Yao-Ting Lin, Mohammad Mahmoody:
On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2023: 932 (2023) - [i2]Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu, Yao-Ting Lin:
Pseudorandom Isometries. IACR Cryptol. ePrint Arch. 2023: 1741 (2023) - 2022
- [c1]Per Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, Mohammad Mahmoody:
On the Impossibility of Key Agreements from Quantum Random Oracles. CRYPTO (2) 2022: 165-194 - [i1]Per Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, Mohammad Mahmoody:
On the Impossibility of Key Agreements from Quantum Random Oracles. IACR Cryptol. ePrint Arch. 2022: 218 (2022)
Coauthor Index
aka: Prabhanjan Ananth
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-08-25 20:04 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:
