![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Luowen Qian
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Luowen Qian:
Unconditionally Secure Quantum Commitments with Preprocessing. CRYPTO (7) 2024: 38-58 - [c11]John Bostanci
, Luowen Qian
, Nicholas Spooner
, Henry Yuen
:
An Efficient Quantum Parallel Repetition Theorem and Applications. STOC 2024: 1478-1487 - 2023
- [c10]Zvika Brakerski, Ran Canetti, Luowen Qian:
On the Computational Hardness Needed for Quantum Cryptography. ITCS 2023: 24:1-24:21 - [c9]William Kretschmer, Luowen Qian
, Makrand Sinha, Avishay Tal:
Quantum Cryptography in Algorithmica. STOC 2023: 1589-1602 - [i22]John Bostanci
, Yuval Efron, Tony Metger, Alexander Poremba, Luowen Qian, Henry Yuen:
Unitary Complexity and the Uhlmann Transformation Problem. CoRR abs/2306.13073 (2023) - [i21]John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen:
An efficient quantum parallel repetition theorem and applications. CoRR abs/2311.10681 (2023) - [i20]Luowen Qian:
Unconditionally secure quantum commitments with preprocessing. CoRR abs/2311.18171 (2023) - [i19]John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen:
An efficient quantum parallel repetition theorem and applications. Electron. Colloquium Comput. Complex. TR23 (2023) - [i18]John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen:
An efficient quantum parallel repetition theorem and applications. IACR Cryptol. ePrint Arch. 2023: 1783 (2023) - [i17]Luowen Qian:
Unconditionally secure quantum commitments with preprocessing. IACR Cryptol. ePrint Arch. 2023: 1840 (2023) - 2022
- [c8]Prabhanjan Ananth, Kai-Min Chung, Xiong Fan, Luowen Qian:
Collusion-Resistant Functional Encryption for RAMs. ASIACRYPT (1) 2022: 160-194 - [c7]Prabhanjan Ananth
, Luowen Qian
, Henry Yuen
:
Cryptography from Pseudorandom Quantum States. CRYPTO (1) 2022: 208-236 - [c6]Jiahui Liu, Qipeng Liu, Luowen Qian
:
Beating Classical Impossibility of Position Verification. ITCS 2022: 100:1-100:11 - [c5]Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen:
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications. TCC (1) 2022: 237-265 - [c4]Jiahui Liu
, Qipeng Liu
, Luowen Qian
, Mark Zhandry
:
Collusion Resistant Copy-Protection for Watermarkable Functionalities. TCC (1) 2022: 294-323 - [i16]Zvika Brakerski, Ran Canetti, Luowen Qian:
On the computational hardness needed for quantum cryptography. CoRR abs/2209.04101 (2022) - [i15]Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen:
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications. CoRR abs/2211.01444 (2022) - [i14]William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal:
Quantum Cryptography in Algorithmica. CoRR abs/2212.00879 (2022) - [i13]Jiahui Liu, Qipeng Liu, Luowen Qian:
Beating Classical Impossibility of Position Verification. IACR Cryptol. ePrint Arch. 2022: 8 (2022) - [i12]Zvika Brakerski, Ran Canetti, Luowen Qian:
On the computational hardness needed for quantum cryptography. IACR Cryptol. ePrint Arch. 2022: 1181 (2022) - [i11]Prabhanjan Ananth, Kai-Min Chung, Xiong Fan, Luowen Qian:
Collusion-Resistant Functional Encryption for RAMs. IACR Cryptol. ePrint Arch. 2022: 1269 (2022) - [i10]Jiahui Liu, Qipeng Liu, Luowen Qian, Mark Zhandry:
Collusion Resistant Copy-Protection for Watermarkable Functionalities. IACR Cryptol. ePrint Arch. 2022: 1429 (2022) - [i9]Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen:
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications. IACR Cryptol. ePrint Arch. 2022: 1514 (2022) - 2021
- [i8]Jiahui Liu, Qipeng Liu, Luowen Qian:
Beating Classical Impossibility of Position Verification. CoRR abs/2109.07517 (2021) - [i7]Prabhanjan Ananth, Luowen Qian, Henry Yuen:
Cryptography from Pseudorandom Quantum States. CoRR abs/2112.10020 (2021) - [i6]Prabhanjan Ananth, Luowen Qian, Henry Yuen:
Cryptography from Pseudorandom Quantum States. IACR Cryptol. ePrint Arch. 2021: 1663 (2021) - 2020
- [c3]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian
:
Tight Quantum Time-Space Tradeoffs for Function Inversion. FOCS 2020: 673-684 - [c2]Kai-Min Chung, Tai-Ning Liao, Luowen Qian
:
Lower Bounds for Function Inversion with Quantum Advice. ITC 2020: 8:1-8:15 - [i5]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. CoRR abs/2006.05650 (2020) - [i4]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. Electron. Colloquium Comput. Complex. TR20 (2020) - [i3]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. IACR Cryptol. ePrint Arch. 2020: 693 (2020)
2010 – 2019
- 2019
- [c1]Kai-Min Chung, Luowen Qian
:
Adaptively Secure Garbling Schemes for Parallel Computations. TCC (2) 2019: 285-310 - [i2]Kai-Min Chung, Tai-Ning Liao, Luowen Qian:
Lower Bounds for Function Inversion with Quantum Advice. CoRR abs/1911.09176 (2019) - [i1]Kai-Min Chung, Luowen Qian:
Adaptively Secure Garbling Schemes for Parallel Computations. IACR Cryptol. ePrint Arch. 2019: 1077 (2019)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-29 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint