Wanmeng Ding

ORCID: 0000-0002-8845-5135
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Steganography and Watermarking Techniques
  • Chaos-based Image/Signal Encryption
  • Cryptography and Data Security
  • Machine Fault Diagnosis Techniques
  • Gear and Bearing Dynamics Analysis
  • Advanced Malware Detection Techniques
  • Advanced Image and Video Retrieval Techniques
  • Engineering Diagnostics and Reliability
  • Advanced machining processes and optimization
  • Internet Traffic Analysis and Secure E-voting
  • Spam and Phishing Detection
  • Advanced Data Compression Techniques
  • Computational and Text Analysis Methods
  • QR Code Applications and Technologies
  • Network Security and Intrusion Detection
  • Handwritten Text Recognition Techniques
  • Mineral Processing and Grinding
  • Natural Language Processing Techniques
  • Structural Health Monitoring Techniques
  • Web Data Mining and Analysis
  • Generative Adversarial Networks and Image Synthesis
  • Digital Media Forensic Detection
  • Computer Graphics and Visualization Techniques
  • Digital Rights Management and Security
  • Biometric Identification and Security

Yanshan University
2021-2024

National University of Defense Technology
2018-2024

PLA Electronic Engineering Institute
2016-2019

In this paper, homomorphic visual cryptographic scheme (HVCS) is proposed. The proposed HVCS inherits the good features of traditional VCS, such as, loss-tolerant (e.g., (k, n) threshold) and simply reconstructed method, where method means that decryption secret image based on human system (HVS) without any computation. addition, can support signal processing in encrypted domain (SPED), e.g., operations authentication, which protect user's privacy as well improve security some applications,...

10.4018/ijdcf.2017040105 article EN International Journal of Digital Crime and Forensics 2017-03-06

Lossless recovery is important for the transmission and storage of image data. In polynomial-based secret sharing, despite many previous researchers attempted to achieve lossless recovery, none proposed work can simultaneously satisfy an efficiency execution at no cost some capacity. This article proposes a sharing scheme with fully based on modular algebraic recovery. The major difference between method that, instead only using first coefficient polynomial, this uses two coefficients...

10.4018/ijdcf.2018040107 article EN International Journal of Digital Crime and Forensics 2018-02-28

Most of today’s secret image sharing technologies are based on the polynomial-based scheme proposed by shamir. At present, researchers mostly focus development properties such as small shadow size and lossless recovery, instead principle Shamir’s SS scheme. In this paper, matrix theory is used to analyze scheme, a general (k, n) threshold proposed. The effectiveness proved theoretical experimental results. Moreover, it has been that special case our

10.3390/sym10100530 article EN Symmetry 2018-10-22

Visual secret sharing (VSS) for general access structure (GAS) owns wider applications than (k, n) threshold VSS. VSS with multiple decryptions realizes the functionalities of both OR-based (OVSS) and XOR-based (XVSS), which can broaden as well compared to one recovery method-based In this paper, we propose a progressive (PVSS) scheme GAS features OR XOR based on random grid (RG). The different regions image corresponding genearted bits are employed gain property decryptions. For qualified...

10.1109/itme.2016.0156 article EN 2016-12-01

In Shamir's polynomial-based secret sharing scheme, a image is generated into n shadow images and distributed to associated participants. The can be recovered by collecting any k or more images. Unfortunately, the previous scheme neglected situation of participants increasing. However, in some applications, new need because join sharing. this paper, we consider participant increasing issue as well propose method only from original Shamir'spolynomial-based scheme. Without knowing image,...

10.1109/bigdatasecurity.2017.18 article EN 2017-05-01

Random grid (RG)-based visual secret sharing (VSS) has neither pixel expansion nor codebook design. VSS for general access structure (GAS) wider applications compared with (k, n) threshold VSS. Previous RG-based schemes GAS have the limitations of "all-or-nothing" or low quality. In this paper, we propose a progressive (PVSS) scheme improved quality based on RG. The different regions image and corresponding generated random bits, which are classified into three parts, employed to improve...

10.1109/ithings-greencom-cpscom-smartdata.2016.129 article EN 2016-12-01

The emergence of illegal (gambling, pornography, and attraction) websites seriously threatens the security society. Due to concealment websites, it is difficult obtain labeled data with high quantity. Meanwhile, most usually disguise themselves avoid detection; for example, some gambling may visually resemble gaming websites. However, existing methods ignore means camouflage in a single modality. To address above problems, this paper proposes MEDAL, multimodality-based effective augmentation...

10.3390/electronics13112199 article EN Electronics 2024-06-05

It is of great importance to diagnose early failures rolling bearings accurately and timely in industrial production. However, faults have the characteristics weak feature information low signal-to-noise ratio, which increases difficulty fault identification. Therefore, based on deep learning theory, this paper proposes a convolutional neural network model attention mechanism dynamic rate for intelligent diagnosis recognition bearings. The introduces improve performance effective...

10.1109/icsmd53520.2021.9670785 article EN 2021-10-21

This article proposes a novel behavior steganography model based on secret sharing, the main idea of which is to use messages as random elements in sharing process generate shadow images. Based introduced and analyzing two image algorithms — threshold (SIS) visual (VSS), specific schemes are presented, implemented by utilizing behavior. In embedding phase, selection employed hide messages. extraction when recovered from images, can also be extracted successfully. The contribution authors...

10.4018/ijdcf.2019100107 article EN International Journal of Digital Crime and Forensics 2019-09-27

Open resolvers can be easily exploited by malicious actors to launch DDoS attacks against important services on the Internet, which has aroused much concern in Internet community. Researchers have studied extensively population, structure, and behavior of open resolvers, while little been done reveal how respond non-recursion queries. In this paper, we conduct an Internet-wide measurement recursive resolvers. We discover that more than 1 million gushing wild are enthusiastic needed...

10.1145/3573834.3574533 article EN 2022-11-25
Coming Soon ...