5,003 research outputs found
No Superluminal Signaling Implies Unconditionally Secure Bit Commitment
Bit commitment (BC) is an important cryptographic primitive for an agent to
convince a mutually mistrustful party that she has already made a binding
choice of 0 or 1 but only to reveal her choice at a later time. Ideally, a BC
protocol should be simple, reliable, easy to implement using existing
technologies, and most importantly unconditionally secure in the sense that its
security is based on an information-theoretic proof rather than computational
complexity assumption or the existence of a trustworthy arbitrator. Here we
report such a provably secure scheme involving only one-way classical
communications whose unconditional security is based on no superluminal
signaling (NSS). Our scheme is inspired by the earlier works by Kent, who
proposed two impractical relativistic protocols whose unconditional securities
are yet to be established as well as several provably unconditionally secure
protocols which rely on both quantum mechanics and NSS. Our scheme is
conceptually simple and shows for the first time that quantum communication is
not needed to achieve unconditional security for BC. Moreover, with purely
classical communications, our scheme is practical and easy to implement with
existing telecom technologies. This completes the cycle of study of
unconditionally secure bit commitment based on known physical laws.Comment: This paper has been withdrawn by the authors due to a crucial
oversight on an earlier work by A. Ken
Implementable Quantum Bit-String Commitment Protocol
Quantum bit-string commitment[A.Kent, Phys.Rev.Lett., 90, 237901 (2003)] or
QBSC is a variant of bit commitment (BC). In this paper, we propose a new QBSC
protocol that can be implemented using currently available technology, and
prove its security under the same security criteria as discussed by Kent. QBSC
is a generalization of BC, but has slightly weaker requirements, and our
proposed protocol is not intended to break the no-go theorem of quantum BC.Comment: To appear in Phys. Rev. A., 9 pages, 2 figure
Commitment and Oblivious Transfer in the Bounded Storage Model with Errors
The bounded storage model restricts the memory of an adversary in a
cryptographic protocol, rather than restricting its computational power, making
information theoretically secure protocols feasible. We present the first
protocols for commitment and oblivious transfer in the bounded storage model
with errors, i.e., the model where the public random sources available to the
two parties are not exactly the same, but instead are only required to have a
small Hamming distance between themselves. Commitment and oblivious transfer
protocols were known previously only for the error-free variant of the bounded
storage model, which is harder to realize
Device-Independent Relativistic Quantum Bit Commitment
We examine the possibility of device-independent relativistic quantum bit
commitment. We note the potential threat of {\it location attacks}, in which
the behaviour of untrusted devices used in relativistic quantum cryptography
depends on their space-time location. We describe relativistic quantum bit
commitment schemes that are immune to these attacks, and show that these
schemes offer device-independent security against hypothetical post-quantum
adversaries subject only to the no-signalling principle. We compare a
relativistic classical bit commitment scheme with similar features, and note
some possible advantages of the quantum schemes
- …