3,943 research outputs found
On the (Im-)Possibility of Extending Coin Toss
We consider the task of extending a given coin toss. By this, we mean the two-party task of using a single instance of a given coin toss protocol in order to interactively generate more random coins. A bit more formally, our goal is to generate n common random coins from a single use of an ideal functionality that gives m < n common random coins to both parties. In the framework of universal composability, we show the impossibility of securely extending a coin toss for statistical and perfect security. On the other hand, for computational security, the existence of a protocol for coin toss extension depends on the number m of random coins that can be obtained “for free.” For the case of stand-alone security, i.e., a simulation-based security definition without an environment, we present a protocol for statistically secure coin toss extension. Our protocol works for superlogarithmic m, which is optimal as we show the impossibility of statistically secure coin toss extension for smaller m. Combining our results with already known results, we obtain a (nearly) complete characterization under which circumstances coin toss extension is possible
A proposal for founding mistrustful quantum cryptography on coin tossing
A significant branch of classical cryptography deals with the problems which
arise when mistrustful parties need to generate, process or exchange
information. As Kilian showed a while ago, mistrustful classical cryptography
can be founded on a single protocol, oblivious transfer, from which general
secure multi-party computations can be built.
The scope of mistrustful quantum cryptography is limited by no-go theorems,
which rule out, inter alia, unconditionally secure quantum protocols for
oblivious transfer or general secure two-party computations. These theorems
apply even to protocols which take relativistic signalling constraints into
account. The best that can be hoped for, in general, are quantum protocols
computationally secure against quantum attack. I describe here a method for
building a classically certified bit commitment, and hence every other
mistrustful cryptographic task, from a secure coin tossing protocol. No
security proof is attempted, but I sketch reasons why these protocols might
resist quantum computational attack.Comment: Title altered in deference to Physical Review's fear of question
marks. Published version; references update
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
On Individual Risk
We survey a variety of possible explications of the term "Individual Risk."
These in turn are based on a variety of interpretations of "Probability,"
including Classical, Enumerative, Frequency, Formal, Metaphysical, Personal,
Propensity, Chance and Logical conceptions of Probability, which we review and
compare. We distinguish between "groupist" and "individualist" understandings
of Probability, and explore both "group to individual" (G2i) and "individual to
group" (i2G) approaches to characterising Individual Risk. Although in the end
that concept remains subtle and elusive, some pragmatic suggestions for
progress are made.Comment: 31 page
Facts, Values and Quanta
Quantum mechanics is a fundamentally probabilistic theory (at least so far as
the empirical predictions are concerned). It follows that, if one wants to
properly understand quantum mechanics, it is essential to clearly understand
the meaning of probability statements. The interpretation of probability has
excited nearly as much philosophical controversy as the interpretation of
quantum mechanics. 20th century physicists have mostly adopted a frequentist
conception. In this paper it is argued that we ought, instead, to adopt a
logical or Bayesian conception. The paper includes a comparison of the orthodox
and Bayesian theories of statistical inference. It concludes with a few remarks
concerning the implications for the concept of physical reality.Comment: 30 pages, AMS Late
Tight bounds for classical and quantum coin flipping
Coin flipping is a cryptographic primitive for which strictly better
protocols exist if the players are not only allowed to exchange classical, but
also quantum messages. During the past few years, several results have appeared
which give a tight bound on the range of implementable unconditionally secure
coin flips, both in the classical as well as in the quantum setting and for
both weak as well as strong coin flipping. But the picture is still incomplete:
in the quantum setting, all results consider only protocols with perfect
correctness, and in the classical setting tight bounds for strong coin flipping
are still missing. We give a general definition of coin flipping which unifies
the notion of strong and weak coin flipping (it contains both of them as
special cases) and allows the honest players to abort with a certain
probability. We give tight bounds on the achievable range of parameters both in
the classical and in the quantum setting.Comment: 18 pages, 2 figures; v2: published versio
A formal proof of the Born rule from decision-theoretic assumptions
I develop the decision-theoretic approach to quantum probability, originally
proposed by David Deutsch, into a mathematically rigorous proof of the Born
rule in (Everett-interpreted) quantum mechanics. I sketch the argument
informally, then prove it formally, and lastly consider a number of proposed
``counter-examples'' to show exactly which premises of the argument they
violate.Comment: 36 pages. To appear (under the title "How to prove the Born rule") in
Saunders, Barrett, Kent and Wallace, "Many Worlds? Everett, Quantum Theory,
and Reality" (Oxford University Press
- …