Publications
2025
-
Quantum State Learning Implies Circuit Lower Bounds
-
Parallel Kac's Walk Generates PRUPreprint
-
NISQ Security and Complexity via Simple Classical ReasoningQCrypt 2025 (contributed talk)
-
A Cryptographic Perspective on the Verifiability of Quantum AdvantageAQIS 2024 (contributed talk)
2024
-
Quantum Pseudorandom ScramblersQIP 2024 (contributed talk)
-
Generalized Hybrid Search and Applications
-
Improved Quantum Lifting by Coherent Measure-and-Reprogram
2023
-
Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security
2022
-
Quantum algorithms for attacking hardness assumptions in classical and post-quantum cryptography
2021
-
Oblivious Transfer is in MiniQCryptQIP 2021 (plenary talk)
-
Quantum Key-length Extension
2020
-
A Note on the Instantiability of the Quantum Random Oracle
-
Quantum-secure Message Authentication via Blind-unforgeability
-
Basing Cryptography on NP-hardness Using Quantum ReductionsQCrypt 2018 (contributed talk)
2019
-
Quantum Security of Hash Functions and Property-preservation of Iterated Hashing
-
General Linear Group Action on Tensors: A Candidate for Post-Quantum CryptographyQIP 2020 (contributed talk)
2018
-
Quantum Collision-Finding in Non-Uniform Random Functions
-
Pseudorandom Quantum States
2017
-
Quantum Security of NMAC and Related Constructions
2016
-
Efficient Quantum Algorithms for Computing Class Groups and Solving the Principal Ideal Problem in Arbitrary Degree Number FieldsQIP 2017 (contributed talk)
-
Mitigating Multi-target Attacks in Hash-based Signatures
-
Zero-knowledge Proof Systems for QMAJournal version in SIAM J. Computing, 49(2), 245–283, 2020
2015
-
Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model
2014
-
A Quantum Algorithm for Computing the Unit Group of an Arbitrary Degree Number Field
-
A Note on Quantum Security for Post-Quantum Cryptography
2011
-
Classical Cryptographic Protocols in a Quantum WorldInvited to International Journal of Quantum Information, Vol. 13, No. 4 (2015)QIP 2011 (plenary talk)
Other
Manuscripts
Manuscripts
-
Early Days Following Grover's Quantum Search AlgorithmLecture noteSummarizing basic results related to Grover's algorithm
-
On the Quantum Attacks Against Schemes Relying on the Hardness of Finding a Short Generator of an Ideal in Q(zeta_{p^n})Poster at QIP'16. Mentioned in 'A Tricky Path to Quantum-Safe Encryption', Quanta Magazine, Sept 2015.
Grant Awards
NSF
Collaborative Research: FET: Small
Sony
Sony Faculty Innovation Award
NSF
CAREER Award
FET: CAREER
NSF
AF: Small
NSF
AF: Medium: Collaborative Research
REU supplement (2021–2022)
Selected Talks
Conference presentations are typically listed under each publication. Some recorded talks are collected in this YouTube playlist.
2025
Introduction to quantum pseudorandomness
2022
Tutorial on Quantum Computing
2021
Quantum-secure key-length extension
2020
Unpredictable Functions and Quantum-secure Authentication
Cybersecurity in a quantum world
2019
Zero-knowledge proofs meet quantum computing
Cryptography from NP Hardness: can quantum help?
Pseudorandom quantum states
2018
Pseudorandom quantum states
2016
What are we talking about when we talk about post-quantum cryptography?
Zero-knowledge proof systems for QMA