### Abstract

Blind quantum computation (of a single-server case) is a two-party cryptographic protocol which involves a quantum computation server Bob and a client Alice who wants to delegate her quantum computation to Bob without revealing her quantum algorithms and her input to and output from the algorithms. Since Bob may be truant and pretend to execute some computation, Alice wants to verify Bob’s honesty on computation. To resolve this problem, the notion of the verifiability has been considered in the literature and several protocols of verifiable blind computation have been developed. Verifiable blind quantum computation enables Alice to check whether Bob is cheating or not. In addition to the above problem, another problem could arise. If Alice pretends to be a client and is actually a competitor against Bob, then she might slander Bob by fabricating his dishonesty. Therefore, if either Alice or Bob is cheating, then a “neutral” referee other than Alice and Bob should judge which is honest. The standard definition of the verifiability guarantees that only Alice can verify Bob’s computation, and thus, it should be called private verifiability. If Bob claims his innocence though he is actually cheating, then Alice cannot persuade any others that Bob is really cheating while Alice can recognize Bob’s cheating. In this paper, we incorporate arbitrators as the third party into blind quantum computation to resolve the above problems and give an arbitrable blind quantum computation scheme, which provides public verifiability in some sense.

Original language | English |
---|---|

Article number | 370 |

Journal | Quantum Information Processing |

Volume | 18 |

Issue number | 12 |

DOIs | |

Publication status | Published - 2019 Dec 1 |

### Fingerprint

### ASJC Scopus subject areas

- Electronic, Optical and Magnetic Materials
- Statistical and Nonlinear Physics
- Theoretical Computer Science
- Signal Processing
- Modelling and Simulation
- Electrical and Electronic Engineering

### Cite this

*Quantum Information Processing*,

*18*(12), [370]. https://doi.org/10.1007/s11128-019-2482-4

**Arbitrable blind quantum computation.** / Sato, Go; Koshiba, Takeshi; Morimae, Tomoyuki.

Research output: Contribution to journal › Article

*Quantum Information Processing*, vol. 18, no. 12, 370. https://doi.org/10.1007/s11128-019-2482-4

}

TY - JOUR

T1 - Arbitrable blind quantum computation

AU - Sato, Go

AU - Koshiba, Takeshi

AU - Morimae, Tomoyuki

PY - 2019/12/1

Y1 - 2019/12/1

N2 - Blind quantum computation (of a single-server case) is a two-party cryptographic protocol which involves a quantum computation server Bob and a client Alice who wants to delegate her quantum computation to Bob without revealing her quantum algorithms and her input to and output from the algorithms. Since Bob may be truant and pretend to execute some computation, Alice wants to verify Bob’s honesty on computation. To resolve this problem, the notion of the verifiability has been considered in the literature and several protocols of verifiable blind computation have been developed. Verifiable blind quantum computation enables Alice to check whether Bob is cheating or not. In addition to the above problem, another problem could arise. If Alice pretends to be a client and is actually a competitor against Bob, then she might slander Bob by fabricating his dishonesty. Therefore, if either Alice or Bob is cheating, then a “neutral” referee other than Alice and Bob should judge which is honest. The standard definition of the verifiability guarantees that only Alice can verify Bob’s computation, and thus, it should be called private verifiability. If Bob claims his innocence though he is actually cheating, then Alice cannot persuade any others that Bob is really cheating while Alice can recognize Bob’s cheating. In this paper, we incorporate arbitrators as the third party into blind quantum computation to resolve the above problems and give an arbitrable blind quantum computation scheme, which provides public verifiability in some sense.

AB - Blind quantum computation (of a single-server case) is a two-party cryptographic protocol which involves a quantum computation server Bob and a client Alice who wants to delegate her quantum computation to Bob without revealing her quantum algorithms and her input to and output from the algorithms. Since Bob may be truant and pretend to execute some computation, Alice wants to verify Bob’s honesty on computation. To resolve this problem, the notion of the verifiability has been considered in the literature and several protocols of verifiable blind computation have been developed. Verifiable blind quantum computation enables Alice to check whether Bob is cheating or not. In addition to the above problem, another problem could arise. If Alice pretends to be a client and is actually a competitor against Bob, then she might slander Bob by fabricating his dishonesty. Therefore, if either Alice or Bob is cheating, then a “neutral” referee other than Alice and Bob should judge which is honest. The standard definition of the verifiability guarantees that only Alice can verify Bob’s computation, and thus, it should be called private verifiability. If Bob claims his innocence though he is actually cheating, then Alice cannot persuade any others that Bob is really cheating while Alice can recognize Bob’s cheating. In this paper, we incorporate arbitrators as the third party into blind quantum computation to resolve the above problems and give an arbitrable blind quantum computation scheme, which provides public verifiability in some sense.

UR - http://www.scopus.com/inward/record.url?scp=85074264001&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85074264001&partnerID=8YFLogxK

U2 - 10.1007/s11128-019-2482-4

DO - 10.1007/s11128-019-2482-4

M3 - Article

AN - SCOPUS:85074264001

VL - 18

JO - Quantum Information Processing

JF - Quantum Information Processing

SN - 1570-0755

IS - 12

M1 - 370

ER -