Luowen Qian
CDS 1043E
665 Commonwealth Ave
Boston, MA 02215
Email: <firstname>q@bu.edu
I am a Ph.D. student at Boston University. I am very fortunate to have Ran Canetti as my advisor. My research interest includes quantum computation, cryptography, and other aspects of theoretical computer science in general.
Teaching
Publications
-
Quantum Cryptography in Algorithmica
William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal
STOC 2023 (to appear) [arXiv]
(contributed talk at QIP 2023)
-
On the computational hardness needed for quantum cryptography
Zvika Brakerski, Ran Canetti, Luowen Qian
ITCS 2023 [ePrint]
-
Collusion-Resistant Functional Encryption for RAMs
Prabhanjan Ananth, Kai-Min Chung, Xiong Fan, Luowen Qian
ASIACRYPT 2022 [ePrint]
-
Collusion Resistant Copy-Protection for Watermarkable Functionalities
Jiahui Liu, Qipeng Liu, Luowen Qian, Mark Zhandry
TCC 2022 [ePrint]
(contributed talk at QIP 2023)
-
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications
Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen
TCC 2022 [arXiv]
(contributed talk at QCrypt 2022, short plenary talk at QIP 2023)
-
Cryptography from Pseudorandom Quantum States
Prabhanjan Ananth, Luowen Qian, Henry Yuen
CRYPTO 2022 [ePrint]
(contributed short plenary talk at QIP 2023)
-
Beating Classical Impossibility of Position Verification
Jiahui Liu, Qipeng Liu, Luowen Qian
ITCS 2022 [arXiv]
-
Tight Quantum Time-Space Tradeoffs for Function Inversion
Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian
FOCS 2020 [ECCC]
(invited keynote at TQC 2021)
-
Lower Bounds for Function Inversion with Quantum Advice
Kai-Min Chung, Tai-Ning Liao, Luowen Qian
ITC 2020 [arXiv]
-
Adaptively Secure Garbling Schemes for Parallel Computations
Kai-Min Chung, Luowen Qian
TCC 2019 [ePrint]
Talks & Posters
-
Quantum Cryptography in Algorithmica
A special crypto day in honor of Ran Canetti on the occasion of his 60th birthday (May 12, 2023)
-
Quantum pseudorandomness in Algorithmica, and its implications to cryptography and complexity
Minimal Complexity Assumptions for Cryptography workshop @ Simons Institute (May 5, 2023)
-
Cryptography from Quantum Pseudorandomness
IQC Math and Computer Science Seminar (March 9, 2023) [Slides]
-
On the computational hardness needed for quantum cryptography
ITCS 2023 (January 12, 2023);
QCW 2022;
Third Kyoto Workshop on Quantum Information, Computation, and Foundations (October 18, 2022) [Slides];
MIT Cryptography and Information Security seminar (September 30, 2022);
CRYPTO 2022 Rump Session (August 16, 2022)
-
Collusion Resistant Copy-Protection for Watermarkable Functionalities
QCrypt 2022 (joint poster)
-
Cryptography from Pseudorandom Quantum States
QCrypt 2022 contributed talk (August 29, 2022) [Video, Slides]; CRYPTO 2022 (August 15, 2022) [Video abstract, Slides, Recording]; UC Berkeley Theory CS Seminar (January 11, 2022) [Slides]
-
Beating Classical Impossibility of Position Verification
QCW 2022;
QIP 2022 contributed talk (March 10, 2022) [Recording];
Ottawa QUASAR seminar (March 4, 2022);
ITCS 2022 (February 2, 2022) [Video, Recording];
Charles River Crypto Day (November 19, 2021); BUsec Seminar (September 29, 2021) [Slides]
-
Tight Quantum Time-Space Tradeoffs for Function Inversion
BU Algorithms and Theory Seminar (April 5, 2021)
-
Lower Bounds for Function Inversion with Quantum Advice
ITC 2020 (June 17, 2020), QIP 2020 (poster)
-
Adaptively Secure Garbling Schemes for Parallel Computations
TCC 2019 (December 4, 2019), NY CryptoDay (October 18, 2019)
Manuscripts
-
Nonuniform Linear Depth Circuits Decide Everything
Luowen Qian
For April Fool's day, 2020 [viXra]
Misc
CVE-2021-0980
GitHub, CV
Perpetually under construction 🚧