Demo Data from EDBT 2026 / reviewers in the wild / expert
Xinrui Zhang 0008
dblp:90/8490-8
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0001-7749-6030ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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 |
Blockchain and cryptocurrency security · 77% Cryptographic primitives and cryptanalysis · 23% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Blockchain and cryptocurrency security › consensus protocol
consensus protocol security |
0.7 | 1 | 2023 | Time-manipulation Attack: Breaking Fairness against Proof of Authority Aura · WWW 2023 |
Distributed systems
consensus |
0.7 | 1 | 2023 | Time-manipulation Attack: Breaking Fairness against Proof of Authority Aura · WWW 2023 |
Cryptographic primitives and cryptanalysis › cryptanalysis
attack analysis |
0.2 | 1 | 2023 | Time-manipulation Attack: Breaking Fairness against Proof of Authority Aura · WWW 2023 |
Methods — techniques the papers use, named apart from their topics
timestamp manipulation · 1.3time-manipulation attack · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Time-manipulation Attack: Breaking Fairness against Proof of Authority AuraabstractAs blockchain-based commercial projects and startups flourish, efficiency becomes one of the critical metrics in designing blockchain systems. Due to its high efficiency, Proof of Authority (PoA) Aura has become one of the most widely adopted consensus solutions for blockchains. Our research finds over 4,000 projects have used Aura and its variants. In this paper, we provide a rigorous analysis of Aura. We propose three types of time-manipulation attacks, where a malicious leader simply needs to modify the timestamp in its proposed block or delay it to extract extra benefits. These attacks can easily break the legal leader election, thus directly harming the fairness of the block proposal. We apply our attacks to a mature Aura project called OpenEthereum. By repeatedly conducting our attacks1 over 15 days, we find that an adversary can gain on average 200% mining rewards of their fair shares. Furthermore, such attacks can even indirectly break the finality of blocks and the safety of the system. Based on the deployment of Aura as of September 2022, the potentially affected market cap is up to 2.13 billion USD. As a by-product, we further discuss solutions to mitigate such issues and report our observations to official teams. Xinrui Zhang 0008, Rujia Li 0001, Qin Wang 0008, Qi Wang 0012, Sisi Duan |
WWW | 1 |
| 2022 | Frontrunning Block Attack in PoA Clique: A Case StudyabstractIn this paper, we propose a frontrunning block attack against the Clique-based Proof of Authority (PoA) algorithms. Our attack can frontrun blocks from honest in-turn sealers by breaking the leader rotation’s proper order. By falsifying the priority parameters (both difficulty and delay time), a malicious non-in-turn sealer can always successfully occupy the leader position and produce advantageous blocks that may contain profitable transactions. As a typical instance, we apply our attack to a mature Clique-based project, HPB (with the market cap $10,128,116, as of Jan 2022). Experimental results demonstrate the effectiveness and feasibility. Then, we further propose fixes by checking sealer’s identity. Our investigation and suggestion have been submitted to its official team. We believe this work can act as, at least, a warning case for Clique variants to avoid repeating such design mistakes. Xinrui Zhang 0008, Qin Wang 0008, Rujia Li 0001, Qi Wang 0012 |
ICBC | 1 |