Affiliation:
1. School of Cyber Science and Technology, Beihang University, Beijing 100083, China
Abstract
Quantum obfuscation is one of the important primitives in quantum cryptography that can be used to enhance the security of various quantum cryptographic schemes. The research on quantum obfuscation focuses mainly on the obfuscatability of quantum functions. As a primary quantum function, the quantum power function has led to the development of quantum obfuscation because it is applicable to construct new obfuscation applications such as quantum encryption schemes. However, the previous definition of quantum power functions is constrained and cannot be beneficial to the further construction of other quantum functions. Thus, it is essential to extend the definition of the basic quantum power function in a more general manner. In this paper, we provide a formal definition of two quantum power functions called generalized quantum power functions with coefficients, each of which is characterized by a leading coefficient and an exponent that corresponds to either a quantum or classical state, indicating the generality. The first is the quantum power function with a leading coefficient, and the second is the quantum n-th power function, which are both fundamental components of quantum polynomial functions. In addition, obfuscation schemes for the functions are constructed by quantum teleportation and quantum superdense coding, and demonstrations of their obfuscatability are also provided in this paper. This work establishes the fundamental basis for constructing more quantum functions that can be utilized for quantum obfuscation, therefore contributing to the theory of quantum obfuscation.
Funder
National Natural Science Foundation of China
Key Research and Development Program of Hebei Province
Chinese Universities Industry-Education-Research Innovation Foundation of BII Education Grant Program
Subject
General Physics and Astronomy
Reference26 articles.
1. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer;Shor;SIAM Rev.,1999
2. Bennett, C.H. (1984, January 9–12). Quantum cryptography: Public key distribution and coin tossing. Proceedings of the IEEE International Conference on Computers, Bangalore, India.
3. Theory of quantum secret sharing;Gottesman;Phys. Rev. A,2000
4. Boneh, D., and Zhandry, M. (2013, January 26–30). Quantum-secure message authentication codes. Proceedings of the Advances in Cryptology—EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece. Proceedings 32.
5. Gottesman, D., and Chuang, I. (2001). Quantum digital signatures. arXiv.