Guoyan Zhang
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
Guoyan Zhang has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Gaoli Wang
East China Normal University
3 shared publications - Xiaoyang Dong
Tsinghua University
3 shared publications - Jianqiang Ni
Shanghai Key Laboratory of Trustworthy Computing, Software Engineering Institute, East China Normal University, Shanghai, China
2 shared publications - Lingyue Qin
Tsinghua University
2 shared publications - Qingliang Hou
Shandong University
2 shared publications - Qingyuan Yu
School of Cyber Science and Technology, Shandong University
2 shared publications
Latest Publications
- Open Access
- 8 October 2026
- Published by Springer Nature in Cybersecurity
- Vol. 9 (1) , 225
A privacy-preserving hyper-spectral remote sensing image analysis framework based on matrix outsourcing computation
Hyper-spectral remote sensing image provides more detailed spectral information of ground targets, while the joint sparse coding-based clustering (JSCC) algorithm are proposed for accurate hyper-spectral image segmentation. However, since hyper-spectral image data processing represent one of the most time-consuming computing tasks, it necessitates the acceleration achieved by cloud outsourcing computation. Furthermore, data privacy and result availability issues in cloud computing should be considered in real-world scenarios. In this paper, we propose a novel privacy-preserving outsourcing scheme for matrix multiplication and matrix pseudo-inversion in the JSCC algorithm, to achieve efficient and secure hyper-spectral remote sensing image analysis. The core of our scheme is to present a novel matrix blinding method, which obscures the original matrices through element-wise computation and utilizes secret key index sets rather than subtly designed matrices, thereby further reducing the storage cost of encryption and decryption operations. Additionally, we correspondingly present a new verification method that computes and compares randomly selected elements in obscured matrices to guarantee the availability of returned results. Experimental results demonstrate that our scheme is 4.15–10.79% superior to the state-of-the-art matrix blinding based privacy-preserving outsourcing computation schemes on average and achieves an efficiency improvement of 73.49–80.45% compared to the original hyper-spectral remote sensing image analysis algorithm.
- 8 October 2026
- Published by Springer Nature in Cybersecurity
- Vol. 9 (1) , 225
Open AccessA privacy-preserving hyper-spectral remote sensing image analysis framework based on matrix outsourcing computation
Hyper-spectral remote sensing image provides more detailed spectral information of ground targets, while the joint sparse coding-based clustering (JSCC) algorithm are proposed for accurate hyper-spectral image segmentation. However, since hyper-spectral image data processing represent one of the most time-consuming computing tasks, it necessitates the acceleration achieved by cloud outsourcing computation. Furthermore, data privacy and result availability issues in cloud computing should be considered in real-world scenarios. In this paper, we propose a novel privacy-preserving outsourcing scheme for matrix multiplication and matrix pseudo-inversion in the JSCC algorithm, to achieve efficient and secure hyper-spectral remote sensing image analysis. The core of our scheme is to present a novel matrix blinding method, which obscures the original matrices through element-wise computation and utilizes secret key index sets rather than subtly designed matrices, thereby further reducing the storage cost of encryption and decryption operations. Additionally, we correspondingly present a new verification method that computes and compares randomly selected elements in obscured matrices to guarantee the availability of returned results. Experimental results demonstrate that our scheme is 4.15–10.79% superior to the state-of-the-art matrix blinding based privacy-preserving outsourcing computation schemes on average and achieves an efficiency improvement of 73.49–80.45% compared to the original hyper-spectral remote sensing image analysis algorithm.
- 1 April 2026
- Published by Springer Nature
- p. 443-458
NewtonPIR: Communication Efficient Single-Server PIR
- 1 April 2026
- Published by Springer Nature
- p. 443-458
NewtonPIR: Communication Efficient Single-Server PIR
- Open Access
- 11 August 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (16) , 8834
An Efficient Distributed Identity Selective Disclosure Algorithm
Distributed digital identity is an emerging identity management technology aimed at achieving comprehensive interconnectivity between digital objects. However, there is still the problem of privacy leakage in distributed identities, and selective disclosure technology partially solves the privacy issue in distributed identities. Most of the existing selective disclosure algorithms use anonymous credentials or hash functions. Anonymous credential schemes offer high security and meet the requirements of unforgeability and unlinkability, but their exponential operations result in low efficiency. The scheme based on hash functions, although more efficient, is susceptible to man-in-the-middle attacks. This article proposes an efficient selective disclosure scheme based on hash functions and implicit certificates. The attribute values are treated as leaf nodes of the Merkle tree, and the root node is placed in a verifiable credential. According to the implicit certificate algorithm process, a key pair that can use the credential is generated. During the attribute disclosure process, the user autonomously selects the attribute value to be presented and generates a verification path from the attribute to the root node. The verifier checks the Merkle tree verification path. All operations are completed within 10 ms while meeting the unforgeability requirements and resisting man-in-the-middle attacks. This article also utilizes the ZK-SNARK algorithm to hide the validation path of the Merkle tree, enhancing the security of the path during the disclosure process. The experimental results show that the selective disclosure algorithm performs well in both performance and privacy protection, with an efficiency 80% faster than that of existing schemes. This enhances the proposed scheme’s potential and value in the field of identity management; it also holds broad application prospects in fields such as the Internet of Things, finance, and others.
- 11 August 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (16) , 8834
Open AccessAn Efficient Distributed Identity Selective Disclosure Algorithm
Distributed digital identity is an emerging identity management technology aimed at achieving comprehensive interconnectivity between digital objects. However, there is still the problem of privacy leakage in distributed identities, and selective disclosure technology partially solves the privacy issue in distributed identities. Most of the existing selective disclosure algorithms use anonymous credentials or hash functions. Anonymous credential schemes offer high security and meet the requirements of unforgeability and unlinkability, but their exponential operations result in low efficiency. The scheme based on hash functions, although more efficient, is susceptible to man-in-the-middle attacks. This article proposes an efficient selective disclosure scheme based on hash functions and implicit certificates. The attribute values are treated as leaf nodes of the Merkle tree, and the root node is placed in a verifiable credential. According to the implicit certificate algorithm process, a key pair that can use the credential is generated. During the attribute disclosure process, the user autonomously selects the attribute value to be presented and generates a verification path from the attribute to the root node. The verifier checks the Merkle tree verification path. All operations are completed within 10 ms while meeting the unforgeability requirements and resisting man-in-the-middle attacks. This article also utilizes the ZK-SNARK algorithm to hide the validation path of the Merkle tree, enhancing the security of the path during the disclosure process. The experimental results show that the selective disclosure algorithm performs well in both performance and privacy protection, with an efficiency 80% faster than that of existing schemes. This enhances the proposed scheme’s potential and value in the field of identity management; it also holds broad application prospects in fields such as the Internet of Things, finance, and others.
- 4 April 2025
- Published by Springer Nature
- p. 51-74
Meet-in-the-Middle Attack on Primitives with Binary Matrix Linear Layer
- 4 April 2025
- Published by Springer Nature
- p. 51-74
Meet-in-the-Middle Attack on Primitives with Binary Matrix Linear Layer
- Open Access
- 1 January 2025
- Published by Tech Science Press in Computers, Materials & Continua
- Vol. 86 (3) , 1-10
Advanced Video Processing and Data Transmission Technology for Unmanned Ground Vehicles in the Internet of Battlefield Things (loBT)
With the continuous advancement of unmanned technology in various application domains, the development and deployment of blind-spot-free panoramic video systems have gained increasing importance. Such systems are particularly critical in battlefield environments, where advanced panoramic video processing and wireless communication technologies are essential to enable remote control and autonomous operation of unmanned ground vehicles (UGVs). However, conventional video surveillance systems suffer from several limitations, including limited field of view, high processing latency, low reliability, excessive resource consumption, and significant transmission delays. These shortcomings impede the widespread adoption of UGVs in battlefield settings. To overcome these challenges, this paper proposes a novel multi-channel video capture and stitching system designed for real-time video processing. The system integrates the Speeded-Up Robust Features (SURF) algorithm and the Fast Library for Approximate Nearest Neighbors (FLANN) algorithm to execute essential operations such as feature detection, descriptor computation, image matching, homography estimation, and seamless image fusion. The fused panoramic video is then encoded and assembled to produce a seamless output devoid of stitching artifacts and shadows. Furthermore, H.264 video compression is employed to reduce the data size of the video stream without sacrificing visual quality. Using the Real-Time Streaming Protocol (RTSP), the compressed stream is transmitted efficiently, supporting real-time remote monitoring and control of UGVs in dynamic battlefield environments. Experimental results indicate that the proposed system achieves high stability, flexibility, and low latency. With a wireless link latency of 30 ms, the end-to-end video transmission latency remains around 140 ms, enabling smooth video communication. The system can tolerate packet loss rates (PLR) of up to 20% while maintaining usable video quality (with latency around 200 ms). These properties make it well-suited for mobile communication scenarios demanding high real-time video performance.
- 1 January 2025
- Published by Tech Science Press in Computers, Materials & Continua
- Vol. 86 (3) , 1-10
Open AccessAdvanced Video Processing and Data Transmission Technology for Unmanned Ground Vehicles in the Internet of Battlefield Things (loBT)
With the continuous advancement of unmanned technology in various application domains, the development and deployment of blind-spot-free panoramic video systems have gained increasing importance. Such systems are particularly critical in battlefield environments, where advanced panoramic video processing and wireless communication technologies are essential to enable remote control and autonomous operation of unmanned ground vehicles (UGVs). However, conventional video surveillance systems suffer from several limitations, including limited field of view, high processing latency, low reliability, excessive resource consumption, and significant transmission delays. These shortcomings impede the widespread adoption of UGVs in battlefield settings. To overcome these challenges, this paper proposes a novel multi-channel video capture and stitching system designed for real-time video processing. The system integrates the Speeded-Up Robust Features (SURF) algorithm and the Fast Library for Approximate Nearest Neighbors (FLANN) algorithm to execute essential operations such as feature detection, descriptor computation, image matching, homography estimation, and seamless image fusion. The fused panoramic video is then encoded and assembled to produce a seamless output devoid of stitching artifacts and shadows. Furthermore, H.264 video compression is employed to reduce the data size of the video stream without sacrificing visual quality. Using the Real-Time Streaming Protocol (RTSP), the compressed stream is transmitted efficiently, supporting real-time remote monitoring and control of UGVs in dynamic battlefield environments. Experimental results indicate that the proposed system achieves high stability, flexibility, and low latency. With a wireless link latency of 30 ms, the end-to-end video transmission latency remains around 140 ms, enabling smooth video communication. The system can tolerate packet loss rates (PLR) of up to 20% while maintaining usable video quality (with latency around 200 ms). These properties make it well-suited for mobile communication scenarios demanding high real-time video performance.
- 3 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 12 (3) , 913-927
How to Securely and Efficiently Solve the Large-Scale Modular System of Linear Equations on the Cloud
Cloud-assisted computation empowers resource-constrained clients to efficiently tackle computationally intensive tasks by outsourcing them to resource-rich cloud servers. In the current era of Big Data, the widespread need to solve large-scale modular linear systems of equations ( $\mathcal {LMLSE}$ ) of the form $\mathbf {A}\mathbf {x}\equiv \mathbf {b}\mod {q}$ poses a significant challenge, particularly for lightweight devices. This paper delves into the secure outsourcing of $\mathcal {LMLSE}$ under a malicious single-server model and, to the best of our knowledge, introduces the inaugural protocol tailored to this specific context. The cornerstone of our protocol lies in the innovation of a novel matrix encryption method based on sparse unimodular matrix transformations. This novel technique bestows our protocol with several key advantages. First and foremost, it ensures robust privacy for all computation inputs, encompassing $\mathbf {A},\mathbf {b}, q$ , and the output $\mathbf {x}$ , as validated by thorough theoretical analysis. Secondly, the protocol delivers optimal verifiability, enabling clients to detect cloud server misbehavior with an unparalleled probability of 1. Furthermore, it boasts high efficiency, requiring only a single interaction between the client and the cloud server, significantly reducing local-client time costs. For an $m$ -by- $n$ matrix $\mathbf {A}$ , a given parameter $\lambda =\omega (\log q)$ , and $\rho =2.371552$ , the time complexity is diminished from $O(\max \lbrace m n^{\rho -1}, m^{\rho -2} n^{2}\rbrace \cdot (\log q)^{2})$ to $O((mn+m^{2})\lambda \log q+mn(\log q)^{2})$ . The comprehensive results of our experimental performance evaluations substantiate the protocol's practical efficiency and effectiveness.
- 3 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 12 (3) , 913-927
How to Securely and Efficiently Solve the Large-Scale Modular System of Linear Equations on the Cloud
Cloud-assisted computation empowers resource-constrained clients to efficiently tackle computationally intensive tasks by outsourcing them to resource-rich cloud servers. In the current era of Big Data, the widespread need to solve large-scale modular linear systems of equations ( $\mathcal {LMLSE}$ ) of the form $\mathbf {A}\mathbf {x}\equiv \mathbf {b}\mod {q}$ poses a significant challenge, particularly for lightweight devices. This paper delves into the secure outsourcing of $\mathcal {LMLSE}$ under a malicious single-server model and, to the best of our knowledge, introduces the inaugural protocol tailored to this specific context. The cornerstone of our protocol lies in the innovation of a novel matrix encryption method based on sparse unimodular matrix transformations. This novel technique bestows our protocol with several key advantages. First and foremost, it ensures robust privacy for all computation inputs, encompassing $\mathbf {A},\mathbf {b}, q$ , and the output $\mathbf {x}$ , as validated by thorough theoretical analysis. Secondly, the protocol delivers optimal verifiability, enabling clients to detect cloud server misbehavior with an unparalleled probability of 1. Furthermore, it boasts high efficiency, requiring only a single interaction between the client and the cloud server, significantly reducing local-client time costs. For an $m$ -by- $n$ matrix $\mathbf {A}$ , a given parameter $\lambda =\omega (\log q)$ , and $\rho =2.371552$ , the time complexity is diminished from $O(\max \lbrace m n^{\rho -1}, m^{\rho -2} n^{2}\rbrace \cdot (\log q)^{2})$ to $O((mn+m^{2})\lambda \log q+mn(\log q)^{2})$ . The comprehensive results of our experimental performance evaluations substantiate the protocol's practical efficiency and effectiveness.
- 18 December 2023
- Published by Springer Nature
- p. 370-404
Automated Meet-in-the-Middle Attack Goes to Feistel
- 18 December 2023
- Published by Springer Nature
- p. 370-404
Automated Meet-in-the-Middle Attack Goes to Feistel
- 18 December 2023
- Published by Springer Nature
- p. 3-33
Quantum Attacks on Hash Constructions with Low Quantum Random Access Memory
- 18 December 2023
- Published by Springer Nature
- p. 3-33
Quantum Attacks on Hash Constructions with Low Quantum Random Access Memory
- 20 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 835-850
Optimal Selfish Mining-Based Denial-of-Service Attack
In recent years, Bitcoin has become one of the most popular cryptocurrencies. The most significant mechanism of Bitcoin is PoW (Proof-of-Work), but it also brings opportunities for mining attacks. In our last study, we proposed a Selfish Mining-based Denial-of-Service Attack (SDoS), which can cause serious threats to the Bitcoin system. On this basis, we further put forward three greedier SDoS attack strategies: a competitive greedy SDoS attack strategy ESDoS, a trail greedy SDoS attack strategy TSDoS, a hybrid greedy SDoS attack strategy ETSDoS, and a more public SDoS attack strategy PSDoS. Besides, we also study the adversary’s optimal strategies under different conditions. The experimental results show that if the adversary adopts the SDoS optimal strategy, his revenue increase rate will be further improved and significantly higher than the other existing mining attacks. If the adversary masters 14% of the total mining power, he has a chance to improve his revenue (25% in Selfish Mining, 19.6% in SDoS), and if the adversary masters 15% of the total mining power, he is capable of launching a 51% attack.
- 20 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 835-850
Optimal Selfish Mining-Based Denial-of-Service Attack
In recent years, Bitcoin has become one of the most popular cryptocurrencies. The most significant mechanism of Bitcoin is PoW (Proof-of-Work), but it also brings opportunities for mining attacks. In our last study, we proposed a Selfish Mining-based Denial-of-Service Attack (SDoS), which can cause serious threats to the Bitcoin system. On this basis, we further put forward three greedier SDoS attack strategies: a competitive greedy SDoS attack strategy ESDoS, a trail greedy SDoS attack strategy TSDoS, a hybrid greedy SDoS attack strategy ETSDoS, and a more public SDoS attack strategy PSDoS. Besides, we also study the adversary’s optimal strategies under different conditions. The experimental results show that if the adversary adopts the SDoS optimal strategy, his revenue increase rate will be further improved and significantly higher than the other existing mining attacks. If the adversary masters 14% of the total mining power, he has a chance to improve his revenue (25% in Selfish Mining, 19.6% in SDoS), and if the adversary masters 15% of the total mining power, he is capable of launching a 51% attack.
- 5 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (22) , 20049-20064
A Multifactor Combined Data Sharing Scheme for Vehicular Fog Computing Using Blockchain
Vehicular fog computing (VFC), as an extended model of fog computing, combines fog computing with traditional in-vehicle networks to provide real-time response services for users. However, in such a dynamic system architecture, achieving secure and efficient data sharing is an enormous challenge. Ciphertext-policy attribute-based encryption (CP-ABE) is widely regarded as an excellent way of achieving one-to-many data sharing. Nevertheless, several practical challenges hinder its widespread application in VFC, such as inefficient attribute revocation, single-factor access control, and centralized data storage. For this purpose, we design a multifactor combined data sharing scheme for VFC with CP-ABE and blockchain (MC-DS-VFC, in short). We first propose an efficient attribute revocation mechanism that does not require complex key update operations. We then embed time, user attributes, and access interests into data sharing for more fine-grain access control, which enables users with sufficient attributes to efficiently access real-time shared data according to their access interests. Finally, we combine the interplanetary file system (IPFS) and the blockchain maintained by roadside units (RSUs) to achieve distributed collaborative storage. Furthermore, our mechanism also supports user traceability, attribute joining, online/offline encryption, and verifiable outsourced decryption. Our proposal is shown to satisfy the indistinguishability under chosen plaintext attack (IND-CPA) in the standard model. Theoretical analysis and simulation experiments indicate that the MC-DS-VFC scheme is efficient and practical for VFC.
- 5 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (22) , 20049-20064
A Multifactor Combined Data Sharing Scheme for Vehicular Fog Computing Using Blockchain
Vehicular fog computing (VFC), as an extended model of fog computing, combines fog computing with traditional in-vehicle networks to provide real-time response services for users. However, in such a dynamic system architecture, achieving secure and efficient data sharing is an enormous challenge. Ciphertext-policy attribute-based encryption (CP-ABE) is widely regarded as an excellent way of achieving one-to-many data sharing. Nevertheless, several practical challenges hinder its widespread application in VFC, such as inefficient attribute revocation, single-factor access control, and centralized data storage. For this purpose, we design a multifactor combined data sharing scheme for VFC with CP-ABE and blockchain (MC-DS-VFC, in short). We first propose an efficient attribute revocation mechanism that does not require complex key update operations. We then embed time, user attributes, and access interests into data sharing for more fine-grain access control, which enables users with sufficient attributes to efficiently access real-time shared data according to their access interests. Finally, we combine the interplanetary file system (IPFS) and the blockchain maintained by roadside units (RSUs) to achieve distributed collaborative storage. Furthermore, our mechanism also supports user traceability, attribute joining, online/offline encryption, and verifiable outsourced decryption. Our proposal is shown to satisfy the indistinguishability under chosen plaintext attack (IND-CPA) in the standard model. Theoretical analysis and simulation experiments indicate that the MC-DS-VFC scheme is efficient and practical for VFC.