108 research outputs found
Oblivious transfer using quantum entanglement
Based on quantum entanglement, an all-or-nothing oblivious transfer protocol
is proposed and is proven to be secure. The distinct merit of the present
protocol lies in that it is not based on quantum bit commitment. More
intriguingly, this OT protocol does not belong to a class of protocols denied
by the Lo's no-go theorem of one-sided two-party secure computation, and thus
its security can be achieved.Comment: 9 pages, 1 figur
Quantum identification system
A secure quantum identification system combining a classical identification
procedure and quantum key distribution is proposed. Each identification
sequence is always used just once and new sequences are ``refuelled'' from a
shared provably secret key transferred through the quantum channel. Two
identification protocols are devised. The first protocol can be applied when
legitimate users have an unjammable public channel at their disposal. The
deception probability is derived for the case of a noisy quantum channel. The
second protocol employs unconditionally secure authentication of information
sent over the public channel, and thus it can be applied even in the case when
an adversary is allowed to modify public communications. An experimental
realization of a quantum identification system is described.Comment: RevTeX, 4 postscript figures, 9 pages, submitted to Physical Review
Security of quantum bit string commitment depends on the information measure
Unconditionally secure non-relativistic bit commitment is known to be
impossible in both the classical and the quantum world. However, when
committing to a string of n bits at once, how far can we stretch the quantum
limits? In this letter, we introduce a framework of 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=4 log n+O(1) and b=4, which is impossible
classically. Our findings significantly extend known no-go results for quantum
bit commitment.Comment: To appear in PRL. Short version of quant-ph/0504078, long version to
appear separately. Improved security definition and result, one new lemma
that may be of independent interest. v2: added funding reference, no other
change
Variable Bias Coin Tossing
Alice is a charismatic quantum cryptographer who believes her parties are
unmissable; Bob is a (relatively) glamorous string theorist who believes he is
an indispensable guest. To prevent possibly traumatic collisions of
self-perception and reality, their social code requires that decisions about
invitation or acceptance be made via a cryptographically secure variable bias
coin toss (VBCT). This generates a shared random bit by the toss of a coin
whose bias is secretly chosen, within a stipulated range, by one of the
parties; the other party learns only the random bit. Thus one party can
secretly influence the outcome, while both can save face by blaming any
negative decisions on bad luck.
We describe here some cryptographic VBCT protocols whose security is
guaranteed by quantum theory and the impossibility of superluminal signalling,
setting our results in the context of a general discussion of secure two-party
computation. We also briefly discuss other cryptographic applications of VBCT.Comment: 14 pages, minor correction
Minimum disclosure proofs of knowledge
AbstractProtocols are given for allowing a “prover” to convince a “verifier” that the prover knows some verifiable secret information, without allowing the verifier to learn anything about the secret. The secret can be probabilistically or deterministically verifiable, and only one of the prover or the verifier need have constrained resources. This paper unifies and extends models and techniques previously put forward by the authors, and compares some independent related work
Reexamination of Quantum Bit Commitment: the Possible and the Impossible
Bit commitment protocols whose security is based on the laws of quantum
mechanics alone are generally held to be impossible. In this paper we give a
strengthened and explicit proof of this result. We extend its scope to a much
larger variety of protocols, which may have an arbitrary number of rounds, in
which both classical and quantum information is exchanged, and which may
include aborts and resets. Moreover, we do not consider the receiver to be
bound to a fixed "honest" strategy, so that "anonymous state protocols", which
were recently suggested as a possible way to beat the known no-go results are
also covered. We show that any concealing protocol allows the sender to find a
cheating strategy, which is universal in the sense that it works against any
strategy of the receiver. Moreover, if the concealing property holds only
approximately, the cheat goes undetected with a high probability, which we
explicitly estimate. The proof uses an explicit formalization of general two
party protocols, which is applicable to more general situations, and a new
estimate about the continuity of the Stinespring dilation of a general quantum
channel. The result also provides a natural characterization of protocols that
fall outside the standard setting of unlimited available technology, and thus
may allow secure bit commitment. We present a new such protocol whose security,
perhaps surprisingly, relies on decoherence in the receiver's lab.Comment: v1: 26 pages, 4 eps figures. v2: 31 pages, 5 eps figures; replaced
with published version; title changed to comply with puzzling Phys. Rev.
regulations; impossibility proof extended to protocols with infinitely many
rounds or a continuous communication tree; security proof of decoherence
monster protocol expanded; presentation clarifie
Spatially resolved spectroscopy of monolayer graphene on SiO2
We have carried out scanning tunneling spectroscopy measurements on
exfoliated monolayer graphene on SiO to probe the correlation between its
electronic and structural properties. Maps of the local density of states are
characterized by electron and hole puddles that arise due to long range
intravalley scattering from intrinsic ripples in graphene and random charged
impurities. At low energy, we observe short range intervalley scattering which
we attribute to lattice defects. Our results demonstrate that the electronic
properties of graphene are influenced by intrinsic ripples, defects and the
underlying SiO substrate.Comment: 6 pages, 7 figures, extended versio
Is Quantum Bit Commitment Really Possible?
We show that all proposed quantum bit commitment schemes are insecure because
the sender, Alice, can almost always cheat successfully by using an
Einstein-Podolsky-Rosen type of attack and delaying her measurement until she
opens her commitment.Comment: Major revisions to include a more extensive introduction and an
example of bit commitment. Overlap with independent work by Mayers
acknowledged. More recent works by Mayers, by Lo and Chau and by Lo are also
noted. Accepted for publication in Phys. Rev. Let
Optimality of private quantum channels
We addressed the question of optimality of private quantum channels. We have
shown that the Shannon entropy of the classical key necessary to securely
transfer the quantum information is lower bounded by the entropy exchange of
the private quantum channel and von Neumann entropy of the ciphertext
state . Based on these bounds we have shown that decomposition
of private quantum channels into orthogonal unitaries (if exists) is optimizing
the entropy. For non-ancillary single qubit PQC we have derived the optimal
entropy for arbitrary set of plaintexts. In particular, we have shown that
except when the (closure of the) set of plaintexts contains all states, one bit
key is sufficient. We characterized and analyzed all the possible single qubit
private quantum channels for arbitrary set of plaintexts. For the set of
plaintexts consisting of all qubit states we have characterized all possible
approximate private quantum channels and we have derived the relation between
the security parameter and the corresponding minimal entropy.Comment: no commen
- …