We bring forward the primitive of biased bit commitment, define the security of the model, and present a concrete biased bit commitment scheme based on the braid conjugator search problem. The presented scheme is proved to be information-theoretically hiding and computationally binding in the defined model. Finally, to argue the usefulness of this work, we also sketch out some new applications based on this new primitive.