Quantum one-time tables for unconditionally secure qubit-commitment

Abstract

The commodity-based cryptography is an alternative approach to realize conventionally impossible cryptographic primitives such as unconditionally secure bit-commitment by consuming pre-established correlation between distrustful participants. A unit of such classical correlation is known as the one-time table (OTT). In this paper, we introduce a new example besides quantum key distribution in which quantum correlation is useful for cryptography. We propose a scheme for unconditionally secure qubit-commitment, a quantum cryptographic primitive forbidden by the recently proven no-masking theorem in the standard model, based on the consumption of the quantum generalization of the OTT, the bipartite quantum state we named quantum one-time tables (QOTT). The construction of the QOTT is based on the newly analyzed internal structure of quantum masker and the quantum secret sharing schemes. Our qubit-commitment scheme is shown to be universally composable. We propose to measure the randomness cost of preparing a (Q)OTT in terms of its entropy, and show that the QOTT with superdense coding can increase the security level with half the cost of OTTs for unconditionally secure bit-commitment. The QOTT exemplifies an operational setting where neither maximally classically correlated state nor maximally entangled state, but rather a well-structured partially entangled mixed state is more valuable resource.

arXiv comment9+8 pages, to be published in Quantum: Creative Commons issue updated

References in corpus (18)

• Introducing Quantum Discord
• How to share a quantum secret
• Quantum Copying: Beyond the No-Cloning Theorem
• Unified View of Quantum and Classical Correlations
• Unconditionally secure quantum bit commitment is impossible
• Noncommuting mixed states cannot be broadcast
• On the Theory of Quantum Secret Sharing
• Is Quantum Bit Commitment Really Possible?
• Experimental Quantum Secret Sharing and Third-Man Quantum Cryptography
• Unconditionally Secure Bit Commitment
• Multiparty quantum secret sharing of secure direct communication
• Cross-Platform Verification of Intermediate Scale Quantum Devices
• Universally Composable Quantum Multi-Party Computation
• On Multipartite Pure-State Entanglement
• Masking quantum information is impossible
• Weaker entanglement guarantees stronger entanglement
• Catalytic quantum randomness
• State exchange with quantum side information

Cited by in corpus (4)

• The Min-entropy as a Resource for One-Shot Private State Transfer, Quantum Masking and State Transition
• Delocalized and Dynamical Catalytic Randomness and Information Flow
• No-masking theorem for observables
• Detection of quantum information masking via machine learning