Demo Data from EDBT 2026 / reviewers in the wild / expert
Cheung Leong Tung
dblp:249/7466
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 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 · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Blockchain and cryptocurrency security › blockchain scalability
blockchain sharding |
0.8 | 1 | 2024 | Sharon: Secure and Efficient Cross-shard Transaction Processing via Shard Rotation · INFOCOM 2024 |
Blockchain and cryptocurrency security › blockchain scalability › blockchain sharding
cross-shard transaction |
0.8 | 1 | 2024 | Sharon: Secure and Efficient Cross-shard Transaction Processing via Shard Rotation · INFOCOM 2024 |
Distributed systems
distributed scheduling |
0.8 | 1 | 2024 | Sharon: Secure and Efficient Cross-shard Transaction Processing via Shard Rotation · INFOCOM 2024 |
Distributed systems › distributed database
distributed transactions |
0.8 | 1 | 2024 | Sharon: Secure and Efficient Cross-shard Transaction Processing via Shard Rotation · INFOCOM 2024 |
Methods — techniques the papers use, named apart from their topics
shard rotation · 1.5polynomial-time optimal algorithm · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Sharon: Secure and Efficient Cross-shard Transaction Processing via Shard RotationabstractRecently, sharding has become a popular direction to scale out blockchain systems by dividing the network into shards that process transactions in parallel. However, secure and efficient cross-shard transaction processing remains a vital and unaddressed challenge. Existing work handles a cross-shard transaction via transaction division: dividing it into sub-transactions, processing them separately, and combing the processing results. Such an approach is unfavorable for decentralized blockchain due to its reliance on trustworthy parties, e.g., the client or a reference node, to perform the transaction division and result combination. Furthermore, the processing result of one transaction can affect another, violating the important property of transaction isolation. In this work, we propose Sharon, a novel sharding protocol that processes cross-shard transactions via shard rotation rather than transaction division. In Sharon, shards rotate to merge pairwisely and process cross-shard transactions when merged. Sharon eliminates reliance on trustworthy parties and provides transaction isolation in nature because transactions are no longer divided. Nevertheless, it poses a scientific question of when and how to merge the shards to improve system performance. To answer the question, we formally define the shard scheduling problem to minimize transaction confirmation latency and propose a novel construction algorithm. The proposed algorithm is proven optimal and runs in polynomial time. We conduct extensive experiments on Amazon EC2 instances using Bitcoin and Ethereum data. The results indicate that Sharon achieves nearly linear scalability, improves the system throughput by 139%, and saves the transaction processing latency by 72.4% compared with state-of-the-art approaches. Shan Jiang 0005, Jiannong Cao 0001, Cheung Leong Tung, Shan Wang 0008 |
INFOCOM | 3 |
| 2019 | Data Management in Supply Chain Using Blockchain: Challenges and a Case StudyabstractSupply chain management (SCM) is fundamental for gaining financial, environmental and social benefits in the supply chain industry. However, traditional SCM mechanisms usually suffer from a wide scope of issues such as lack of information sharing, long delays for data retrieval, and unreliability in product tracing. Recent advances in blockchain technology show great potential to tackle these issues due to its salient features including immutability, transparency, and decentralization. Although there are some proof-of-concept studies and surveys on blockchain-based SCM from the perspective of logistics, the underlying technical challenges are not clearly identified. In this paper, we provide a comprehensive analysis of potential opportunities, new requirements, and principles of designing blockchain-based SCM systems. We summarize and discuss four crucial technical challenges in terms of scalability, throughput, access control, data retrieval and review the promising solutions. Finally, a case study of designing blockchain-based food traceability system is reported to provide more insights on how to tackle these technical challenges in practice. Jiannong Cao 0001, Yanni Yang 0003, Cheung Leong Tung, Shan Jiang 0005, Bin Tang 0002, Yang Liu 0007, Yuming Deng |
ICCCN | 4 |