Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Junchao Chen 0003

dblp:39/9851-3 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0009-0007-6189-3681ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 since 2021Security and privacy · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 100%
Network and information security
1 paper
Blockchain and cryptocurrency security · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
consensus
1.922026
Proof-of-Execution: Low-Latency Consensus via Speculative Execution · ACM Trans. Database Syst. 2026
FairDAG: Consensus Fairness over Multi-Proposer Causal Design · Proc. VLDB Endow. 2025
Distributed systems › consistency models
causal ordering
0.912025
FairDAG: Consensus Fairness over Multi-Proposer Causal Design · Proc. VLDB Endow. 2025
Blockchain and cryptocurrency security
blockchain data management
0.312026
Proof-of-Execution: Low-Latency Consensus via Speculative Execution · ACM Trans. Database Syst. 2026
YearPublicationVenuePosition
2026 Thunderbolt: Concurrent Smart Contract Execution with Non-blocking Reconfiguration for Sharded DAGs
Junchao Chen 0003, Alberto Sonnino, Eleftherios Kokoris-Kogias, Mohammad Sadoghi
EDBT1
2026 Proof-of-Execution: Low-Latency Consensus via Speculative Execution
abstract
The introduction of Bitcoin fueled the development of blockchain-based resilient data management systems that are resilient against failures, enable federated data management, and can support data provenance. The key factor determining the performance of such resilient data management systems is the consensus protocol used by the system to replicate client transactions among all participants. Unfortunately, existing high-throughput consensus protocols are costly and impose significant latency on transaction processing, which rules out their usage in responsive high-performance data management systems. In this work, we improve on this situation by introducing the Proof-of-Execution consensus protocol ( PoE ), a consensus protocol designed for high-performance low-latency resilient data management. PoE introduces speculative execution , which minimizes latency by starting execution before consensus is reached, and PoE introduces proof-of-executions to guarantee successful execution to clients. Furthermore, PoE introduces a single-round check-commit protocol to reduce the overall communication costs of consensus. Hence, we believe that PoE is a promising step towards flexible general-purpose low-latency resilient data management systems.
Jelle Hellings, Suyash Gupta 0001, Sajjad Rahnama, Junchao Chen 0003, Celine Sana, Mohammad Sadoghi
ACM Trans. Database Syst.4
2025 Securing Consensus from Long-Range Attacks Through Collaboration
abstract
Decentralized systems built around blockchain technology promise clients an immutable ledger. They add a transaction to the ledger after it undergoes consensus among the replicas that run a Proof-of-Stake (PoS) or Byzantine Fault-Tolerant (BFT) consensus protocol. Unfortunately, these protocols face a long-range attack where an adversary having access to the private keys of the replicas can rewrite the ledger. An existing solution to this problem forces each committed block from these protocols to undergo another consensus, Proof-of-Work (PoW) consensus; POW protocol wastes computational resources as miners compete to solve complex puzzles. In this paper, we present the design of our Power-of-Collaboration (POC) protocol, which guards existing POS/BFT blockchains against long-range attacks and requires miners to collaborate rather than compete. POC guarantees fairness and accountability and only marginally degrades the throughput of the underlying system.
Junchao Chen 0003, Suyash Gupta 0001, Alberto Sonnino, Eleftherios Kokoris-Kogias, Mohammad Sadoghi
SRDS1
2025 FairDAG: Consensus Fairness over Multi-Proposer Causal Design
Dakai Kang, Junchao Chen 0003, Anh Dinh, Mohammad Sadoghi
Proc. VLDB Endow.2