Composable security in relativistic quantum cryptography
arXiv:1708.00433 · doi:10.1088/1367-2630/ab0e3b
Abstract
Relativistic protocols have been proposed to overcome some impossibility results in classical and quantum cryptography. In such a setting, one takes the location of honest players into account, and uses the fact that information cannot travel faster than the speed of light to limit the abilities of dishonest agents. For example, various relativistic bit commitment protocols have been proposed. Although it has been shown that bit commitment is sufficient to construct oblivious transfer and thus multiparty computation, composing specific relativistic protocols in this way is known to be insecure. A composable framework is required to perform such a modular security analysis of construction schemes, but no known frameworks can handle models of computation in Minkowski space. By instantiating the systems model from the Abstract Cryptography framework with Causal Boxes, we obtain such a composable framework, in which messages are assigned a location in Minkowski space (or superpositions thereof). This allows us to analyse relativistic protocols and to derive novel possibility and impossibility results. We show that (1) coin flipping can be constructed from the primitive channel with delay, (2) biased coin flipping, bit commitment and channel with delay are all impossible without further assumptions, and (3) it is impossible to improve a channel with delay. Note that the impossibility results also hold in the computational and bounded storage settings. This implies in particular non-composability of all proposed relativistic bit commitment protocols, of bit commitment in the bounded storage model, and of biased coin flipping.
arXiv commentClarified definitions and formulations, clarified how causal boxes are instantiated, strengthened results
References in corpus (25)
- Satellite-to-ground quantum key distribution
- Ground-to-satellite quantum teleportation
- Unconditionally secure quantum bit commitment is impossible
- Quantum correlations with no causal order
- Is Quantum Bit Commitment Really Possible?
- Quantum computations without definite causal structure
- Theoretical framework for quantum networks
- Universal blind quantum computation
- Experimental Superposition of Orders of Quantum Gates
- Computational advantage from quantum-controlled ordering of gates
- Experimental Verification of an Indefinite Causal Order
- Unconditionally Secure Bit Commitment
- Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
- Universally Composable Quantum Multi-Party Computation
- Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
- Quantum computation with programmable connections between gates
- Composable security of delegated quantum computation
- Multiparty Delegated Quantum Computing
- The Operator Tensor Formulation of Quantum Theory
- Practical relativistic bit commitment
- On a measure of distance for quantum strategies
- Secure bit commitment from relativistic constraints
- Causal Boxes: Quantum Information-Processing Systems Closed under Composition
- Arbitrarily long relativistic bit commitment
- Classical Cryptographic Protocols in a Quantum World
Cited by in corpus (16)
- Security in Quantum Cryptography
- A device-independent protocol for XOR oblivious transfer
- Quantum cryptography beyond key distribution: theory and experiment
- Embedding cyclic information-theoretic structures in acyclic spacetimes: no-go results for indefinite causality
- Transmission of quantum information through quantum fields in curved spacetimes
- Composable and Finite Computational Security of Quantum Message Transmission
- Composable Security for Multipartite Entanglement Verification
- Composably secure device-independent encryption with certified deletion
- The Unruh-DeWitt model and its joint interacting Hilbert space
- Unconditionally secure relativistic multi-party biased coin flipping and die rolling
- Mapping indefinite causal order processes to composable quantum protocols in a spacetime
- Quantum-secure multiparty deep learning
- An optical implementation of quantum bit commitment using infinite-dimensional systems
- On the composable security of weak coin flipping
- Quantum oblivious transfer: a short review
- A decompositional framework for process theories in spacetime