Ping Ping

Ping Ping

Auto-generated profile, based on publicly available information

Ping Ping

Hohai University

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 November 2018 in IEEE Access
Verified
Journal Article
Open access
PPPing Ping
Ping Ping
JFJinyang Fan
Jinyang Fan
YMYingchi Mao
Yingchi Mao
FXFeng Xu
Feng Xu
JGJerry Gao
Jerry Gao
ZGZeyu Gao
Zeyu Gao
Image encryption can be classified into pixel-level and bit-level according to the smallest processing element in the permutation and diffusion. Most pixel-level permutations only change the pixel positions, so the histograms of the permuted image and the original image are identical. The bit-level permutation can change the histogram of the image, but it is comparatively time-consuming due to bitlevel computing. In this paper, we propose a new digit-level permutation. The pixel matrix of an image is decomposed into three digital matrices, and then these digital matrices are shuffled by the Henon map.This digit-level permutation combines the merits of pixel-level permutation with that of bit-level permutation. Besides, we also design a high-speed diffusion operation which exactly solves the problem that CBC-like diffusion has low efficiency. Simulations have been carried out and analyzed in detail, proving the superior security and high efficiency of our image cryptosystem.

25 November 2019 in IEEE Access
Verified
Journal Article
Open access
PPPing Ping
Ping Ping
JFJie Fu
Jie Fu
YMYingchi Mao
Yingchi Mao
FXFeng Xu
Feng Xu
Jerry GaoJerry Gao
Jerry Gao
Recently, compressive sensing (CS) and visual security (VS) have caught researchers attention in information security field. However, the measurement matrix is often reused in CS, which makes it vulnerable to chosen plaintext attack (CPA). In addition, when generating meaningful cipher images, the size of the carrier image is usually not less than the size of the plain image. In order to overcome these drawbacks, a new visually secure image encryption scheme using CS and reversible color transformation is proposed. The algorithm consists of two stages: compression and embedding. In the first stage, chaotic sequence is used to generate different structurally random matrices. When CS is performed, a random number is added during the process of sampling. By choosing different random numbers, different measurement matrices can be used to compress and encrypt the same image in different order. In the second stage, block pairing, color transformation and block replacement are employed to obtain a meaningful image. Different from the block replacement between two similar images, this paper first attempts to replace the block of the carrier image with a compressed noise-like image block. Thus, the carrier image can be smaller than the plain image, which saves the bandwidth of transmission. Both theoretical analysis and experimental results show that the proposed encryption scheme has good encryption performance, can effectively resist common attacks, and is suitable for meaningful image encryption.

1 January 2022 in Digital Signal Processing
Verified
Journal Article
Closed access
PPPing Ping
Ping Ping
XYXiaohui Yang
Xiaohui Yang
XZXiaojuan Zhang
Xiaojuan Zhang
YMYingchi Mao
Yingchi Mao
HKHakizimana Khalid
Hakizimana Khalid

19 January 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
PPPing Ping
Ping Ping
JHJunyuan Huo
Junyuan Huo
BGBobiao Guo
Bobiao Guo

31 July 2024 in Nonlinear Dynamics
Verified
Journal Article
Closed access
PDF file
Rashad AliRashad Ali
Rashad Ali
JAJaved Ali
Javed Ali
PPPing Ping
Ping Ping
Muhammad Kamran JamilMuhammad Kamran Jamil
Muhammad Kamran Jamil

26 January 2022 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
PPPing Ping
Ping Ping
XZXiaojuan Zhang
Xiaojuan Zhang
XYXiaohui Yang
Xiaohui Yang
YHYara Abdelsattar Abdelmageed Hashems
Yara Abdelsattar Abdelmageed Hashems