EDBT 2026 Demo / reviewers in the wild / expert
Haoxin He
dblp:421/7411
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0003-7130-5098ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Hardware security and side channels · 67% Blockchain and cryptocurrency security · 33% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Blockchain and cryptocurrency security › blockchain oracle
decentralized oracle |
1.0 | 1 | 2026 | EnduraTrust: Achieving Sustained Trust Through a Decentralized Root of Trust for Blockchain Oracles · IEEE Trans. Netw. 2026 |
Hardware security and side channels › hardware security primitives
physical unclonable function |
1.0 | 1 | 2026 | EnduraTrust: Achieving Sustained Trust Through a Decentralized Root of Trust for Blockchain Oracles · IEEE Trans. Netw. 2026 |
Hardware security and side channels › trusted execution environments
remote attestation |
1.0 | 1 | 2026 | EnduraTrust: Achieving Sustained Trust Through a Decentralized Root of Trust for Blockchain Oracles · IEEE Trans. Netw. 2026 |
Distributed systems
fault tolerance |
0.3 | 1 | 2026 | EnduraTrust: Achieving Sustained Trust Through a Decentralized Root of Trust for Blockchain Oracles · IEEE Trans. Netw. 2026 |
Distributed systems › fault tolerance
single point of failure |
0.3 | 1 | 2026 | EnduraTrust: Achieving Sustained Trust Through a Decentralized Root of Trust for Blockchain Oracles · IEEE Trans. Netw. 2026 |
Methods — techniques the papers use, named apart from their topics
node selection algorithm · 2.0incentive mechanism · 2.0formal security analysis · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | EnduraTrust: Achieving Sustained Trust Through a Decentralized Root of Trust for Blockchain OraclesabstractBlockchain oracles are essential for enabling smart contracts to access and interact with off-chain data, where its security and trustworthiness are crucial for preserving the overall reliability and integrity of blockchain-based systems. However, existing reputation-based blockchain oracles are vulnerable to Sybil and collusion attacks. To address these issues, trusted execution environments (TEEs) have been leveraged to construct blockchain oracles. While these TEE-enabled oracles provide resistance against the above attacks, they typically depend on a centralized Root of Trust (RoT), which introduces risks such as root key pre-provision risks and single points of failure. Moreover, they often struggle to maintain trust over time, making them unsuitable for application scenarios that require long-term guaranteed trust. In this paper, we propose EnduraTrust, a highly secure blockchain oracle network empowered by a decentralized Root of Trust (DRoT), which can overcome single points of failure, offer trust sustainability, minimize the security risk of root key pre-provision, and provide essential participation incentive. Concretely, it adopts Physically Unclonable Functions (PUFs) to generate device-specific root keys, eliminating the risks associated with centralized key pre-provision. To confront mobile attacks and ensure sustained trust, it employs an off-chain process to generate attestation reports, which are then verified onchain through a non-interactive protocol. This protocol ensures robust integrity verification for Individual Root of Trust (IRoT) nodes while minimizing latency and overhead. In addition, we design a fair and secure IRoT node selection algorithm to form a trustworthy oracle committee to offer oracle services, protecting against Sybil and collusion attacks to which existing oracles are prone. Particularly, we apply an incentive mechanism to encourage oracle node participation and reliable behavior. We validate EnduraTrust through formal security analysis and performance evaluation based on prototype implementation. Our results show that EnduraTrust enhances root key security, realizes decentralization, offers fair oracle node selection, ensures sustained trust, exhibits strong robustness, and provides participation incentive. It surpasses existing decentralized attestation schemes in multiple dimensions, including security, contract execution efficiency, attestation protocol performance, and scalability. Besides, its performance regarding oracle response aggregation and aggregated response verification confirming its effectiveness. Shufan Fei, Zheng Yan 0002, Haoxin He, Elisa Bertino |
IEEE Trans. Netw. | 3 |