On the Computational Collapse of Quantum Information
On the Computational Collapse of Quantum Information
复制标题
论量子信息的计算崩溃
DOI：
10.7146/brics.v10i3.21774
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
L. Salvail
中科院分区：
文献类型：
--
作者：
C. Crépeau;P. Dumais;D. Mayers;L. Salvail
我们分析了使用计算绑定的字符串承诺方案来强制经典比特串的BB84编码的接收者在接收时进行测量的情况。由于测量会导致接收到的量子态不可逆转地崩塌，即使在测量后给出额外的信息也不允许接收者可靠地评估一些谓词适用于在该状态中编码的经典比特。这个基本的量子原语被称为量子度量承诺(QMC)，它允许经典函数的安全两方计算。QMC的对手是既能提供已测量接收状态的有效证据，同时仍能评估应用于编码的经典内容的谓词的对手。我们给出了QMC安全性的第一个量子黑盒约简，证明了弦承诺的结合性质。我们刻画了一类针对QMC的量子对手，它可以转化为针对串承诺的约束性质的弱形式的对手。我们的结果提供了一个1--2-不经意传输的构造，它在计算上对接收者是安全的，并且无条件地对发送者是安全的，不受任何满足弱绑定性质的字符串承诺方案的影响。
We analyze the situation where computationally binding string commitment schemes are used to force the receiver of a BB84 encoding of a classical bitstring to measure upon reception. Since measuring induces an irreversible collapse to the received quantum state, even given extra information after the measurement does not allow the receiver to evaluate reliably some predicates apply to the classical bits encoded in the state. This fundamental quantum primitive is called quantum measure commitment (QMC) and allows for secure two-party computation of classical functions. An adversary to QMC is one that can both provide valid proof of having measured the received states while still able to evaluate a predicate applied to the classical content of the encoding. We give the first quantum black-box reduction for the security of QMC to the binding property of the string commitment. We characterize a class of quantum adversaries against QMC that can be transformed into adversaries against a weak form for the binding property of the string commitment. Our result provides a construction for 1--2-oblivious transfer that is computationally secure against the receiver and unconditionally secure against the sender from any string commitment scheme satisfying a weak binding property.
影响因子：
2.2
作者：
P. Dumais;D. Mayers;L. Salvail
通讯作者：
P. Dumais;D. Mayers;L. Salvail