ترغب بنشر مسار تعليمي؟ اضغط هنا

Possibility, Impossibility and Cheat-Sensitivity of Quantum Bit String Commitment

108   0   0.0 ( 0 )
 نشر من قبل Stephanie Wehner
 تاريخ النشر 2005
  مجال البحث فيزياء
والبحث باللغة English
 تأليف Harry Buhrman




اسأل ChatGPT حول البحث

Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum worlds. But when committing to a string of n bits at once, how far can we stretch the quantum limits? In this paper, we introduce a framework for quantum schemes where Alice commits a string of n bits to Bob in such a way that she can only cheat on a bits and Bob can learn at most b bits of information before the reveal phase. Our results are two-fold: we show by an explicit construction that in the traditional approach, where the reveal and guess probabilities form the security criteria, no good schemes can exist: a+b is at least n. If, however, we use a more liberal criterion of security, the accessible information, we construct schemes where a=4log n+O(1) and b=4, which is impossible classically. We furthermore present a cheat-sensitive quantum bit string commitment protocol for which we give an explicit tradeoff between Bobs ability to gain information about the committed string, and the probability of him being detected cheating.



قيم البحث

اقرأ أيضاً

Quantum bit commitment has been known to be impossible by the independent proofs of Mayers, and Lo and Chau, under the assumption that the whole quantum states right before the unveiling phase are static to users. We here provide an unconditionally s ecure non-static quantum bit commitment protocol with a trusted third party, which is not directly involved in any communications between users and can be limited not to get any information of commitment without being detected by users. We also prove that our quantum bit commitment protocol is not secure without the help of the trusted third party. The proof is basically different from the Mayers-Lo-Chaus no-go theorem, because we do not assume the staticity of the finally shared quantum states between users.
299 - A. Mandilara , N. J. Cerf 2011
Quantum bit commitment has long been known to be impossible. Nevertheless, just as in the classical case, imposing certain constraints on the power of the parties may enable the construction of asymptotically secure protocols. Here, we introduce a qu antum bit commitment protocol and prove that it is asymptotically secure if cheating is restricted to Gaussian operations. This protocol exploits continuous-variable quantum optical carriers, for which such a Gaussian constraint is experimentally relevant as the high optical nonlinearity needed to effect deterministic non-Gaussian cheating is inaccessible.
82 - Jamie Sikora , John Selby 2017
Bit-commitment is a fundamental cryptographic task, in which Alice commits a bit to Bob such that she cannot later change the value of the bit, while, simultaneously, the bit is hidden from Bob. It is known that ideal bit-commitment is impossible wit hin quantum theory. In this work, we show that it is also impossible in generalised probabilistic theories (under a small set of assumptions) by presenting a quantitative trade-off between Alices and Bobs cheating probabilities. Our proof relies crucially on a formulation of cheating strategies as cone programs, a natural generalisation of semidefinite programs. In fact, using the generality of this technique, we prove that this result holds for the more general task of integer-commitment.
Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what (possibly weak) primitives they can be based on. We consider as such starting points general two-party input-output systems that do not allow for message transmission, and show that they can be used for realizing unconditionally secure bit commitment as soon as they are non-trivial, i.e., cannot be securely realized from distributed randomness only.
119 - Guang Ping He 2019
Unconditionally secure quantum bit commitment (QBC) was widely believed to be impossible for more than two decades. But recently, basing on an anomalous behavior found in quantum steering, we proposed a QBC protocol which can be unconditionally secur e in principle. The protocol requires the use of infinite-dimensional systems, thus it may seem less feasible at first glance. Here we show that such infinite-dimensional systems can be implemented with quantum optical methods, and propose an experimental scheme using Mach-Zehnder interferometer.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا