Shijun Xiang
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
Shijun Xiang has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
Shangyi Liu
Jinan University
2 shared publications- Ceyu Dai
College of Information Science and Technology, Jinan University, Guangzhou 510632, China
1 shared publication Hyoung-Joong Kim
1 shared publicationIn-Kwon Yeo
1 shared publicationJian-Quan Yang
1 shared publicationJianquan Yang
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen 518055, China
1 shared publication
Latest Publications
- Open Access
Reversible Data Hiding Algorithm in Fully Homomorphic Encrypted Domain
This paper proposes a reversible data hiding scheme by exploiting the DGHV fully homomorphic encryption, and analyzes the feasibility of the scheme for data hiding from the perspective of information entropy. In the proposed algorithm, additional data can be embedded directly into a DGHV fully homomorphic encrypted image without any preprocessing. On the sending side, by using two encrypted pixels as a group, a data hider can get the difference of two pixels in a group. Additional data can be embedded into the encrypted image by shifting the histogram of the differences with the fully homomorphic property. On the receiver side, a legal user can extract the additional data by getting the difference histogram, and the original image can be restored by using modular arithmetic. Besides, the additional data can be extracted after decryption while the original image can be restored. Compared with the previous two typical algorithms, the proposed scheme can effectively avoid preprocessing operations before encryption and can successfully embed and extract additional data in the encrypted domain. The extensive testing results on the standard images have certified the effectiveness of the proposed scheme.
Open AccessReversible Data Hiding Algorithm in Fully Homomorphic Encrypted Domain
This paper proposes a reversible data hiding scheme by exploiting the DGHV fully homomorphic encryption, and analyzes the feasibility of the scheme for data hiding from the perspective of information entropy. In the proposed algorithm, additional data can be embedded directly into a DGHV fully homomorphic encrypted image without any preprocessing. On the sending side, by using two encrypted pixels as a group, a data hider can get the difference of two pixels in a group. Additional data can be embedded into the encrypted image by shifting the histogram of the differences with the fully homomorphic property. On the receiver side, a legal user can extract the additional data by getting the difference histogram, and the original image can be restored by using modular arithmetic. Besides, the additional data can be extracted after decryption while the original image can be restored. Compared with the previous two typical algorithms, the proposed scheme can effectively avoid preprocessing operations before encryption and can successfully embed and extract additional data in the encrypted domain. The extensive testing results on the standard images have certified the effectiveness of the proposed scheme.
- 31 March 2016
- Published by Springer Nature
- p. 337-349
Distortion-Free Robust Reversible Watermarking by Modifying and Recording IWT Means of Image Blocks
- 31 March 2016
- Published by Springer Nature
- p. 337-349
Distortion-Free Robust Reversible Watermarking by Modifying and Recording IWT Means of Image Blocks
- Open Access
- 8 July 2015
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2015 (1) , 56
Non-integer expansion embedding techniques for reversible image watermarking
- 8 July 2015
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2015 (1) , 56
Open AccessNon-integer expansion embedding techniques for reversible image watermarking
- 28 May 2015
- Published by Springer Nature
- p. 535-543
Non-integer Expansion Embedding for Prediction-Based Reversible Watermarking
- 28 May 2015
- Published by Springer Nature
- p. 535-543
Non-integer Expansion Embedding for Prediction-Based Reversible Watermarking
- 12 November 2014
- Published by Springer Nature in Wuhan University Journal of Natural Sciences
- Vol. 19 (6) , 497-504
Fragile audio watermarking with perfect restoration capacity based on an adapted integer transform
- 12 November 2014
- Published by Springer Nature in Wuhan University Journal of Natural Sciences
- Vol. 19 (6) , 497-504
Fragile audio watermarking with perfect restoration capacity based on an adapted integer transform
- 19 October 2013
- Published by EDP Sciences in Wuhan University Journal of Natural Sciences
- Vol. 18 (5) , 455-460
Reversible audio watermarking algorithm using non-causal prediction
Reversible watermarking technique enables to extract embedded information without any loss of the host signal. For the reduction of the embedding distortion, a desirable reversible watermarking approach should exploit efficient prediction way to generate prediction errors with a smaller magnitude for expansion embedding. In this paper, we present a reversible audio watermarking scheme based on a new non-causal prediction method and embedding strategy. The proposed non-causal prediction method provides non-integer prediction errors and the proposed expansion embedding strategy can proceed them for a lower embedding distortion. Experimental results have shown that the proposed reversible technique has a lower embedding distortion for the same embedding payload in comparison with the existing state-of-the-art works.
- 19 October 2013
- Published by EDP Sciences in Wuhan University Journal of Natural Sciences
- Vol. 18 (5) , 455-460
Reversible audio watermarking algorithm using non-causal prediction
Reversible watermarking technique enables to extract embedded information without any loss of the host signal. For the reduction of the embedding distortion, a desirable reversible watermarking approach should exploit efficient prediction way to generate prediction errors with a smaller magnitude for expansion embedding. In this paper, we present a reversible audio watermarking scheme based on a new non-causal prediction method and embedding strategy. The proposed non-causal prediction method provides non-integer prediction errors and the proposed expansion embedding strategy can proceed them for a lower embedding distortion. Experimental results have shown that the proposed reversible technique has a lower embedding distortion for the same embedding payload in comparison with the existing state-of-the-art works.
- Open Access
- 4 April 2012
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2012 (1) , 77
Block-based image hashing with restricted blocking strategy for rotational robustness
- 4 April 2012
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2012 (1) , 77
Open AccessBlock-based image hashing with restricted blocking strategy for rotational robustness
- Open Access
- 13 May 2011
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2011 (1) , 1
Audio watermarking robust against D/A and A/D conversions
- 13 May 2011
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2011 (1) , 1
Open AccessAudio watermarking robust against D/A and A/D conversions
- 20 February 2011
- Published by China Science Publishing & Media Ltd. in Journal of Electronics & Information Technology
- Vol. 33 (2) , 337-341
NMF-Based Image Hashing Algorithm Using Restricted Random Blocking
- 20 February 2011
- Published by China Science Publishing & Media Ltd. in Journal of Electronics & Information Technology
- Vol. 33 (2) , 337-341
NMF-Based Image Hashing Algorithm Using Restricted Random Blocking
- 18 January 2011
- Published by IGI Global Scientific Publishing
Robustness Analysis of Patchwork Watermarking Schemes
Robustness Analysis of Patchwork Watermarking Schemes: 10.4018/978-1-59904-513-9.ch008: The patchwork watermarking scheme is investigated in this chapter. The performance of this algorithm in terms of imperceptibility, robustness and security has
- 18 January 2011
- Published by IGI Global Scientific Publishing
Robustness Analysis of Patchwork Watermarking Schemes
Robustness Analysis of Patchwork Watermarking Schemes: 10.4018/978-1-59904-513-9.ch008: The patchwork watermarking scheme is investigated in this chapter. The performance of this algorithm in terms of imperceptibility, robustness and security has