for malicious adversaries. The case of multiple parties was addressed in [@Ben-Or2006; @multipartyqc] where an honest majority was required.

In this work we use as basis the universal blind quantum computation protocol [@bfk] and its verifiable version [@fk]. For the case of weak specious adversaries, the 2PQC was addressed in [@KW16] while the multiparty quantum computation was also addressed in [@KP16], again in a restricted setting. While we use measurement-based quantum computation (MBQC) [@onewaycomputer], similar blind and verification protocols exist in the teleportation model [@B2015] and 2PQC or MPQC protocols could be explored for that case as well as other blind verification protocols such as [@hm2015].

Preliminaries and Security Definitions {#prelims}
======================================

Verifiable Blind Quantum Computation
------------------------------------

The model for quantum computations used in our contribution is MBQC [@onewaycomputer]. In this section we introduce MBQC and revise protocols for blind quantum computation (server performs computation without learning input/output or computation) [@bfk] and verifiable blind quantum computation (client can also verify that the computation was performed correctly) [@fk] which are based on it.

The MBQC model of computation is equivalent to the circuit model as it is based on the gate teleportation principle. One starts with a large, generic entangled state 