Related papers: Quantum Weak Coin Flipping
The counterfeit coin problem requires us to find all false coins from a given bunch of coins using a balance scale. We assume that the balance scale gives us only ``balanced'' or ``tilted'' information and that we know the number k of false…
Recent oracle separations [Kretschmer, TQC'21, Kretschmer et. al., STOC'23] have raised the tantalizing possibility of building quantum cryptography from sources of hardness that persist even if the polynomial hierarchy collapses. We…
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,…
A relativistic quantum information exchange protocol is proposed allowing two distant users to realize ``coin tossing'' procedure. The protocol is based on the point that in relativistic quantum theory reliable distinguishing between the…
We provide a mechanism that uses two biased coins and implements any distribution on a finite set of elements, in such a way that even if the outcomes of one of the coins is determined by an adversary, the final distribution remains…
While it is well known that a Turing machine equipped with the ability to flip a fair coin cannot compute more that a standard Turing machine, we show that this is not true for a biased coin. Indeed, any oracle set $X$ may be coded as a…
Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the…
We develop a general framework for parameter estimation that allows only trusted parties to access the result and achieves optimal precision. The protocols are designed such that adversaries can access some information indeterministically,…
Quantum bit commitment has long been known to be impossible. Nevertheless, just as in the classical case, imposing certain constraints on the power of the parties may enable the construction of asymptotically secure protocols. Here, we…
flip is an extremely simple and maximally local classical decoder which has been used to great effect in certain classes of classical codes. When applied to quantum codes there exist constant-weight errors (such as half of a stabiliser)…
Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment has been proven impossible through asynchronous exchange of classical and quantum information.…
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…
We propose quantum cryptographic protocols to secretly communicate a reference frame- unspeakable information in the sense it cannot be encoded into a string of bits. Two distant parties can secretly align their Cartesian axes by exchanging…
Coin tossing is a cryptographic task in which two parties who do not trust each other aim to generate a common random bit. Using classical communication this is impossible, but non trivial coin tossing is possible using quantum…
A divide-and-conquer cryptanalysis can often be mounted against some keystream generators composed of several (nonlinear) independent devices combined by a Boolean function. In particular, any parity-check relation derived from the periods…
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…
The safety of a quantum key distribution system relies on the fact that any eavesdropping attempt on the quantum channel creates errors in the transmission. For a given error rate, the amount of information that may have leaked to the…
We propose a protocol for a controlled experiment to measure a weak value of the electron's spin in a solid state device. The weak value is obtained by a two step procedure -- weak measurement followed by a strong one (post-selection),…
We propose an application for near-term quantum devices: namely, generating cryptographically certified random bits, to use (for example) in proof-of-stake cryptocurrencies. Our protocol repurposes the existing "quantum supremacy"…
The model of the quantum protocols sealing a classical bit is studied. It is shown that there exist upper bounds on its security. For any protocol where the bit can be read correctly with the probability $\alpha $, and reading the bit can…