| Publication | Date of Publication | Type |
|---|
The round complexity of proofs in the bounded quantum storage model
IACR Communications in Cryptology | 2026-09-09 | Paper |
Towards the impossibility of quantum public key encryption with classical keys from one-way functions
IACR Communications in Cryptology | 2026-08-25 | Paper |
| Computational monogamy of entanglement and non-interactive quantum key distribution | 2026-04-24 | Paper |
| Two combinatorial MA-complete problems | 2026-04-15 | Paper |
| The role of piracy in quantum proofs | 2026-02-19 | Paper |
| Post-quantum zero-knowledge with space-bounded simulation | 2026-02-19 | Paper |
| Quantum learning algorithms imply circuit lower bounds | 2025-08-13 | Paper |
| QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge | 2025-08-12 | Paper |
| Stoquastic PCP vs. randomness | 2025-08-12 | Paper |
| Perfect zero knowledge for quantum multiprover interactive proofs | 2025-08-12 | Paper |
| Quantum security of subset cover problems | 2024-11-22 | Paper |
Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
Theory of Computing | 2024-10-29 | Paper |
| Public-key encryption with quantum keys | 2024-08-15 | Paper |
Tight adaptive reprogramming in the QROM
Lecture Notes in Computer Science | 2023-05-12 | Paper |
QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
SIAM Journal on Computing | 2022-09-24 | Paper |
A simple protocol for verifiable delegation of quantum computation in one round
(available as arXiv preprint) | 2022-07-21 | Paper |
Non-interactive classical verification of quantum computation
(available as arXiv preprint) | 2022-03-23 | Paper |
Oblivious transfer is in MiniQCrypt
(available as arXiv preprint) | 2021-12-08 | Paper |
Secure multi-party quantum computation with a dishonest majority
(available as arXiv preprint) | 2021-12-01 | Paper |
| Secure multi-party quantum computation with a dishonest majority | 2021-12-01 | Paper |
Quantum hardness of learning shallow classical circuits
SIAM Journal on Computing | 2021-06-22 | Paper |
Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
(available as arXiv preprint) | 2020-02-04 | Paper |
| Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources | 2020-02-04 | Paper |
Pointer Quantum PCPs and Multi-Prover Games
(available as arXiv preprint) | 2018-03-21 | Paper |
QMA with subset state witnesses
Chicago Journal of Theoretical Computer Science | 2016-05-24 | Paper |
On finite automata with quantum and classical states
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
QMA with subset state witnesses
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
