Bit commitment from weak non-locality
@article{Wolf2005BitCF, title={Bit commitment from weak non-locality}, author={Stefan Wolf and J{\"u}rg Wullschleger}, journal={IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005.}, year={2005}, pages={28-30} }
So-called non-local boxes, which have been introduced as an idealization n different respects - of the behavior of entangled quantum states, have been known to allow for unconditional bit commitment between the two involved parties. We show that, actually, any possible non-local correlation which produces random bits on both sides can be used to implement bit commitment, and that this holds even when the parties are allowed to delay their inputs to the box. Since a particular example is the…
8 Citations
Bit Commitment From Nonsignaling Correlations
- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2011
This work considers as starting points general two-party input-output systems that do not allow for message transmission and shows that they can be used for realizing unconditionally secure bit commitment as soon as they are nontrivial, i.e., cannot be securely realized from distributed randomness only.
Nonclassicality without entanglement enables bit commitment
- Computer Science, Mathematics2008 IEEE Information Theory Workshop
- 2008
It is proved that in all such theories that are locally non-classical but do not have entanglement, there exists a bit commitment protocol that is exponentially secure in the number of systems used.
Cheat sensitive quantum bit commitment via pre- and post-selected quantum states
- Computer Science, PhysicsQuantum Inf. Process.
- 2014
The analysis indicates that both of the two participants’ cheat strategies will be detected with non-zero probability, and the protocol can be implemented with today’s technology as a long-term quantum memory is not needed.
Quantum And Relativistic Protocols For Secure Multi-Party Computation
- Computer Science, Mathematics
- 2009
A new protocol for non-relativistic strong coin tossing is introduced, which matches the security of the best protocol known to date while using a conceptually different approach to achieve the task.
Quantum bit commitment with cheat sensitive binding and approximate sealing
- Physics
- 2014
This paper proposes a cheat-sensitive quantum bit commitment scheme based on single photons, in which Alice commits a bit to Bob. Here, Bob’s probability of success at cheating as obtains the…
Entropy in general physical theories
- Computer Science
- 2010
It is shown that in a world that admits superstrong correlations in the form of non-local boxes no entropic measure can exhibit all the properties the authors commonly accept in a quantum setting, and there exists no ‘reasonable’ measure of conditional entropy that is subadditive.
Entropy in general physical theories
- Computer Science
- 2010
An entropic measure of information is proposed for any physical theory that admits systems, states and measurements and is proved a coding theorem for some theories that is analogous to the quantum and classical settings, providing us with an appealing operational interpretation.
New Journal of Physics Entropy in general physical theories
- Computer Science
- 2010
It is shown that in a world that admits superstrong correlations in the form of non-local boxes no entropic measure can exhibit all the properties the authors commonly accept in a quantum setting, and there exists no ‘reasonable’ measure of conditional entropy that is subadditive.
References
SHOWING 1-10 OF 28 REFERENCES
Implications of superstrong non-locality for cryptography
- Physics, Computer ScienceProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- 2006
This work first construct a protocol for bit commitment and then shows how to achieve oblivious transfer using non-local boxes, which have been shown to be impossible using quantum mechanics alone.
The Physics of No-Bit-Commitment: Generalized Quantum Non-Locality Versus Oblivious Transfer
- PhysicsQuantum Inf. Process.
- 2006
This work shows that the recent work of Wolf and Wullschleger on oblivious transfer apparently opens the possibility that non-local correlations which are stronger than those in quantum mechanics could be used for bit-commitment, and resolves this apparent paradox by stressing the difference between non- local correlations and oblivious transfer.
Unconditionally secure quantum bit commitment is impossible
- Computer Science, Mathematics
- 1997
It is shown that the claim that quantum cryptography can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space, or technology available to the cheaters, does not hold for any quantum bit commitment protocol.
Simulating maximal quantum entanglement without communication.
- PhysicsPhysical review letters
- 2005
It is shown that a single instance of the latter elementary nonlocal correlation suffices to simulate exactly all possible projective measurements that can be performed on a maximally entangled state of two qubits, with no communication needed at all.
Quantum entanglement can be simulated without communication
- Physics
- 2004
It has recently been shown that all causal correlations between two parties which output each one bit, a and b, when receiving each one bit, x and y, can be expressed as convex combinations of local…
Oblivious transfer and quantum non-locality
- Computer Science, MathematicsProceedings. International Symposium on Information Theory, 2005. ISIT 2005.
- 2005
This work shows a close connection, in a cryptographic sense, between OT and the "PR primitive," and shows that unconditional OT can be achieved from a single realization of PR, and vice versa.
Entanglement swapping for generalized nonlocal correlations
- Physics
- 2005
We consider an analog of entanglement-swapping for a set of black boxes with the most general nonlocal correlations consistent with relativity (including correlations which are stronger than any…
Limit on nonlocality in any world in which communication complexity is not trivial.
- Computer SciencePhysical review letters
- 2006
A partial answer to the question why are the correlations achievable by quantum mechanics not maximal among those that preserve causality is given by showing that slightly stronger correlations would result in a world in which communication complexity becomes trivial.
General properties of nonsignaling theories
- Philosophy
- 2006
This article identifies a series of properties common to all theories that do not allow for superluminal signaling and predict the violation of Bell inequalities. Intrinsic randomness, uncertainty…