research
∙
04/04/2023
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions
We construct quantum public-key encryption from one-way functions. In ou...
share
research
∙
02/20/2023
Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More
We study certified everlasting secure functional encryption (FE) and man...
research
∙
02/09/2023
Quantum Advantage from One-Way Functions
We demonstrate quantum advantage with several basic assumptions, specifi...
research
∙
10/12/2022
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
Recently, Aaronson et al. (arXiv:2009.07450) showed that detecting inter...
research
∙
10/07/2022
One-Wayness in Quantum Cryptography
The existence of one-way functions is one of the most fundamental assump...
research
∙
08/26/2022
Proofs of Quantumness from Trapdoor Permutations
Assume that Alice can do only classical probabilistic polynomial-time co...
research
∙
07/28/2022
Certified Everlasting Functional Encryption
Computational security in cryptography has a risk that computational ass...
research
∙
07/21/2022
Improved Hardness Results for the Guided Local Hamiltonian Problem
Estimating the ground state energy of a local Hamiltonian is a central p...
research
∙
12/13/2021
Quantum commitments and signatures without one-way functions
In the classical world, the existence of commitments is equivalent to th...
research
∙
09/29/2021
Certified Everlasting Zero-Knowledge Proof for QMA
In known constructions of classical zero-knowledge protocols for NP, eit...
research
∙
05/12/2021
Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication
Broadbent and Islam (TCC '20) proposed a quantum cryptographic primitive...
research
∙
02/18/2021
Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing
We propose three constructions of classically verifiable non-interactive...
research
∙
11/05/2020
Quantum randomized encoding, verification of quantum computing, no-cloning, and blind quantum computing
Randomized encoding is a powerful cryptographic primitive with various a...
research
∙
03/24/2020
Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center
The posthoc verification protocol [J. F. Fitzsimons, M. Hajdušek, and T....
research
∙
11/12/2019
Sumcheck-based delegation of quantum computing to rational server
Delegated quantum computing enables a client with a weak computational p...
research
∙
02/22/2019
Depth-scaling fine-grained quantum supremacy based on SETH and qubit-scaling fine-grained quantum supremacy based on Orthogonal Vectors and 3-SUM
We first show that under SETH and its variant, strong and weak classical...
research
∙
01/07/2019
Fine-grained quantum computational supremacy
It is known that several sub-universal quantum computing models cannot b...
research
∙
01/07/2019
Fine-grained quantum supremacy of the one-clean-qubit model
The one-clean-qubit model (or the DQC1 model) is a restricted model of q...
research
∙
12/10/2018
Impossibility of blind quantum sampling for classical client
Blind quantum computing enables a client, who can only generate or measu...
research
∙
05/09/2018
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups
In this paper we consider what can be computed by a user interacting wit...
research
∙
04/24/2018
Rational proofs for quantum computing
It is an open problem whether a classical client (verifier) can delegate...
research
∙
11/28/2017
