 Hello everyone, this is the short video abstract of my Asia Crypt 2022 paper, General Properties of Quantum Bit Commitments. I'm Jun Yan from Gina University. The story begins with, since our world is quantum, we can ask the following motivating question. Can we base unconditional quantum cryptography solely on principles of quantum mechanics? Stephen Wiesner might be the first person to explore this possibility. Back in early 1970s, he first studied quantum money. Inspired by Wiesner's idea, two primitives ending with different fates were intensively studied in early days of quantum crypto. The first primitive is quantum key distribution. Burnett and Brassard and independently, Erk, have proposed two slightly different protocols. Both of them can be shown unconditionally secure. The second primitive is quantum bit commitment. There are many proposed schemes. However, all of them were finally broken. The security of QBC is finally settled in the middle 90s. Mayors and independently, Luo and Chao finally proved that quantum bit commitment is impossible. There is a big blow to ambitious researchers in quantum crypto. Since then, QBC seems dead. In a subsequent two decades, there was little progress towards QBC, until recently QBC revives. But in a different helmet sense, that is, we compromise to introduce computational hardness, studying computational QBC. This is ironically in contrast to the original motivation of studying quantum crypto unconditionally. However, this is actually the starting point of this work. Specifically, this work proposed to base quantum crypto on computational QBC, or is to equivalent complexity theoretic objects. There are several exciting and somewhat surprising results are obtained towards this research direction in this and its follow-up work. Now let me go into some detail. Seeing from the complexity theoretic perspective, computational QBC induces two clean and simple-to-state complexity theoretic objects that turn out to be equivalent. The first object is a pair of efficiently generated quantum states that are computationally indistinguishable but statistically distinguishable. It is called EFI in a follow-up work. The second object can be viewed as the computational negation of one man's theorem, and we just call it one man. We propose to study computational QBC, or equivalent EFI, or woman, as the basic complexity assumption in mini-Q crypt. Based on the following reasons. First, prior and this work showed that computational QBC is both sufficient and necessary for several important primitives, including quantum zero knowledge and quantum oblivious transfer. And more recently, we work extended results further along this line of research. Second, EFI has a classical counterpart that is well-known equivalent to one-way functions. Third, QBC, or EFI, or woman, is weaker than two other candidate complexity assumptions in mini-Q crypt, namely quantum secure one-way functions and pseudo-random quantum states. Fourth, our study indicates that definitions of computational QBC, or EFI, or woman, are quite robust. Several interesting equivalences among different variants of them can be established. In this last picture, we summarize equivalences we have established in this work. They are represented by these red and orange rows. This picture also summarizes our current knowledge towards exploring basic complexity assumptions in mini-Q crypt. That's all what I want to say. Thanks for your listening.