Pingyuan Zhang

Prof. Dr. Pingyuan Zhang

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
31 October 2022 in Sustainability
Verified
Journal Article
Open access
PDF file
XLXiuhua Lu
Xiuhua Lu
YWYin Wei
Yin Wei
PZPingyuan Zhang
Pingyuan Zhang
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.

7 July 2026 in Telecom
Verified
Journal Article
Open access
PDF file
PZPingyuan Zhang
Pingyuan Zhang
LWLimin Wang
Limin Wang
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.

19 August 2026 in Computers
Verified
Journal Article
Open access
PDF file
PZPingyuan Zhang
Pingyuan Zhang
LWLimin Wang
Limin Wang
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.

27 August 2026 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
PDF file
QZQikun Zhang
Qikun Zhang
ZCZheng Cai
Zheng Cai
JFJinbo Feng
Jinbo Feng
RWRuifang Wang
Ruifang Wang
PZPingyuan Zhang
Pingyuan Zhang
HZHongfei Zhu
Hongfei Zhu
In cloud computing environments, data sharing serves as a foundational enabler of collaborative operations across heterogeneous terminals. However, such sharing introduces critical challenges–including privacy leakage, inadequate data security, inflexible access control policies, and substantial computational latency. To address these limitations, this paper proposes a privacy-preserving, secure data-sharing framework tailored for edge-cloud collaborative architectures. Relative to conventional approaches, the proposed framework delivers three principal advancements: (1) User Privacy Protection: We design a secure query-matching algorithm that protects plaintext query keywords during data access. The Cloud Server (CS) performs matching over encrypted trapdoors without directly learning the queried keywords. (2) Computational Efficiency Improvement: Edge Servers (ESs) perform outsourced ciphertext transformation using user-specific transformation keys. The terminal only performs a lightweight local operation to recover the resource. This approach minimizes the computational overhead on the terminal side while safeguarding user privacy, and effectively reduces the overhead associated with user joining and revocation within the same group. (3) Fine-Grained, Policy-Driven Access Control: A cryptographically enforced, attribute- and keyword-aware access control mechanism is implemented, supporting precise, context-sensitive authorization decisions via encrypted keyword search and semantic matching–thereby enhancing both the security posture and operational flexibility of data access control.

18 March 2026 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
WWWenchao Wang
Wenchao Wang
XPXueqi Peng
Xueqi Peng
HYHaining Yang
Haining Yang
JQJing Qin
Jing Qin
PZPingyuan Zhang
Pingyuan Zhang
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 September 2026 in Future Internet
Verified
Journal Article
Open access
PDF file
PZPingyuan Zhang
Pingyuan Zhang
CFChen Fu
Chen Fu
QZQikun Zhang
Qikun Zhang
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.