Towards Merkle Trees for High-Performance Data Systems
PROCEEDINGS OF 1ST WORKSHOP ON VERIFIABLE DATABASE SYSTEMS, VDBS 2023(2023)
摘要
Merkle Trees (and its variants) are widely used for building secure outsourced data systems. The adoption of Merkle Trees for high-performance data systems, however, uncovered major performance challenges. First and unlike classical data structures, Merkle Trees involve expensive cryptographic operations and are thus CPU-bound. Second, they are not well suited for modern multi-core CPUs because they introduce a single point of contention making Merkle Trees hard to parallelize. While recent work aimed at replacing Merkle Trees to circumvent their performance problem, we suggest new techniques to speed-up this ubiquitous data structure and achieve high-performance. In this paper, we present initial results showing that in contrast to common wisdom it is indeed possible to build high-performance Merkle Trees with orders of magnitude performance improvements.
更多查看译文
关键词
Outsourced Databases,Verifiable Databases,Merkle Trees,Concurrency
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要