Related papers: Weak coin flipping with small bias
Consider a coin tossing experiment which consists of tossing one of two coins at a time, according to a renewal process. The first coin is fair and the second has probability $1/2 + \theta$, $\theta \in [-1/2,1/2]$, $\theta$ unknown but…
We show that the phenomenon of anomalous weak values is not limited to quantum theory. In particular, we show that the same features occur in a simple model of a coin subject to a form of classical backaction with pre- and post-selection.…
Is it possible that a measurement of a spin component of a spin-1/2 particle yields the value 100? In 1988 Aharonov, Albert and Vaidman argued that upon pre- and postselection of particular spin states, weakening the coupling of a standard…
Oblivious transfer is an important primitive in modern cryptography. Applications include secure multiparty computation, oblivious sampling, e-voting, and signatures. Information-theoretically secure perfect 1-out-of 2 oblivious transfer is…
We present a family of quantum money schemes with classical verification which display a number of benefits over previous proposals. Our schemes are based on hidden matching quantum retrieval games and they tolerate noise up to 23%, which…
Random selection, leader election, and collective coin flipping are fundamental tasks in fault-tolerant distributed computing. We study these problems in the full-information model where despite decades of study, key gaps remain in our…
Quantum information processing is in real systems often limited by dissipation, stemming from remaining uncontrolled interaction with microscopic degrees of freedom. Given recent experimental progress, we consider weak dissipation,…
Wiesner's quantum money [5] is a simple, information-theoretically secure quantum cryptographic protocol. In his protocol, a mint issues quantum bills and anyone can query the mint to authenticate a bill. If the mint returns bogus bills…
We consider a modified version of the BB84 quantum key distribution protocol in which the angle between two different bases are less than $\pi/4$. We show that the channel parameter estimate becomes the same as the original protocol with…
Randomisation is a critical tool in designing distributed systems. The common coin primitive, enabling the system members to agree on an unpredictable random number, has proven to be particularly useful. We observe, however, that it is…
Expansion and amplification of weak randomness plays a crucial role in many security protocols. Using quantum devices, such procedure is possible even without trusting the devices used, by utilizing correlations between outcomes of parts of…
We propose a communication protocol exploiting correlations between two events with a definite time-ordering: a) the outcome of a {\em weak measurement} on a spin, and b) the outcome of a subsequent ordinary measurement on the spin. In our…
Coin-flipping is a fundamental cryptographic task where a spatially separated Alice and Bob wish to generate a fair coin-flip over a communication channel. It is known that ideal coin-flipping is impossible in both classical and quantum…
When the weak value of a projector is 1, a quantum system behaves as in that eigenstate with probability 1. By definition, however, the weak value may take an anomalous value lying outside the range of probability like -1. From the…
Oblivious transfer is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, oblivious transfer cannot be achieved in an unconditionally secure way…
Unconditionally secure bit commitment and coin flipping are known to be impossible in the classical world. Bit commitment is known to be impossible also in the quantum world. We introduce a related new primitive - {\em quantum bit escrow}.…
We employ the technique of weak measurement in order to enable preservation of teleportation fidelity for two-qubit noisy channels. We consider one or both qubits of a maximally entangled state to undergo amplitude damping, and show that…
We focus on a family of quantum coin-flipping protocols based on bit-commitment. We discuss how the semidefinite programming formulations of cheating strategies can be reduced to optimizing a linear combination of fidelity functions over a…
We prove an easy but very weak version of Chernoff inequality. Namely, that the probability that in $6M$ throws of a fair coin, one gets at most $M$ heads is $\leq 1/2^M$.
Weak measurement is a novel quantum measurement scheme, which is usually characterized by the weak value formalism. To guarantee the validity of the weak value formalism, the fidelity between the pre-selection and the post-selection should…