Jinzhou Huang

Dr. Jinzhou Huang

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
1 January 2025 in Informatica
Verified
Journal Article
Open access
PDF file
JYJing Yu
Jing Yu
JHJinzhou Huang
Jinzhou Huang
Lianhua ChiLianhua Chi
Lianhua Chi
WWWei Wei
Wei Wei
ZCZongmin Cui
Zongmin Cui
Most existing traffic trajectory recommendation methods don’t consider the driver-car-road preferences, resulting in the poor ability to meet the driver-car-road requirements. To address this issue, we propose a traffic Trajectory Recommendation scheme based on Edge-cloud computing Driver-car-road Preferences (named as TREDP). TREDP reduces the computational, storage, and energy burden on the edge through edge-cloud collaborative computing. TREDP enhances the recommended accuracy by considering driver-car-road requirements and the relationship among driver-car-road in different traffic trajectories. Meanwhile, TREDP increases the computational efficiency through edge-cloud computing. Thus, it improves the driver experience of intelligent traffic trajectory recommendation systems.

11 August 2023 in Journal of Information Security and Applications
Verified
Journal Article
Closed access
YTYan Tong
Yan Tong
SXShiwei Xu
Shiwei Xu
JHJinzhou Huang
Jinzhou Huang
BWBangju Wang
Bangju Wang
ZRZhengwei Ren
Zhengwei Ren

15 December 2023 in Tehnicki vjesnik - Technical Gazette
Verified
Journal Article
Open access
PDF file
ZMZhuolin Mei
Zhuolin Mei
JYJing Yu
Jing Yu
JHJinzhou Huang
Jinzhou Huang
BWBin Wu
Bin Wu
ZZZhiqiang Zhao
Zhiqiang Zhao
ZWZongda Wu
Zongda Wu
With the growing popularity of cloud computing, data owners are increasingly opting to outsource their data to cloud servers due to the numerous benefits it offers. However, this outsourcing raises concerns about data privacy since the data stored on...

1 January 2024 in Computers, Materials & Continua
Verified
Journal Article
Open access
PDF file
BWBin Wu
Bin Wu
XCXianyi Chen
Xianyi Chen
JHJinzhou Huang
Jinzhou Huang
CZCaicai Zhang
Caicai Zhang
JWJing Wang
Jing Wang
ZMZhuolin Mei
Zhuolin Mei
In a cloud environment, outsourced graph data is widely used in companies, enterprises, medical institutions, and so on. Data owners and users can save costs and improve efficiency by storing large amounts of graph data on cloud servers. Servers on cloud platforms usually have some subjective or objective attacks, which make the outsourced graph data in an insecure state. The issue of privacy data protection has become an important obstacle to data sharing and usage. How to query outsourcing graph data safely and effectively has become the focus of research. Adjacency query is a basic and frequently used operation in graph, and it will effectively promote the query range and query ability if multi-keyword fuzzy search can be supported at the same time. This work proposes to protect the privacy information of outsourcing graph data by encryption, mainly studies the problem of multi-keyword fuzzy adjacency query, and puts forward a solution. In our scheme, we use the Bloom filter and encryption mechanism to build a secure index and query token, and adjacency queries are implemented through indexes and query tokens on the cloud server. Our proposed scheme is proved by formal analysis, and the performance and effectiveness of the scheme are illustrated by experimental analysis. The research results of this work will provide solid theoretical and technical support for the further popularization and application of encrypted graph data processing technology.

15 April 2024 in Tehnicki vjesnik - Technical Gazette
Verified
Journal Article
Open access
PDF file
JHJinzhou Huang
Jinzhou Huang
YTYan Tong
Yan Tong
BHBo Hang
Bo Hang
DXDegang Xu
Degang Xu
FWFeng Wang
Feng Wang
JYJing Yu
Jing Yu
The widespread adoption of online social networks has facilitated content sharing among users. However, privacy controls restrict users' access to only a limited portion of the network, typically limited to direct connections or two-hop friends. Brow...