Mini-micro Systems

Safe Scheme of Bit Commitment

Yanhui Wu, Jianer Chen

Published Jan 1, 2005• 0 citations

Abstract

Based on analyzing the scheme of bit commitment,which is provided on a pseudo-random generator,from the literature~([1]),This paper discuss a pattern of interaction attack which aims at the course of bit commitment,and provides a safe scheme based on the scheme of bit commitment.Holded the security of that scheme,the safe scheme imports one-way hash function and authentication,protects the datas from man-in-the-middle attack during the transmission course.

Related papers

Bit Commitment Based on Information Theoretic Security

Hong Yan

A trusted protocol for committing a classical bit could be used for protocols implementing a wide range of other cryptographic tasks. This paper discusses a safe bit commitment scheme over noisy Channels, which imports one-way hash function and interaction. It introduces the commitment capacity and analyses the security performance of the scheme studied from an information-theoretic perspective.

Computers & SecurityJan 1, 20090 citations

Non-Interactive Statistically-Hiding Quantum Bit Commitment from Any Quantum One-Way Function

Takeshi Koshiba, Takanori Odaira

We provide a non-interactive quantum bit commitment scheme which has statistically-hiding and computationally-binding properties from any quantum one-way function. Our protocol is basically a parallel composition of the previous non-interactive quantum bit commitment schemes (based on quantum one-way permutations, due to Dumais, Mayers and Salvail (EUROCRYPT 2000)) with pairwise independent hash functions. To construct our non-interactive quantum bit commitment scheme from any quantum one-way function, we follow the procedure below: (i) from Dumais-Mayers-Salvail scheme to a weakly-hiding and 1-out-of-2 binding commitment (of a parallel variant); (ii) from the weakly-hiding and 1-out-of-2 binding commitment to a strongly-hiding and 1-out-of-2 binding commitment; (iii) from the strongly-hiding and 1-out-of-2 binding commitment to a normal statistically-hiding commitment. In the classical case, statistically-hiding bit commitment scheme (by Haitner, Nguyen, Ong, Reingold and Vadhan (SIAM J. Comput., Vol.39, 2009)) is also constructible from any one-way function. While the classical statistically-hiding bit commitment has large round complexity, our quantum scheme is non-interactive, which is advantageous over the classical schemes. A main technical contribution is to provide a quantum analogue of the new interactive hashing theorem, due to Haitner and Reingold (CCC 2007). Moreover, the parallel composition enables us to simplify the security analysis drastically.

arXiv:1102.3441Feb 16, 20116 citations

Counterfactual Quantum Bit Commitment

Yaqi Song, Li Yang

We propose a framework of bit commitment protocol using a comparison scheme and present a compound comparison scheme based on counterfactual cryptography. Finally, we propose a counterfactual quantum bit commitment protocol. In security analysis, we give the proper security parameters for counterfactual quantum bit commitment and prove that intercept attack and intercept/resend attack are ineffective attack for our protocol. In addition, we explain that counterfactual quantum bit commitment protocol cannot be attacked with no-go theorem attack by current technology.

arXiv:1807.01602Jul 3, 20180 citations

Bit Commitment From Nonsignaling Correlations

Severin Winkler, Jürg Wullschleger, Stefan Wolf

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 nontrivial, i.e., cannot be securely realized from distributed randomness only.

arXiv:0811.3589IEEE Transactions on Information TheoryFeb 18, 20113 citations

Qubit-string-based bit commitment protocols with physical security

Li Yang, Chong Xiang, Bao Li

Several kinds of qubit-string-based(QS-based) bit commitment protocols are presented, and a definition of information-theoretic concealing is given. All the protocols presented here are proved to be secure under this definition. We suggest an attack algorithm to obtain the local unitary transformation introduced in no-go theorem, which is used to attack the binding condition, then study the security of our QS-based bit commitment protocols under this attack via introducing a new concept "physical security of protocol". At last we present a practical QS-based bit commitment scheme against channel loss and error.

arXiv:1011.5099Nov 23, 201013 citations

Quantum Bit Commitment Protocol Based on Counterfactual Quantum Cryptography

Yaqi Song, Li Yang

We present a new quantum bit commitment (QBC) protocol based on counterfactual quantum cryptography. We analyze the security of this protocol, find that it can resist the attack presented by QBC's no-go theorem. Our protocol is simple, and probably give a new way of constructing QBC protocol.

arXiv:1709.08490Sep 22, 20170 citations