pith. sign in

arxiv: quant-ph/0305144 · v3 · submitted 2003-05-23 · 🪐 quant-ph

How to Build Unconditionally Secure Quantum Bit Commitment Protocols

classification 🪐 quant-ph
keywords securecommitmentprotocolsquantumimpossibilityindicatedobtainingproof
0
0 comments X
read the original abstract

The ``impossibility proof'' on unconditionally secure quantum bit commitment is critically analyzed. Many possibilities for obtaining a secure bit commitment protocol are indicated, purely on the basis of two-way quantum communications, which are not covered by the impossibility proof formulation. They are classified under six new types of protocols, with security proofs for specific examples on four types. Reasons for some previously failed attempts at obtaining secure protocols are also indicated.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.