On minimal assumptions to obtain a universally composable quantum bit commitment

Lemus, Mariano; Yadav, Preeti; Mateus, Paulo; Paunković, Nikola; Souto, André

doi:10.1109/icton.2019.8840386

Cited by 3 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, it is of interest to further study how to obtain composability in commitment schemes while using the minimum possible assumptions (for more on this topic, see [ 27 ]), and which of these assumptions are needed to achieve privacy.…”

Section: Discussionmentioning

confidence: 99%

A Private Quantum Bit String Commitment

Gama

Mateus

Souto

2020

Entropy

View full text Add to dashboard Cite

We propose an entanglement-based quantum bit string commitment protocol whose composability is proven in the random oracle model. This protocol has the additional property of preserving the privacy of the committed message. Even though this property is not resilient against man-in-the-middle attacks, this threat can be circumvented by considering that the parties communicate through an authenticated channel. The protocol remains secure (but not private) if we realize the random oracles as physical unclonable functions in the so-called bad PUF model with access before the opening phase.

show abstract

Section: Discussionmentioning

confidence: 99%

A Private Quantum Bit String Commitment

Gama

Mateus

Souto

2020

Entropy

View full text Add to dashboard Cite

show abstract

“…Bit commitment (BC) is an important basic protocol in cryptography, and its concept was first proposed by the 1995 Turing Award winner Blum [27]. The commitment scheme can be used to build zero-knowledge proof, verifiable secret sharing, coin throwing, and other protocols, and at the same time, form the basis of security computing, which is a research topic of interest in the field of cybersecurity [28]. A bit commitment scheme must possess the following properties:…”

Section: Bit Commitmentmentioning

confidence: 99%

A Lightweight Secure Scheme for Underwater Wireless Acoustic Network

Shi,

Wu,

Zhao

et al. 2024

JMSE

View full text Add to dashboard Cite

Due to the open underwater channels and untransparent network deployment environments, underwater acoustic networks (UANs) are more vulnerable to hostile environments. Security research is also being conducted in cryptography, including authentication based on asymmetric algorithms and key distribution based on symmetric algorithms. In recent years, the advancement of quantum computing has made anti-quantum attacks an important issue in the field of security. Algorithms such as lattice and SPHINCS+ have become a research topic of interest in the field of security. However, within the past five years, few papers have discussed security algorithms for UANs to resist quantum attacks, especially through classical algorithms. Some existing classical asymmetric and symmetric algorithms are considered to have no prospects. From the perspective of easy deployment in engineering and anti-quantum attacks, our research focuses on a comprehensive lightweight security framework for data protection, authentication, and malicious node detection through the Elliptic Curve and Hash algorithms. Our mechanism is suitable for ad hoc scenarios with limited underwater resources. Meanwhile, we have designed a multi-party bit commitment to build a security framework for the system. A management scheme is designed by combining self-certifying with the threshold sharing algorithm. All schemes are designed based on certificate-less and ad hoc features. The proposed scheme ensures that the confidentiality, integrity, and authentication of the system are well considered. Moreover, the scheme is proven to be of unconditional security and immune to channel eavesdropping. The resource and delay issues are also taken into consideration. The simulations considered multiple variables like number of nodes, attackers, and message length to calculate proper values that can increase the efficiency of this scheme. The results in terms of delay, delivery ratio, and consumption demonstrate the suitability of the proposal in terms of security, especially for malicious node detection. Meanwhile, the computational cost has also been controlled at the millisecond level.

show abstract

“…It is because the security of the scheme is proved in two steps: (i) Substitute a corrupted participant's behavior with an arbitrary quantum operation that outputs the same data as required in the protocol (ii) Show that the whole quantum state is indistinguishable from the output of the ideal functionality, except the cases with negligibly small probability. It fits the definition of security in the universal composability (UC) framework in [29][30][31][32], in the sense that no arbitrary outer machine (called environment machine in [29]) interacting with the adversary can distinguish the outputs of ideal and real cases. As it was emphasized in [32], since qubitor bit-commitment schemes are used as a basic building block of more complicated cryptographic schemes, it is important to prove its universal composability.…”

Section: Securitymentioning

confidence: 99%

“…It fits the definition of security in the universal composability (UC) framework in [29][30][31][32], in the sense that no arbitrary outer machine (called environment machine in [29]) interacting with the adversary can distinguish the outputs of ideal and real cases. As it was emphasized in [32], since qubitor bit-commitment schemes are used as a basic building block of more complicated cryptographic schemes, it is important to prove its universal composability.…”

Section: Securitymentioning

confidence: 99%

Quantum one-time tables for unconditionally secure qubit-commitment

Lie

Kwon

Kim

et al. 2021

Quantum

View full text Add to dashboard Cite

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.

show abstract

On minimal assumptions to obtain a universally composable quantum bit commitment

Cited by 3 publications

References 10 publications

A Private Quantum Bit String Commitment

A Private Quantum Bit String Commitment

A Lightweight Secure Scheme for Underwater Wireless Acoustic Network

Quantum one-time tables for unconditionally secure qubit-commitment

Contact Info

Product

Resources

About