This paper studies the quantum computational complexity of the discrete
...
We present a general compiler to add the publicly verifiable deletion
pr...
We construct quantum public-key encryption from one-way functions. In ou...
It is a long-standing open question to construct a classical oracle rela...
We introduce the notion of public key encryption with secure key leasing...
We show how to obfuscate pseudo-deterministic quantum circuits, assuming...
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...
We provide the first 𝑐𝑜𝑛𝑠𝑡𝑎𝑛𝑡-𝑟𝑜𝑢𝑛𝑑 construction of
post-quantum non-mal...
We show the following hold, unconditionally unless otherwise stated, rel...
In the classical world, the existence of commitments is equivalent to th...
From the minimal assumption of post-quantum semi-honest oblivious transf...
In known constructions of classical zero-knowledge protocols for NP, eit...
Broadbent and Islam (TCC '20) proposed a quantum cryptographic primitive...
We investigate the existence of constant-round post-quantum black-box
ze...
We propose three constructions of classically verifiable non-interactive...
In a recent seminal work, Bitansky and Shmueli (STOC '20) gave the first...
Secure software leasing (SSL) is a quantum cryptographic primitive that
...
In this paper, we extend the protocol of classical verification of quant...