Abstract: Bit commitment is an important primitive in modern cryptography and plays a crucial role in complex cryptography protocol (such as zero knowledge proof) design. Mayers，Lo and Chau independently proved that all the existing quantum bit commitment (QBC) schemes are insecure. This result is the famous Mayers-Lo-Chau no-go theorem on QBC. However, this doesn't exclude that there exists computationally secure QBC. In Eurocrypt 2000, Dumais, et al. claimed that computationally secure QBC scheme can be constructed based on any quantum one-way permutations. Utilizing error correcting codes, the quantum bit commitment is extended to quantum multi-bit commitment and it is shown that this proposed scheme has perfect concealing and computational binding properties. Methods to design quantum digital signature and authenticated encryption scheme are proposed based on QBC. Security analysis shows that the proposed protocols are secure.