research
∙
11/21/2022
Lattice Problems Beyond Polynomial Time
We study the complexity of lattice problems in a world where algorithms,...
share
research
∙
11/10/2022
Black-Hole Radiation Decoding is Quantum Cryptography
We propose to study equivalence relations between phenomena in high-ener...
research
∙
09/09/2022
On the computational hardness needed for quantum cryptography
In the classical model of computation, it is well established that one-w...
research
∙
03/04/2022
Constructive Post-Quantum Reductions
Is it possible to convert classical cryptographic reductions into post-q...
research
∙
04/08/2021
Unitary Subgroup Testing
We consider the problem of subgroup testing for a quantum circuit C: giv...
research
∙
10/17/2020
On the Hardness of Average-case k-SUM
In this work, we show the first worst-case to average-case reduction for...
research
∙
06/01/2020
Quantum Garbled Circuits
We present a garbling scheme for quantum circuits, thus achieving a deco...
research
∙
05/13/2020
Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits
Virtual black-box obfuscation is a strong cryptographic primitive: it en...
research
∙
05/11/2020
Simpler Proofs of Quantumness
A proof of quantumness is a method for provably demonstrating (to a clas...
research
∙
04/04/2020
Scalable Pseudorandom Quantum States
Efficiently sampling a quantum state that is hard to distinguish from a ...
research
∙
06/25/2019
(Pseudo) Random Quantum States with Binary Phase
We prove a quantum information-theoretic conjecture due to Ji, Liu and S...
research
∙
04/02/2018
Certifiable Randomness from a Single Quantum Device
We give a protocol for producing certifiable randomness from a single un...
research
∙
10/23/2017