Entity

Time filter

Source Type


Yang Y.-G.,Beijing University of Technology | Yang Y.-G.,Chinese Academy of Sciences | Yang Y.-G.,Beijing Key Laboratory of Trusted Computing | Yang Y.-G.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 3 more authors.
Optik | Year: 2015

Although private information retrieval and oblivious transfer are equivalent in classical cryptography, we show that the existence of secure quantum private information retrieval is necessary but not sufficient for secure quantum oblivious transfer, which provides a strong evidence of nonequivalence of two flavors of oblivious transfer at the quantum level. © 2015 Elsevier GmbH.


Yang Y.-G.,Beijing University of Technology | Yang Y.-G.,Chinese Academy of Sciences | Yang Y.-G.,Beijing Key Laboratory of Trusted Computing | Yang Y.-G.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 4 more authors.
Information Sciences | Year: 2016

We investigate the application of quantum cellular automata in image encryption and propose a novel quantum gray-scale image encryption algorithm based on one-dimensional quantum cellular automata. The quantum image encryption algorithm can be realized by subtly constructing the evolution rules of one-dimensional quantum cellular automata. Because all quantum operations are invertible, the quantum image decryption algorithm is the inverse of the encryption algorithm. The proposed quantum image encryption algorithm has an algorithm complexity of Θ(n), lower than the algorithm complexity, Θ(n2) of existing quantum image encryption schemes based on quantum Fourier transform. Supported by detailed numerical simulation and theoretical analysis, our proposal has outperformed its classical counterpart and other image encryption schemes in terms of the security, computational complexity, and robustness. And it also provides a clue of introducing quantum cellular automata into image encryption. © 2016 Elsevier Inc. All rights reserved.


Jiang N.,Beijing University of Technology | Jiang N.,Purdue University | Jiang N.,Beijing Key Laboratory of Trusted Computing | Jiang N.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 2 more authors.
International Journal of Theoretical Physics | Year: 2016

Quantum image processing has been a hot topic as a consequence of the development of quantum computation. Many quantum image processing algorithms have been proposed, whose efficiency are theoretically higher than their corresponding classical algorithms. However, most of the quantum schemes do not consider the problem of measurement. If users want to get the results, they must measure the final state many times to get all the pixels’ values. Moreover, executing the algorithm one time, users can only measure the final state one time. In order to measure it many times, users must execute the algorithms many times. If the measurement process is taken into account, whether or not the algorithms are really efficient needs to be reconsidered. In this paper, we try to solve the problem of measurement and give a quantum image location algorithm. This scheme modifies the probability of pixels to make the target pixel to be measured with higher probability. Furthermore, it only has linear complexity. © 2016 Springer Science+Business Media New York


Yang Y.-G.,Beijing University of Technology | Yang Y.-G.,Chinese Academy of Sciences | Yang Y.-G.,Beijing Key Laboratory of Trusted Computing | Yang Y.-G.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 4 more authors.
Quantum Information Processing | Year: 2016

Cluster states can be exploited for some tasks such as topological one-way computation, quantum error correction, teleportation and dense coding. In this paper, we investigate and propose an arbitrated quantum signature scheme with cluster states. The cluster states are used for quantum key distribution and quantum signature. The proposed scheme can achieve an efficiency of 100 %. Finally, we also discuss its security against various attacks. © 2016, Springer Science+Business Media New York.


Yang Y.-G.,Beijing University of Technology | Yang Y.-G.,Chinese Academy of Sciences | Yang Y.-G.,Beijing Key Laboratory of Trusted Computing | Yang Y.-G.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 4 more authors.
Quantum Information Processing | Year: 2015

All existing quantum oblivious transfer protocols can be achieved when all the members have to be quantum. So what will happen if not all the members are quantum? In this paper, we propose two novel protocols for all-or-nothing oblivious transfer and one-out-of-two oblivious transfer respectively by using single qubit states. Our contribution lies in the fact that the message receiver Bob can use fewer quantum resources so that our protocols relax the requirements of protocol implementation in practice. We analyze the security of the protocols and prove that they are secure against Bob who even has the quantum attack capability. © 2015, Springer Science+Business Media New York.

Discover hidden collaborations