
Noninteractive classical verification of quantum computation
In a recent breakthrough, Mahadev constructed an interactive protocol th...
read it

Beating Classical Impossibility of Position Verification
Chandran et al. (SIAM J. Comput.'14) formally introduced the cryptograph...
read it

Secure Software Leasing from Standard Assumptions
Secure software leasing (SSL) is a quantum cryptographic primitive that ...
read it

Almost Public Quantum Coins
In a quantum money scheme, a bank can issue money that users cannot coun...
read it

Informationtheoreticallysound noninteractive classical verification of quantum computing with trusted center
The posthoc verification protocol [J. F. Fitzsimons, M. Hajdušek, and T....
read it

A comonadic view of simulation and quantum resources
We study simulation and quantum resources in the setting of the sheafth...
read it

Simpler Proofs of Quantumness
A proof of quantumness is a method for provably demonstrating (to a clas...
read it
SemiQuantum Money
Private quantum money allows a bank to mint quantum money states that it can later verify, but that no one else can forge. In classically verifiable quantum money  introduced by Gavinsky [Gav12]  the verification is done via an interactive protocol between the bank and the user, where the communication is classical, and the computational resources required of the bank are classical. In this work, we consider stateless interactive protocols in which the minting is likewise classical, and construct a private money scheme that achieves these two notions simultaneously (i.e., classical verification and classical minting). We call such a construction a private semiquantum money scheme, since all the requirements from the bank in terms of computation and communication are classical. In terms of techniques, our main contribution is a strong parallel repetition theorem for Noisy Trapdoor Claw Free Functions (NTCF), a notion introduced by Brakerski et al. [BCM+18].
READ FULL TEXT
Comments
There are no comments yet.