Arbitrable blind quantum computation

Arbitrable blind quantum computation
复制标题

DOI:
10.1007/s11128-019-2482-4
复制
发表时间:
2017-09
影响因子:
2.5
通讯作者:
Go Sato;Takeshi Koshiba;T. Morimae
Go Sato;Takeshi Koshiba;T. Morimae
中科院分区:
物理与天体物理3区
文献类型:
--
作者:
Go Sato;Takeshi Koshiba;T. Morimae

文献摘要

相似文献

盲量子计算(单服务器情况下)是一种两方加密协议,涉及量子计算服务器Bob和客户端Alice,Alice希望将她的量子计算委托给Bob,而不透露她的量子算法以及她对算法的输入和输出。由于鲍勃可能会逃学,并假装执行一些计算,爱丽丝想验证鲍勃的诚实计算。为了解决这个问题,可验证性的概念已被认为是在文献中和几个协议的可验证盲计算已经开发。可验证的盲量子计算使爱丽丝能够检查鲍勃是否作弊。除了上述问题之外,还可能出现另一个问题。如果爱丽丝假装是一个客户,实际上是鲍勃的竞争对手,那么她可能会通过捏造鲍勃的不诚实来诽谤他。因此,如果Alice或Bob中的任何一个在作弊,那么除了Alice和Bob之外的“中立”裁判应该判断哪个是诚实的。可验证性的标准定义保证了只有Alice可以验证Bob的计算,因此,它应该被称为私有可验证性。如果鲍勃声称他是无辜的,虽然他实际上是作弊,那么爱丽丝不能说服任何其他人,鲍勃是真的作弊,而爱丽丝可以认识到鲍勃的作弊。本文将仲裁者作为第三方加入到盲量子计算中来解决上述问题,给出了一个可仲裁的盲量子计算方案,该方案在一定意义上提供了可公开验证性.
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 calledprivateverifiability. 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 providespublicverifiability in some sense.