research
∙
06/13/2023
Public-Key Encryption with Quantum Keys
In the framework of Impagliazzo's five worlds, a distinction is often ma...
share
research
∙
03/09/2023
Encryption with Quantum Public Keys
It is an important question to find constructions of quantum cryptograph...
research
∙
10/27/2022
Quantum security of subset cover problems
The subset cover problem for k ≥ 1 hash functions, which can be seen as ...
research
∙
10/12/2022
Post-Quantum Zero-Knowledge with Space-Bounded Simulation
The traditional definition of quantum zero-knowledge stipulates that the...
research
∙
12/03/2020
Quantum learning algorithms imply circuit lower bounds
We establish the first general connection between the design of quantum ...
research
∙
11/30/2020
Oblivious Transfer is in MiniQCrypt
MiniQCrypt is a world where quantum-secure one-way functions exist, and ...
research
∙
10/28/2020
Tight adaptive reprogramming in the QROM
The random oracle model (ROM) enjoys widespread popularity, mostly becau...
research
∙
10/06/2020
StoqMA vs. MA: the power of error reduction
StoqMA characterizes the computational hardness of stoquastic local Hami...
research
∙
03/29/2020
A combinatorial MA-complete problem
Despite the interest in the complexity class MA, the randomized analog o...
research
∙
02/19/2020
Quantum statistical query learning
We propose a learning model called the quantum statistical learning QSQ ...
research
∙
11/19/2019
Non-interactive classical verification of quantum computation
In a recent breakthrough, Mahadev constructed an interactive protocol th...
research
∙
11/18/2019
Zero-Knowledge for QMA from Locally Simulatable Proofs
We provide several advances to the understanding of the class of Quantum...
research
∙
09/30/2019
Secure Multi-party Quantum Computation with a Dishonest Majority
The cryptographic task of secure multi-party (classical) computation has...
research
∙
05/27/2019
Perfect zero knowledge for quantum multiprover interactive proofs
In this work we consider the interplay between multiprover interactive p...
research
∙
03/07/2019
Quantum hardness of learning shallow classical circuits
In this paper we study the quantum learnability of constant-depth classi...
research
∙
01/16/2019
Stoquastic PCP vs. Randomness
The derandomization of MA, the probabilistic version of NP, is a long st...
research
∙
11/27/2017
