Pingyuan Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Pingyuan Zhang has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Qikun Zhang
School of Computer Science and Artificial Intelligence, Zhengzhou University of Light Industry, Zhengzhou 450002, China
2 shared publications - Chen Fu
School of Computer Science and Artificial Intelligence, Zhengzhou University of Light Industry, Zhengzhou 450002, China
1 shared publication - Haining Yang
Shandong University
1 shared publication - Hongfei Zhu
Key Laboratory of Big Data Intelligent Computing, Chongqing University of Posts and Telecommunications, Chongqing, China
1 shared publication - Jinbo Feng
School of Computer Science and Artificial Intelligence, Zhengzhou University of Light Industry, Zhengzhou, China
1 shared publication - Jing Qin
Shandong University
1 shared publication
Latest Publications
- Open Access
- 18 September 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (9) , 488
COAu-IoD: A Cloud and Offline Computing-Assisted Authentication Framework for Lightweight UAV Communication in IoD
The Internet of Drones (IoD) enables efficient communications among unmanned aerial vehicles (UAV) via wireless links. Restricted by limited onboard computing resources and complicated operating environments, such a network is vulnerable to external or internal security threats. It is therefore urgent to deploy an effective authentication mechanism to isolate malicious attackers prior to UAV communications. Nevertheless, the conventional identity-based IoD authentication schemes must account for total computation and communication overhead, regardless of the effective instant of authentication messages. In this work, we consider the offline precomputation in the authentication phase before the message is available and add cloud servers as an extra component in IoD to assist limited onboard resources to share partial authentication calculation. As a result, this work proposes a new cloud- and offline-computing-assisted authentication framework, known as COAu-IoD, to provide lightweight communication between a UAV and ground station by transferring heavy computation overhead to the offline phase. We give a security model for this authentication framework and provide an efficient construction based on this framework and a known identity-based signature scheme. What is more, we give its security proof and evaluate its performance using the standard and recent state-of-the-art IoD authentication schemes. The results demonstrate that our COAu-IoD scheme achieves lower online computation and communication overhead for UAVs, at the cost of acceptable offline precomputation overhead.
- 18 September 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (9) , 488
Open AccessCOAu-IoD: A Cloud and Offline Computing-Assisted Authentication Framework for Lightweight UAV Communication in IoD
The Internet of Drones (IoD) enables efficient communications among unmanned aerial vehicles (UAV) via wireless links. Restricted by limited onboard computing resources and complicated operating environments, such a network is vulnerable to external or internal security threats. It is therefore urgent to deploy an effective authentication mechanism to isolate malicious attackers prior to UAV communications. Nevertheless, the conventional identity-based IoD authentication schemes must account for total computation and communication overhead, regardless of the effective instant of authentication messages. In this work, we consider the offline precomputation in the authentication phase before the message is available and add cloud servers as an extra component in IoD to assist limited onboard resources to share partial authentication calculation. As a result, this work proposes a new cloud- and offline-computing-assisted authentication framework, known as COAu-IoD, to provide lightweight communication between a UAV and ground station by transferring heavy computation overhead to the offline phase. We give a security model for this authentication framework and provide an efficient construction based on this framework and a known identity-based signature scheme. What is more, we give its security proof and evaluate its performance using the standard and recent state-of-the-art IoD authentication schemes. The results demonstrate that our COAu-IoD scheme achieves lower online computation and communication overhead for UAVs, at the cost of acceptable offline precomputation overhead.
- Open Access
- 27 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 806
Privacy-preserving secure data sharing in edge-cloud collaborative environments
- 27 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 806
Open AccessPrivacy-preserving secure data sharing in edge-cloud collaborative environments
- Open Access
A New Lattice-Based Post-Quantum Digital Signature from Compact Rejection Sampling
Rejection samplings are the essential building blocks to design lattice-based digital signatures under the Fiat–Shamir paradigm. Up to now most of them have been built by Gaussian samplings or uniform samplings. Gaussian-based rejection sampling signatures such as the BLISS scheme have very short signature sizes but are vulnerable to timing attacks, whereas the uniform-based rejection sampling signatures such as ML-DSA are allowed to be simply implemented but have larger signature sizes. This work intends to use a new probability distribution, rather than Gaussian or uniform distributions, to build the rejection sampling in Fiat–Shamir signatures, and aims to achieve short signature sizes while avoiding the cost of Gaussian sampling. To this end, we choose centered binomial distribution as a replacement, and build a new and compact rejection sampling that has the properties of both high-precision sampling and semi-uniform operation. As an application, we combine this rejection sampling with Lyubashevsky’s signature scheme, then propose the first lattice-based Fiat–Shamir signature scheme from centered binomial distribution. The proposed scheme not only avoids Gaussian sampling, but also is very efficient in terms of the signature sizes.
Open AccessA New Lattice-Based Post-Quantum Digital Signature from Compact Rejection Sampling
Rejection samplings are the essential building blocks to design lattice-based digital signatures under the Fiat–Shamir paradigm. Up to now most of them have been built by Gaussian samplings or uniform samplings. Gaussian-based rejection sampling signatures such as the BLISS scheme have very short signature sizes but are vulnerable to timing attacks, whereas the uniform-based rejection sampling signatures such as ML-DSA are allowed to be simply implemented but have larger signature sizes. This work intends to use a new probability distribution, rather than Gaussian or uniform distributions, to build the rejection sampling in Fiat–Shamir signatures, and aims to achieve short signature sizes while avoiding the cost of Gaussian sampling. To this end, we choose centered binomial distribution as a replacement, and build a new and compact rejection sampling that has the properties of both high-precision sampling and semi-uniform operation. As an application, we combine this rejection sampling with Lyubashevsky’s signature scheme, then propose the first lattice-based Fiat–Shamir signature scheme from centered binomial distribution. The proposed scheme not only avoids Gaussian sampling, but also is very efficient in terms of the signature sizes.
- Open Access
Online/Offline VANETs with Lightweight Authentication Framework for Vehicular Communication
Vehicular Ad Hoc Networks (VANETs) are mobile networks that offer new services and communication between moving vehicles, roadside infrastructure, and a trusted authority. With the development of autonomous and connected vehicles, the issue of authentication in VANETs has become increasingly prominent due to the lack of mutual trust among network entities. However, standard authentication models for VANETs must account for total computational and communication overhead, regardless of the timing of authentication message generation. To address this limitation, this work proposes an advanced authentication paradigm for VANETs called the online/offline VANET framework, and formalizes this novel framework to realize lightweight authentication by shifting heavy computational overhead to the offline phase. The proposed model is divided into an offline phase and an online phase. In the offline phase of the free time before the message becomes available, it allows more powerful trusted authority to pre-compute, and in the online phase, resource-constrained devices only execute a small set of residual operations. Based on this model and a new identity-based signature, we give an efficient instantiation and use a mobile platform to evaluate it. The experimental results demonstrate that our construction achieves low online computational and communication overhead.
Open AccessOnline/Offline VANETs with Lightweight Authentication Framework for Vehicular Communication
Vehicular Ad Hoc Networks (VANETs) are mobile networks that offer new services and communication between moving vehicles, roadside infrastructure, and a trusted authority. With the development of autonomous and connected vehicles, the issue of authentication in VANETs has become increasingly prominent due to the lack of mutual trust among network entities. However, standard authentication models for VANETs must account for total computational and communication overhead, regardless of the timing of authentication message generation. To address this limitation, this work proposes an advanced authentication paradigm for VANETs called the online/offline VANET framework, and formalizes this novel framework to realize lightweight authentication by shifting heavy computational overhead to the offline phase. The proposed model is divided into an offline phase and an online phase. In the offline phase of the free time before the message becomes available, it allows more powerful trusted authority to pre-compute, and in the online phase, resource-constrained devices only execute a small set of residual operations. Based on this model and a new identity-based signature, we give an efficient instantiation and use a mobile platform to evaluate it. The experimental results demonstrate that our construction achieves low online computational and communication overhead.
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (11) , 24532-24542
Long-Term Key-Exposure-Resilient Deduplication and Integrity Auditing for IoT Without Third Parties
Integrity auditing with deduplication enables integrity verification of cloud-stored Internet of Things (IoT) data while alleviating storage overhead caused by data redundancy. In most existing deduplication auditing schemes, authenticators are generated using the initial client’s key. However, clients are often vulnerable to key exposure. Compromise of the private key undermines the auditing security of all identical files. Although client-key-based schemes provide stronger security, they still suffer from the risk of gradual key-exposure in long-term deployments. Therefore, achieving integrity auditing, data deduplication, and resistance to long-term key-exposure simultaneously remains a challenging problem. While some existing schemes achieve these objectives, they rely on a third-party auditor (TPA). Compromise of the auditor would endanger all clients, and its continuous involvement could incur additional communication overhead. To address these limitations in cloud-based IoT data storage, this work presents an integrity auditing scheme that simultaneously supports deduplication and long-term key-exposure resilience without requiring a third party for key updates. By aggregating authenticators and public keys of clients, authenticator storage, proof generation, and proof verification costs remain independent of the number of participating clients. In addition, the integrity of previously uploaded data remains protected even when all clients’ secret keys at the current time are compromised. Our scheme is provably secure in the random oracle model under the$\ell $ -wBDHI${}^{*}_{3}$ assumption. Performance evaluations further demonstrate that the authenticator size and auditing cost are unaffected by the number of identical files, making the scheme practical for cloud-based IoT systems.- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (11) , 24532-24542
Long-Term Key-Exposure-Resilient Deduplication and Integrity Auditing for IoT Without Third Parties
Integrity auditing with deduplication enables integrity verification of cloud-stored Internet of Things (IoT) data while alleviating storage overhead caused by data redundancy. In most existing deduplication auditing schemes, authenticators are generated using the initial client’s key. However, clients are often vulnerable to key exposure. Compromise of the private key undermines the auditing security of all identical files. Although client-key-based schemes provide stronger security, they still suffer from the risk of gradual key-exposure in long-term deployments. Therefore, achieving integrity auditing, data deduplication, and resistance to long-term key-exposure simultaneously remains a challenging problem. While some existing schemes achieve these objectives, they rely on a third-party auditor (TPA). Compromise of the auditor would endanger all clients, and its continuous involvement could incur additional communication overhead. To address these limitations in cloud-based IoT data storage, this work presents an integrity auditing scheme that simultaneously supports deduplication and long-term key-exposure resilience without requiring a third party for key updates. By aggregating authenticators and public keys of clients, authenticator storage, proof generation, and proof verification costs remain independent of the number of participating clients. In addition, the integrity of previously uploaded data remains protected even when all clients’ secret keys at the current time are compromised. Our scheme is provably secure in the random oracle model under the$\ell $ -wBDHI${}^{*}_{3}$ assumption. Performance evaluations further demonstrate that the authenticator size and auditing cost are unaffected by the number of identical files, making the scheme practical for cloud-based IoT systems.- Open Access
- 31 October 2022
- Published by MDPI AG in Sustainability
- Vol. 14 (21) , 14225
Lattice-Based Verifiably Encrypted Signature Scheme without Gaussian Sampling for Privacy Protection in Blockchain
Before the transaction data in the blockchain is successfully linked, its signature must be publicly verified by a large number of nodes in the blockchain, which is also one of the ways to leak transaction information. To alleviate the contradiction between the public verifiability of signatures and the protection of transaction privacy, we introduce a verifiably encrypted signature scheme into the blockchain. A verifiably encrypted signature scheme contains two parts of signature information: the encrypted signature is used for public verification, and the ordinary signature is used for internal verification. To reach this goal even better, we design a new lattice-based verifiably encrypted signature scheme, which separates the parameter settings of the signer and the adjudicator, and replaces the Gaussian sampling algorithm with a small range of uniform random sampling, achieving better efficiency and security.
- 31 October 2022
- Published by MDPI AG in Sustainability
- Vol. 14 (21) , 14225
Open AccessLattice-Based Verifiably Encrypted Signature Scheme without Gaussian Sampling for Privacy Protection in Blockchain
Before the transaction data in the blockchain is successfully linked, its signature must be publicly verified by a large number of nodes in the blockchain, which is also one of the ways to leak transaction information. To alleviate the contradiction between the public verifiability of signatures and the protection of transaction privacy, we introduce a verifiably encrypted signature scheme into the blockchain. A verifiably encrypted signature scheme contains two parts of signature information: the encrypted signature is used for public verification, and the ordinary signature is used for internal verification. To reach this goal even better, we design a new lattice-based verifiably encrypted signature scheme, which separates the parameter settings of the signer and the adjudicator, and replaces the Gaussian sampling algorithm with a small range of uniform random sampling, achieving better efficiency and security.