HYHaoyang Yu

Haoyang Yu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Haoyang Yu has a total of 30 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Lightweight Privacy Protection Blockchain Framework Against Quantum Attacks

    by Jiwei Zhang, Mingxuan Tang, Dedong Zhang, Haoyang Yu, Shizhao Zhou, Xingyu Chen, Shaozhang Niu

    Quantum computing poses a formidable threat to classical cryptographic systems, particularly those safeguarding blockchain-based transactions and user privacy. Conventional algorithms such as RSA and elliptic curve cryptography are vulnerable to quantum attacks through Shor's and Grover's algorithms, jeopardizing the long-term security of digital assets. To address these challenges, this paper proposes a Lightweight Lattice-based Privacy Protection (LLPP) blockchain framework that integrates lattice-based digital signatures with a double encryption mechanism. The framework is designed to provide post-quantum security for transaction authentication while enhancing payment address privacy and reducing direct linkage under public observation, even in the presence of quantum-capable adversaries. A key challenge in deploying lattice-based cryptography on blockchain systems is the substantial storage overhead of signatures and public keys. LLPP addresses this by leveraging the InterPlanetary File System (IPFS) for off-chain storage, recording only 46-byte content identifiers on-chain while maintaining full verifiability. Comprehensive evaluations on the Substrate platform demonstrate that LLPP provides practical post-quantum authentication and privacy protection with signing and verification latencies below 2 milliseconds, making it practical for deployment in quantum-secure blockchain environments.


  • SecureFIA: Secure Federated Image Authentication Intelligent System for Smart Cities

    by Haoyang Yu, Jiwei Zhang, Zhongyu Li, Huamin Feng, Biao Liu, Ruofei Jiang, Yunfei Yao

    The widespread adoption of consumer electronics has enabled patients to easily schedule appointments with doctors through online platforms, advancing the development of telemedicine. Utilizing AI technology, these platforms assist physicians in symptom analysis and providing precise recommendations, overcoming geographical barriers and achieving a balanced utilization of medical resources. Moreover, the advancement of 5G and the anticipated 6G networks has provided the capability for swift and accurate execution of cloud-based AI applications. However, online medical image consultations based on plaintext carry the risk of significant privacy breaches. By leveraging secret sharing technology, privacy leakage issues can be effectively addressed. However, the application of this technology alters the visual representation of image data. In multi-party scenarios, each party possesses only one secret share, which makes verifying the authenticity of the image challenging. To address this issue, we propose the Secure Federated Image Authentication system, which enables the authentication of encrypted images provided by consultants before the provision of services. This system employs technologies such as random feature signatures, secret sharing, and distributed reversible data hiding to achieve federated authentication of images. Through security analysis and performance evaluation, our method has demonstrated satisfactory results in terms of security and availability.


  • Open Access

    A decentralized multi-authority CP-ABE scheme from LWE

    by Yun-Fei Yao, Hui-Yan Chen, You Gao, Ke Wang, Hao-Yang Yu


  • Open Access

    Feature Reduction Networks: A Convolution Neural Network-Based Approach to Enhance Image Dehazing

    by Haoyang Yu, Xiqin Yuan, Ruofei Jiang, Huamin Feng, Jiaxing Liu, Zhongyu Li

    Image dehazing represents a dynamic area of research in computer vision. With the exponential development of deep learning, particularly convolutional neural networks (CNNs), innovative and effective image dehazing techniques have surfaced. However, in stark contrast to the majority of computer vision tasks employing CNNs, the output from a dehazing model is often treated as uninformative noise, even though the model’s filters are engineered to extract pertinent features from the images. The standard approach of end-to-end models for dehazing involves noise removal from the hazy image to obtain a clear one. Consequently, the model’s dehazing capacity diminishes, as the noise is progressively filtered out throughout the propagation phase. This leads to the conception of the feature reduction network (FRNet), which is a distinctive CNN architecture that incrementally eliminates informative features, thereby resulting in the output of noise. Our experimental results indicate that the CNN-driven FRNet surpasses previous state-of-the-art (SOTA) methods in terms of the peak signal-to-noise ratio (PSNR) and structural similarity index measure (SSIM) evaluation metrics. This highlights the effectiveness of the FRNet across various image dehazing datasets. With its reduced overhead, the CNN-based FRNet demonstrates superior performance over current SOTA methods, thereby affirming the efficacy of CNNs in image dehazing tasks.


  • Open Access

    Continuous Latent Spaces Sampling for Graph Autoencoder

    by Zhongyu Li, Geng Zhao, Hao Ning, Xin Jin, Haoyang Yu

    This paper proposes colaGAE, a self-supervised learning framework for graph-structured data. While graph autoencoders (GAEs) commonly use graph reconstruction as a pretext task, this simple approach often yields poor model performance. To address this issue, colaGAE employs mutual isomorphism as a pretext task for a continuous latent space sampling GAE (colaGAE). The central idea of mutual isomorphism is to sample from multiple views in the latent space and reconstruct the graph structure, with significant improvements in terms of the model’s training difficulty. To investigate whether continuous latent space sampling can enhance GAEs’ learning of graph representations, we provide both theoretical and empirical evidence for the benefits of this pretext task. Theoretically, we prove that mutual isomorphism can offer improvements with respect to the difficulty of model training, leading to better performance. Empirically, we conduct extensive experiments on eight benchmark datasets and achieve four state-of-the-art (SOTA) results; the average accuracy rate experiences a notable enhancement of 0.3%, demonstrating the superiority of colaGAE in node classification tasks.


  • Open Access

    Lossless Reversible Data Hiding in Encrypted Image for Multiple Data Hiders Based on Pixel Value Order and Secret Sharing

    by Haoyang Yu, Junwei Zhang, Zixiao Xiang, Biao Liu, Huamin Feng

    Reversible data hiding in encrypted images (RDH-EI) is instrumental in image privacy protection and data embedding. However, conventional RDH-EI models, involving image providers, data hiders, and receivers, limit the number of data hiders to one, which restricts its applicability in scenarios requiring multiple data embedders. Therefore, the need for an RDH-EI accommodating multiple data hiders, especially for copyright protection, has become crucial. Addressing this, we introduce the application of Pixel Value Order (PVO) technology to encrypted reversible data hiding, combined with the secret image sharing (SIS) scheme. This creates a novel scheme, PVO, Chaotic System, Secret Sharing-based Reversible Data Hiding in Encrypted Image (PCSRDH-EI), which satisfies the (k,n) threshold property. An image is partitioned into N shadow images, and reconstruction is feasible when at least k shadow images are available. This method enables separate data extraction and image decryption. Our scheme combines stream encryption, based on chaotic systems, with secret sharing, underpinned by the Chinese remainder theorem (CRT), ensuring secure secret sharing. Empirical tests show that PCSRDH-EI can reach a maximum embedding rate of 5.706 bpp, outperforming the state-of-the-art and demonstrating superior encryption effects.


  • Double-Blinded Finder: A Two-Side Privacy-Preserving Approach for Finding Missing Children

    by Xin Jin, Shiming Ge, Chenggen Song, Xiaodong Li, Jicheng Lei, Chuanqiang Wu, Haoyang Yu