knowledge proofs [@Wat09] and zero knowledge proofs of knowledge [@Unr12]).

#### Our Contribution

1.  We introduce a Quantum Computation Cut-and-Choose technique. Application of this technique is made possible because of the unique decomposition of quantum computation into a classical control and a quantum resource in the measurement-based quantum computing models such as gate teleportation. This separation furthermore provides a platform for a client-server setting for secure delegated computing [@bfk].

2.  We give a protocol for 2PQC with classical input and output[^1] which is secure against “quantum covert” adversaries, a notion of strong adversaries similar with the classical covert adversaries [@AumLin07] (see below for formal definition and motivation). We use the aforementioned QC-CC technique and address the subtleties in the security proof due to rewinding. Our protocol, which builds on the work of [@KW16] that gave a protocol for 2PQC secure against weak specious adversaries, resembles the original protocol by Yao [@Yao86] (e.g. asymmetry between the two parties) and in particular the one in [@LinPin07], where Yao’s protocol is boosted to the malicious case using the classical Cut-and-Choose technique.

3.  A key obstruction when using classical techniques for boosting the security of quantum protocols is that in general rewinding the *quantum* 