Proceedings of the 1st Workshop on Verifiable Database Systems最新文献

筛选
英文 中文
BBSF: Blockchain Benchmarking Standardized Framework BBSF:区块链基准标准化框架
Proceedings of the 1st Workshop on Verifiable Database Systems Pub Date : 2023-06-23 DOI: 10.1145/3595647.3595649
Kunpeng Ren, Jefferson F.B. Van Buskirk, Zheng Yong Ang, Shizheng Hou, Nathaniel R. Cable, Miguel Monares, H. F. Korth, Dumitrel Loghin
{"title":"BBSF: Blockchain Benchmarking Standardized Framework","authors":"Kunpeng Ren, Jefferson F.B. Van Buskirk, Zheng Yong Ang, Shizheng Hou, Nathaniel R. Cable, Miguel Monares, H. F. Korth, Dumitrel Loghin","doi":"10.1145/3595647.3595649","DOIUrl":"https://doi.org/10.1145/3595647.3595649","url":null,"abstract":"In this paper, we propose the Blockchain Benchmark Standardized Format (BBSF), a framework for standardized, transparent, and fair benchmarks for blockchains. BBSF enables users and developers to compare blockchain platforms using metrics derived from realistic workloads. We outline the challenges in developing a blockchain benchmark with this degree of breadth and flexibility. We contrast the results using our approach with prior benchmark implementations and show why BBSF generates results that are more verifiable than prior published benchmarking data. We present an implementation of our framework, called Blockbench v3, which is a benchmarking system focusing on Web3 applications and workloads, primarily to be used by layer-1 blockchains. Blockbench v3 serves as a test case for our framework’s effectiveness as part of ongoing work in the characterization of blockchain performance.","PeriodicalId":218306,"journal":{"name":"Proceedings of the 1st Workshop on Verifiable Database Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128712900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Scaling Zero-Knowledge to Verifiable Databases 将零知识扩展到可验证数据库
Proceedings of the 1st Workshop on Verifiable Database Systems Pub Date : 2023-06-23 DOI: 10.1145/3595647.3595648
Tal Derei, Benjamin Aulenbach, Victor Carolino, Caleb Geren, Michael Kaufman, Jonathan Klein, Rishad Islam Shanto, H. F. Korth
{"title":"Scaling Zero-Knowledge to Verifiable Databases","authors":"Tal Derei, Benjamin Aulenbach, Victor Carolino, Caleb Geren, Michael Kaufman, Jonathan Klein, Rishad Islam Shanto, H. F. Korth","doi":"10.1145/3595647.3595648","DOIUrl":"https://doi.org/10.1145/3595647.3595648","url":null,"abstract":"Zero-Knowledge proofs are a cryptographic technique to reveal knowledge of information without revealing the information itself, thus enabling systems optimally to mix privacy and transparency, and, where needed, regulatability. Application domains include health and other enterprise data, financial systems such as central-bank digital currencies, and performance enhancement in blockchain systems. The challenge of zero-knowledge proofs is that, although they are computationally easy to verify, they are computationally hard to produce. This paper examines the scalability limits of leading zero-knowledge algorithms and addresses the use of parallel architectures to meet performance demands of applications.","PeriodicalId":218306,"journal":{"name":"Proceedings of the 1st Workshop on Verifiable Database Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115075043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Baldur: A Hybrid Blockchain Database with FPGA or GPU Acceleration Baldur:一个带有FPGA或GPU加速的混合区块链数据库
Proceedings of the 1st Workshop on Verifiable Database Systems Pub Date : 2023-06-23 DOI: 10.1145/3595647.3595650
R. Ifrim, Dumitrel Loghin, D. Popescu
{"title":"Baldur: A Hybrid Blockchain Database with FPGA or GPU Acceleration","authors":"R. Ifrim, Dumitrel Loghin, D. Popescu","doi":"10.1145/3595647.3595650","DOIUrl":"https://doi.org/10.1145/3595647.3595650","url":null,"abstract":"In the last decade, blockchain technologies have entered the enterprise space in the form of permissioned blockchains, verifiable databases, and hybrid blockchain database systems (HBDB). The core of these blockchain technologies is represented by cryptography operations such as secure hashing typically with SHA-3 algorithms, signature generation, and signature verification, typically done with an Elliptic Curve Digital Signature Algorithm (ECDSA). These cryptography operations incur significant overhead and often they can be done in parallel with other operations such as data fetching and processing. Moreover, these operations can be offloaded to a hardware accelerator. In this paper, starting from the above observations, we present Baldur, an HBDB system in which most of the cryptography operations are offloaded to an accelerator. Specifically, we offload to either a Field Programmable Gate Array (FPGA) or a Graphics Processing Unit (GPU) the Keccak SHA-3 hashing and secp256k1 ECDSA signature verification for the requests received by Baldur from users. We present our preliminary implementation and results for an AMD-Xilinx Varium C1100 FPGA and an Nvidia RTX A6000 GPU. In stand-alone mode, our secp256k1 FPGA implementation achieves a throughput of 12,000 verifications per second, which is 11 × higher compared to the original implementation from AMD-Xilinx. Our GPU implementation achieves a throughput of close to 60,000 verifications per second, which is 25% higher compared to the CPU. When integrated into Baldur, the FPGA and GPU improve the throughput by 12% and 7%, respectively, in the best case. These results are promising but they can be improved, and, hence we plan to further optimize our FPGA and GPU designs and implementations in the future.","PeriodicalId":218306,"journal":{"name":"Proceedings of the 1st Workshop on Verifiable Database Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131662458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards Merkle Trees for High-Performance Data Systems 面向高性能数据系统的默克尔树
Proceedings of the 1st Workshop on Verifiable Database Systems Pub Date : 2023-06-23 DOI: 10.1145/3595647.3595651
Muhammad El-Hindi, Tobias Ziegler, Carsten Binnig
{"title":"Towards Merkle Trees for High-Performance Data Systems","authors":"Muhammad El-Hindi, Tobias Ziegler, Carsten Binnig","doi":"10.1145/3595647.3595651","DOIUrl":"https://doi.org/10.1145/3595647.3595651","url":null,"abstract":"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.","PeriodicalId":218306,"journal":{"name":"Proceedings of the 1st Workshop on Verifiable Database Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132483512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Proceedings of the 1st Workshop on Verifiable Database Systems 第一届可验证数据库系统研讨会论文集
Proceedings of the 1st Workshop on Verifiable Database Systems Pub Date : 1900-01-01 DOI: 10.1145/3595647
{"title":"Proceedings of the 1st Workshop on Verifiable Database Systems","authors":"","doi":"10.1145/3595647","DOIUrl":"https://doi.org/10.1145/3595647","url":null,"abstract":"","PeriodicalId":218306,"journal":{"name":"Proceedings of the 1st Workshop on Verifiable Database Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128481873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信