
Oblivious Transfer is in MiniQCrypt
MiniQCrypt is a world where quantumsecure oneway functions exist, and ...
read it

SafeComp: Protocol For Certifying Cloud Computations Integrity
We define a problem of certifying computation integrity performed by som...
read it

PostQuantum MultiParty Computation in Constant Rounds
We obtain the first constantround postquantum multiparty computation ...
read it

Twomessage verification of quantum computation
We describe a twomessage protocol that enables a purely classical verif...
read it

Silence
The cost of communication is a substantial factor affecting the scalabil...
read it

Classical Verification of Quantum Computations with Efficient Verifier
In this paper, we extend the protocol of classical verification of quant...
read it

Multitheorem (Malicious) DesignatedVerifier NIZK for QMA
We present the first noninteractive zeroknowledge argument system for ...
read it
On The Round Complexity of TwoParty Quantum Computation
We investigate the round complexity of maliciouslysecure twoparty quantum computation (2PQC) with setup, and obtain the following results:  A threemessage protocol (twomessage if only one party receives output) in the common random string (CRS) model assuming classical twomessage oblivious transfer (OT) with postquantum malicious security. This round complexity is optimal for the sequential communication setting. Under the additional assumption of reusable malicious designatedverifier noninteractive zeroknowledge (MDVNIZK) arguments for NP, our techniques give an MDVNIZK for QMA. Each of the assumptions mentioned above is known from the quantum hardness of learning with errors (QLWE).  A protocol with two simultaneous rounds of communication, in a quantum preprocessing model, assuming subexponential QLWE. In fact, we construct a threeround protocol in the CRS model with only two rounds of online communication, which implies the above result. Along the way, we develop a new delayed simulation technique that we call "simulation via teleportation," which may be useful in other settings. In addition, we perform a preliminary investigation into barriers and possible approaches for tworound 2PQC in the CRS model, including an impossibility result for a natural class of simulators, and a proofofconcept construction from a strong form of quantum virtual blackbox (VBB) obfuscation. Prior to our work, maliciouslysecure 2PQC required round complexity linear in the size of the quantum circuit.
READ FULL TEXT
Comments
There are no comments yet.