WEN GAO

Dr. WEN GAO

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
18 October 2023 in Electronics
Verified
Journal Article
Open access
PDF file
SDSiyue Dong
Siyue Dong
ZZZhen Zhao
Zhen Zhao
BWBaocang Wang
Baocang Wang
WEN GAOWEN GAO
WEN GAO
SZShanshan Zhang
Shanshan Zhang
Public key encryption with equality test (PKEET) is a cryptographic primitive that enables a tester to determine, without decryption, whether two ciphertexts encrypted with different public keys generate from the same message. In previous research, public key encryption with equality test (PKEET) was extended to include identity-based encryption with equality test (IBEET), thereby broadening the application of PKEET. Subsequently, certificateless encryption with equality test (CLEET) was introduced to address the key escrow problem in IBEET. However, existing CLEET schemes suffer from inefficiency and potential information leakage when dealing with multiple ciphertexts due to the need for pairwise equality tests. To address this issue, we propose a concept of certificateless encryption supporting multi-ciphertext equality test with proxy-assisted authorization (CLE-MET-PA). CLE-MET-PA incorporates the functionality of the multi-ciphertext equality test into CLEET, enabling a tester to perform a single equality test on multiple ciphertexts to determine whether the underlying plaintexts are equal, without revealing any additional information. This enhances the security of our scheme while significantly reducing the computational overhead compared to multiple pairwise equality tests, making our scheme more efficient. Additionally, our approach integrates proxy-assisted authorization, allowing users to delegate a proxy to grant authorizations for equality tests on their behalf when offline. Importantly, the proxy token used in our scheme does not include any portion of the user’s private key, providing enhanced protection compared to traditional PKEET schemes in which the user token is often part of the user’s private key. We construct a concrete CLE-MET-PA scheme and prove that it achieves CPA security and attains CCA security through an FO transformation.

28 October 2024 in Cryptography
Verified
Journal Article
Open access
PDF file
WEN GAOWEN GAO
WEN GAO
HYHaoyuan Yao
Haoyuan Yao
BQBaodong Qin
Baodong Qin
XDXiaoli Dong
Xiaoli Dong
ZZZhen Zhao
Zhen Zhao
JZJiayu Zeng
Jiayu Zeng
Ring signatures are widely used in e-voting, anonymous whistle-blowing systems, and blockchain transactions. However, due to the anonymity of ring signatures, a signer can sign the same message multiple times, potentially leading to repeated voting or double spending in blockchain transactions. To address these issues in blockchain transactions, this work constructs an identity-based linkable ring signature scheme based on the hardness of the lattice-based Module Small Integer Solution (M-SIS) assumption, which is hard even for quantum attackers. The proposed scheme is proven to be anonymous, unforgeable, linkable, and nonslanderable in the random oracle model. Compared to existing identity-based linkable ring signature (IBLRS) schemes of linear size, our signature size is relatively smaller, and this advantage is more pronounced when the number of ring members is small. We provide approximate signature size data for ring members ranging from 2 to 2048. When the number of ring members is 16 (or 512. resp.), the signature size of our scheme is 11.40 KB (or 24.68 KB, respectively). Finally, a threshold extension is given as an additional scheme with specifications and security analysis.

1 July 2025 in Computer Standards & Interfaces
Verified
Journal Article
Closed access
WEN GAOWEN GAO
WEN GAO
TFTianyou Fu
Tianyou Fu
BQBaodong Qin
Baodong Qin
XDXiaoli Dong
Xiaoli Dong
ZZZhen Zhao
Zhen Zhao
MLMomeng Liu
Momeng Liu

28 March 2025 in Electronics
Verified
Journal Article
Open access
PDF file
WEN GAOWEN GAO
WEN GAO
TFTianyou Fu
Tianyou Fu
SRSimeng Ren
Simeng Ren
SJShixuan Jin
Shixuan Jin
XDXiaoli Dong
Xiaoli Dong
ZZZhen Zhao
Zhen Zhao
In electronic voting systems, a large number of voters are often required to vote. It is also necessary to ensure the security of the voters and the fairness of the vote. The use of ring signatures is very suitable for e-voting systems because of their special anonymity. Among the many types of ring signatures, certificateless ring signature (CRS) stands out because it does not require certificates and avoids the need to completely trust the key generation center (KGC). In this paper, we propose a certificateless ring signature based on the special structure of the number theory research unit (NTRU) lattice, which utilizes the Merkle tree and seed tree to split commitments and integrate them again to generate signatures. At the same time, we embed the NTRU small integer solution (NTRU-SIS) problem and provide a detailed proof of security under the random oracle model (ROM). In efficiency, the Merkle tree makes the signature size logarithmically increase with the ring scale. In the era of big data explosion, this feature enables the proposed scheme to maintain a comparatively short signature size even when the number of ring members N is very large. When N=8, the signature size is 61.08 KB; when N increases to 512, the size is 65.02 KB. From the data, we can observe that the signature size grows slowly, by only 4 KB when N grows exponentially, which is much slower than ring signatures with linear growth.

10 February 2025 in Electronics
Verified
Journal Article
Open access
PDF file
WEN GAOWEN GAO
WEN GAO
SRSimeng Ren
Simeng Ren
ZLZhaoyang Liu
Zhaoyang Liu
BQBaodong Qin
Baodong Qin
XDXiaoli Dong
Xiaoli Dong
ZZZhen Zhao
Zhen Zhao
The medical industry has made significant advancements in recent years. However, the lack of accountability in medical management has resulted in systemic deficiencies, which have adversely affected patient trust and contributed to an increase in medical disputes. As a result, there is a growing emphasis on managing the quality of medical services, particularly in enhancing patient experience. To address these challenges, we propose a new system for evaluating health services. This system will allow patients to anonymously rate the services they receive while also providing doctors the opportunity to appeal specific reviews. The hospital handles the evaluations and appeals through the management of the cloud platform. We propose a new scheme to assist the work of the platform, which is a lattice-based group signature with verifier-local revocation (VLR-GS). Most of the work on VLR-GS has focused on the random oracle model (ROM) or using non-interactive zero-knowledge proofs (NIZKs). Our construction is anonymous and traceable in the standard model under the hardness of the learning with errors problem and short integer solution problem. Furthermore, theoretically analyzing it has practical significance in both security and efficiency. In conclusion, the proposed scheme establishes a secure and privacy-oriented platform for an anonymous medical service evaluation system, with the goal of fostering patient trust and improving hospital service quality within the healthcare sector.

14 October 2025 in Computer Standards & Interfaces
Verified
Journal Article
Closed access
WEN GAOWEN GAO
WEN GAO
SJShixuan Jin
Shixuan Jin
TFTianyou Fu
Tianyou Fu
SRSimeng Ren
Simeng Ren
XDXiaoli Dong
Xiaoli Dong
BWBaocang Wang
Baocang Wang