We construct quantum public-key encryption from one-way functions. In ou...
We study certified everlasting secure functional encryption (FE) and man...
We demonstrate quantum advantage with several basic assumptions, specifi...
Recently, Aaronson et al. (arXiv:2009.07450) showed that detecting
inter...
The existence of one-way functions is one of the most fundamental assump...
Assume that Alice can do only classical probabilistic polynomial-time
co...
Computational security in cryptography has a risk that computational
ass...
Estimating the ground state energy of a local Hamiltonian is a central
p...
In the classical world, the existence of commitments is equivalent to th...
In known constructions of classical zero-knowledge protocols for NP, eit...
Broadbent and Islam (TCC '20) proposed a quantum cryptographic primitive...
We propose three constructions of classically verifiable non-interactive...
Randomized encoding is a powerful cryptographic primitive with various
a...
The posthoc verification protocol [J. F. Fitzsimons, M. Hajdušek, and T....
Delegated quantum computing enables a client with a weak computational p...
We first show that under SETH and its variant, strong and weak classical...
It is known that several sub-universal quantum computing models cannot b...
The one-clean-qubit model (or the DQC1 model) is a restricted model of
q...
Blind quantum computing enables a client, who can only generate or measu...
In this paper we consider what can be computed by a user interacting wit...
It is an open problem whether a classical client (verifier) can delegate...
It is a long-standing open problem whether quantum computing can be veri...