WenWen Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
WenWen Hu has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Ri-Gui Zhou
College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China
5 shared publicationsPing Fan
School of Information Engineering, East China Jiaotong University, Nanchang, Jiangxi 330013, China
3 shared publicationsHou Ian
Institute of Applied Physics and Materials Engineering, FST, University of Macau, Macau, China
2 shared publications- Ping Fan
East China Jiaotong University
2 shared publications Bangshu Xiong
Nanchang Hangkong Univ, Key Lab Image Proc & Pattern Recognit Jiangxi Prov, Nanchang 330063, Peoples R China
1 shared publicationGao Feng Luo
College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China
1 shared publication
Latest Publications
- 9 January 2025
- Published by Elsevier in Chinese Journal of Physics
- Vol. 94, 43-52
Probabilistic and repeatable d-level quantum state sharing in amplitude damping channel
- 9 January 2025
- Published by Elsevier in Chinese Journal of Physics
- Vol. 94, 43-52
Probabilistic and repeatable d-level quantum state sharing in amplitude damping channel
- 14 June 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (6) , 1-19
Multiparty sharing of quantum images based on product state of maximally entangled GHZ state
- 14 June 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (6) , 1-19
Multiparty sharing of quantum images based on product state of maximally entangled GHZ state
- 25 September 2023
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 21 (08)
Semi-quantum key distribution using qudit systems and security proof
Most prior semi-quantum key distribution (SQKD) protocols are designed in the context of qubits. In this paper, we proposed an SQKD protocol using ([ ]+1) quantum states in two mutually unbiased bases in the context of qudits without invoking the classical party’s measurement capability. It not only decreases the quantum states sent by quantum party by half, but also improves the efficiency of key rate than qubits do. To prove the security of present protocol, we first illustrate that the present protocol is completely robust, and then prove its unconditional security from information theoretical perspective by computing its key rate and noise tolerance against cloning-based individual attack. The unconditional security proof demonstrates that the higher dimension of quantum system is, the higher key rate can be obtained and the higher noise tolerance is allowed in depolarization channel.
- 25 September 2023
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 21 (08)
Semi-quantum key distribution using qudit systems and security proof
Most prior semi-quantum key distribution (SQKD) protocols are designed in the context of qubits. In this paper, we proposed an SQKD protocol using ([ ]+1) quantum states in two mutually unbiased bases in the context of qudits without invoking the classical party’s measurement capability. It not only decreases the quantum states sent by quantum party by half, but also improves the efficiency of key rate than qubits do. To prove the security of present protocol, we first illustrate that the present protocol is completely robust, and then prove its unconditional security from information theoretical perspective by computing its key rate and noise tolerance against cloning-based individual attack. The unconditional security proof demonstrates that the higher dimension of quantum system is, the higher key rate can be obtained and the higher noise tolerance is allowed in depolarization channel.
- 1 August 2023
- Published by IOP Publishing in Chinese Physics B
- Vol. 32 (8) , 080303
An efficient multiparty quantum secret sharing scheme using a single qudit
The aim of quantum secret sharing, as one of most promising components of quantum cryptograph, is one-to-multiparty secret communication based on the principles of quantum mechanics. In this paper, an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is proposed. Each participant's shadow is encoded on a single qudit via a measuring basis encryption method, which avoids the waste of qudits caused by basis reconciliation. Security analysis indicates that the proposed protocol is immune to general attacks, such as the measure-resend attack, entangle-and-measure attack and Trojan horse attack. Compared to former protocols, the proposed protocol only needs to perform the single-qudit measurement operation, and can share the predetermined dits instead of random bits or dits.
- 1 August 2023
- Published by IOP Publishing in Chinese Physics B
- Vol. 32 (8) , 080303
An efficient multiparty quantum secret sharing scheme using a single qudit
The aim of quantum secret sharing, as one of most promising components of quantum cryptograph, is one-to-multiparty secret communication based on the principles of quantum mechanics. In this paper, an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is proposed. Each participant's shadow is encoded on a single qudit via a measuring basis encryption method, which avoids the waste of qudits caused by basis reconciliation. Security analysis indicates that the proposed protocol is immune to general attacks, such as the measure-resend attack, entangle-and-measure attack and Trojan horse attack. Compared to former protocols, the proposed protocol only needs to perform the single-qudit measurement operation, and can share the predetermined dits instead of random bits or dits.
- 27 May 2019
- Published by Springer Nature in Quantum Information Processing
- Vol. 18 (7) , 222
Efficient quantum steganography scheme using inverted pattern approach
- 27 May 2019
- Published by Springer Nature in Quantum Information Processing
- Vol. 18 (7) , 222
Efficient quantum steganography scheme using inverted pattern approach
- 1 October 2018
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 16 (07)
Optimal LSBs-based quantum watermarking with lower distortion
- 1 October 2018
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 16 (07)
Optimal LSBs-based quantum watermarking with lower distortion
- 22 May 2018
- Published by Springer Nature in Quantum Information Processing
- Vol. 17 (7) , 166
Quantum realization of the nearest neighbor value interpolation method for INEQR
- 22 May 2018
- Published by Springer Nature in Quantum Information Processing
- Vol. 17 (7) , 166
Quantum realization of the nearest neighbor value interpolation method for INEQR
- 1 April 2018
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 16 (03)
Quantum color image watermarking based on Arnold transformation and LSB steganography
- 1 April 2018
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 16 (03)
Quantum color image watermarking based on Arnold transformation and LSB steganography
- 20 July 2017
- Published by Springer Nature in Quantum Information Processing
- Vol. 16 (9) , 212
Quantum watermarking scheme through Arnold scrambling and LSB steganography
- 20 July 2017
- Published by Springer Nature in Quantum Information Processing
- Vol. 16 (9) , 212
Quantum watermarking scheme through Arnold scrambling and LSB steganography
- Open Access
- 31 May 2017
- Published by Springer Nature in Scientific Reports
- Vol. 7 (1) , 1-17
Quantum realization of the bilinear interpolation method for NEQR
In recent years, quantum image processing is one of the most active fields in quantum computation and quantum information. Image scaling as a kind of image geometric transformation has been widely studied and applied in the classical image processing, however, the quantum version of which does not exist. This paper is concerned with the feasibility of the classical bilinear interpolation based on novel enhanced quantum image representation (NEQR). Firstly, the feasibility of the bilinear interpolation for NEQR is proven. Then the concrete quantum circuits of the bilinear interpolation including scaling up and scaling down for NEQR are given by using the multiply Control-Not operation, special adding one operation, the reverse parallel adder, parallel subtractor, multiplier and division operations. Finally, the complexity analysis of the quantum network circuit based on the basic quantum gates is deduced. Simulation result shows that the scaled-up image using bilinear interpolation is clearer and less distorted than nearest interpolation.
- 31 May 2017
- Published by Springer Nature in Scientific Reports
- Vol. 7 (1) , 1-17
Open AccessQuantum realization of the bilinear interpolation method for NEQR
In recent years, quantum image processing is one of the most active fields in quantum computation and quantum information. Image scaling as a kind of image geometric transformation has been widely studied and applied in the classical image processing, however, the quantum version of which does not exist. This paper is concerned with the feasibility of the classical bilinear interpolation based on novel enhanced quantum image representation (NEQR). Firstly, the feasibility of the bilinear interpolation for NEQR is proven. Then the concrete quantum circuits of the bilinear interpolation including scaling up and scaling down for NEQR are given by using the multiply Control-Not operation, special adding one operation, the reverse parallel adder, parallel subtractor, multiplier and division operations. Finally, the complexity analysis of the quantum network circuit based on the basic quantum gates is deduced. Simulation result shows that the scaled-up image using bilinear interpolation is clearer and less distorted than nearest interpolation.