EDBT 2026 Demo / reviewers in the wild / expert
Hao Zeng 0006
dblp:59/6515-6
· DBLP profile ↗
6ranked-venue papers
4as first author
6since 2021 · last 2026
0009-0005-7909-4082ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 2 first-author · 3 since 2021Computer networks · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | FastPoS: An efficient Proof of Storage scheme with polynomial commitments for fog-cloud IoT systems
Yuting An, Helei Cui, Hao Zeng 0006, Xiaoning Liu 0002, Bin Guo 0001, Zhiwen Yu 0001 |
Comput. Secur. | 3 |
| 2025 | SenFEED: Dynamic Decentralized Oracle Services for Accurate and Real-Time Sensor Data
Hao Zeng 0006, Helei Cui, Cong Wang 0001, Bo Zhang 0119, Zhiwen Yu 0001, Bin Guo 0001 |
INFOCOM | 1 |
| 2025 | TrustLive: Dynamic and Efficient Trust Evaluation in SIoT with Graph Neural NetworksabstractThe emerging paradigm Social Internet of Things (SIoT) integrates social networking elements into the Internet of Things, enabling smart devices to establish and manage interactions autonomously. This enhances collaboration and adaptability but also increases complexity and vulnerability, particularly from malicious devices exploiting these relationships. To address this, trust evaluation of devices becomes crucial. Traditional approaches, like weighted sums and Bayesian inference, struggle with the dynamic nature of SIoT environments. Recent advancements in Graph Neural Networks (GNNs) show promise, yet existing models often fail to capture the complexities of SIoT's dynamic and heterogeneous nature. In this paper, we propose TrustLive, a GNN-based framework for real-time trust evaluation in dynamic SIoT settings. TrustLive first employs a heterogeneous graph to represent smart devices and their interactions, which are then encoded via a customized graph embedding technique for trust feature extraction. It further incorporates Graph Convolutional Networks for trust aggregation and Temporal Convolutional Networks to capture trust evolution. Moreover, a Memory-Augmented Incremental Update mechanism is added to ensure low-latency updates by processing only the latest data while preserving accuracy with historical results. Experimental results demonstrate that TrustLive outperforms current methods in both accuracy and efficiency, offering a robust solution for trust evaluation in SIoT. Jingjie Zhou, Hao Zeng 0006, Helei Cui, Xiaoning Liu 0002, Zhiwen Yu 0001, Bin Guo 0001 |
IWQoS | 2 |
| 2025 | Decentralized and Fair Trading Via Blockchain: The Journey So Far and the Road AheadabstractCentralized trading platforms have long been the preferred choice for users, despite growing concerns regarding data privacy. Users have to place their trust in these platforms and provide sensitive personal information, like identities and financial accounts. However, these centralized platforms often lack transparency, making it challenging to ensure fairness, privacy, and security against both external and internal risks. In contrast, a decentralized fair trading paradigm, harnessing the potential of blockchain technology, is rapidly emerging. It empowers individuals to engage in the exchange of digital assets with others while guaranteeing fairness, efficiency, and privacy. In this paper, we conduct a comprehensive survey of decentralized fair trading. We commence by providing fundamental definitions of fair trading and tracing its evolution over time. We then delve into the essential framework of on-chain and off-chain trading and highlight key improvements that enhance the efficiency of decentralized fair trading within various application scenarios. Furthermore, we undertake a thorough analysis of privacy and security enhancements within the scope, summarizing defenses against known attacks. Finally, we outline the challenges and offer insights into the future prospects of decentralized fair trading, with the aim of inspiring the development of more innovative and promising designs in this evolving trend. Hao Zeng 0006, Helei Cui, Bo Zhang 0119, Chengjun Cai, Zhiwen Yu 0001, Bin Guo 0001 |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2025 | DCrowd: Decentralized Mobile Crowdsensing Via Proof of Task Assignment BlockchainabstractRecently, blockchain-based decentralized mobile crowdsensing systems have emerged to eliminate traditional centralized trust and to achieve transparent task assignments via smart contracts. It allows workers to select tasks freely, thereby maximizing their benefits. However, prior designs rarely considered the globally optimal task assignment that significantly impacts the efficiency and quality of task performance, like maximizing the task completion ratio and minimizing the total travel distance of workers. So in this paper, we propose DCrowd, a new blockchain-based mobile crowdsensing system, to realize the decentralized, transparent, and globally optimal task assignment. In brief, we first introduce the Proof of Task Assignment consensus mechanism. This allows miners to conduct globally optimal task assignments off-chain, leverages smart contracts to perform lightweight verification for task assignment results on-chain, and stores the globally optimal task assignment in a customized block. Then, we devise the Weight-Prioritized Task Selection strategy and Threshold-based Adaptive Minimum Cost Flow algorithm, to further optimize the system performance and guide miners in competing for minting rights. A thorough theoretical analysis is provided. Extensive experiments on real-world datasets indicate that DCrowd can reduce the broadcast and consensus latency by over 50% and improve the throughput by over 87% compared with existing systems. Hao Zeng 0006, Helei Cui, Xiaoli Zhang 0003, Bo Zhang 0119, Yuefeng Du 0001, Bin Guo 0001, Zhiwen Yu 0001 |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2023 | Poster: Task Difficulty Adjustment in the Energy-Recycling Consensus MechanismabstractAn increasing number of energy-recycling consensus mechanisms are being employed to address the drawback of proof of work (PoW) wasting computation and energy. For instance, the computing power wasted in solving difficult but meaningless PoW puzzles is used to conduct practical federated learning tasks and train deep learning models. However, there remains a neglected issue of task difficulty adjustment. To address this problem, we propose a method for measuring task difficulty and an algorithm for adjustment to achieve controlled minting and stable transaction processing capacity for cryptocurrency based on energy-recycling consensus mechanisms. Our research evaluates the effectiveness of this algorithm and highlights the potential benefits of this approach. Hao Zeng 0006, Helei Cui, Yuefeng Du 0001, Zhiwen Yu 0001, Bin Guo 0001 |
ICDCS | 1 |