Experimental implementation of bit commitment in the noisy-storage model.

  title={Experimental implementation of bit commitment in the noisy-storage model.},
  author={Nelly Huei Ying Ng and Siddarth Koduru Joshi and Chia Chen Ming and Christian Kurtsiefer and Stephanie Wehner},
  journal={Nature communications},
Fundamental primitives such as bit commitment and oblivious transfer serve as building blocks for many other two-party protocols. Hence, the secure implementation of such primitives is important in modern cryptography. Here we present a bit commitment protocol that is secure as long as the attacker's quantum memory device is imperfect. The latter assumption is known as the noisy-storage model. We experimentally executed this protocol by performing measurements on polarization-entangled photon… 
Continuous-variable protocol for oblivious transfer in the noisy-storage model
A continuous-variable protocol which is secure against a dishonest party with bounded quantum storage capacity, and realize a proof-of-principle implementation is proposed and experimentally demonstrated.
On Bit Commitment and Oblivious Transfer in Measurement-Device Independent settings
This paper proposes for the first time protocols for Bit Commitment and Oblivious Transfer in the measurement-device independent (MDI) settings and analyzes their security, showing that there is a whole class of protocols that cannot be secure.
Oblivious transfer based on quantum state computational distinguishability
This paper presents a quantum computationally secure protocol for oblivious transfer between two parties, under the assumption of quantum hardness of state distinguishability, and it is feasible, in the sense that it is implementable in polynomial time.
Practical secure quantum communications
  • E. Diamanti
  • Computer Science
    Europe Optics + Optoelectronics
  • 2015
Practical implementations of two central protocols for quantum network applications, namely key distribution and coin flipping, are reviewed, demonstrating the protocols with provable security over record long distances in optical fibers and assessing the performance of the systems as well as their limitations.
Experimental plug and play quantum coin flipping.
A quantum coin flipping protocol is experimentally implemented that performs strictly better than classically possible over a distance suitable for communication over metropolitan area optical networks and provides a useful toolbox for future secure quantum communications.
Practical Quantum Bit Commitment Protocol Based on Quantum Oblivious Transfer
This paper proposes three practical quantum cryptographic protocols and gives a definition of physical security for QBC protocols and proves that the practical QBC protocol is physically secure and can be implemented in the real world.
An Information-Theoretic Perspective on the Quantum Bit Commitment Impossibility Theorem
This paper proposes a different approach to pinpoint the causes for which an unconditionally secure quantum bit commitment protocol cannot be realized, beyond the technical details on which the proof
Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation
This work presents a method to generate and distribute oblivious keys by exchanging qubits and by performing commitments using classical hash functions and concludes that it presents advantages in both areas when compared to public-key based techniques.
A brief review on quantum bit commitment
The feasibility of the practical quantum bit commitment protocol is demonstrated and it is demonstrated that it can be securely implemented with nowadays technology.
Security of two-state and four-state practical quantum bit-commitment protocols
This study studies cheating strategies against a practical four-state quantum bit-commitment protocol and its two-state variant when the underlying quantum channels are noisy and the cheating party is constrained to using single-qubit measurements only, and introduces a new strategy, based on certain post-measurement processes, to have better chances at cheating.


Implementation of two-party protocols in the noisy-storage model
This work analyzes security in a practical setting where the honest parties themselves are unable to perform perfect operations and need to deal with practical problems such as errors during transmission and detector inefficiencies.
Cryptography from noisy storage.
We show how to implement cryptographic primitives based on the realistic assumption that quantum storage of qubits is noisy. We thereby consider individual-storage attacks; i.e., the dishonest party
Unconditional Security From Noisy Quantum Storage
A novel protocols for oblivious transfer and bit commitment are constructed, and it is proved that realistic noise levels provide security even against the most general attack.
Cryptography in the bounded quantum-storage model
It is shown that oblivious transfer and bit commitment can be implemented in this model using protocols where honest parties need no quantum memory, whereas an adversarial player needs quantum memory of size at least n/2 in order to break the protocol, where n is the number of qubits transmitted.
Robust cryptography in the noisy-quantum-storage model
This work analyzes a protocol for the universal task of oblivious transfer that can be implemented using quantum-key-distribution (QKD) hardware in the practical setting where honest participants are unable to perform noise-free operations.
Unconditionally secure quantum bit commitment is impossible
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.
Unconditional Security Against Memory-Bounded Adversaries
We propose a private-key cryptosystem and a protocol for key agreement by public discussion that are unconditionally secure based on the sole assumption that an adversary's memory capacity is
Experimental quantum tossing of a single coin
This work analyzes in detail how the performance of a quantum coin tossing experiment should be compared to classical protocols, taking into account the inevitable experimental imperfections.
Insecurity of Quantum Secure Computations
  • H. Lo
  • Computer Science, Mathematics
  • 1996
This work shows that all one-sided two-party computations (which allow only one of the two parties to learn the result) are necessarily insecure, and constructs a class of functions that cannot be computed securely in any two-sidedTwo-party computation.