Bit Commitment from Non-Signaling Correlations

Abstract

Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what (possibly weak) primitives they can be based on. We consider as such starting points general two-party input-output systems that do not allow for message transmission, and show that they can be used for realizing unconditionally secure bit commitment as soon as they are non-trivial, i.e., cannot be securely realized from distributed randomness only.

New title. Changes in the introduction and the preliminaries

References in corpus (4)

• Unconditionally secure quantum bit commitment is impossible
• Is Quantum Bit Commitment Really Possible?
• Implications of Superstrong Nonlocality for Cryptography
• On the randomness of independent experiments

Cited by in corpus (1)

• Couplers for Non-Locality Swapping