量子访问控制问题的可混淆性

Obfuscation is a concept of functionality encryption conceived from the concept of data encryption. It is known that, the most strong obfuscation of classic program, the so-called general blackbox obfuscation, is proved to be nonexistent by Barak in 2001. It has shown in recent years that, some weaker obfuscations still work efficiently on some specific functions. Meanwhile, quantum communication and quantum computing have made great progress in this century. However, academic research on the theory of quantum obfuscation is still at a blank stage. This study combines the two leading disciplines of quantum theory and obfuscation theory and develops the theory of quantum obfuscation. We first define quantum point functions and prove that the quantum point functions are obfuscatable under quantum-accessible random oracle model. Subsequently, we define quantum access control problems and auxiliary problems to avoid exponential hardness. We prove the obfuscatability of quantum access control problems. Finally, we present the future valuable research directions of quantum obfuscation theory, including quantum black box obfuscator's realization, quantum obfuscation for classical circuits, non-reusable quantum obfuscation, and removing quantum random oracles.