检索结果-内蒙古大学图书馆

Tamper-proof multitenant data storage using blockchain

PEER-TO-PEER NETWORKING AND APPLICATIONS 2023年第1期16卷 431-449页

作者： Sharma, Aditi Kaur, Parmeet Jaypee Inst Informat Technol Noida India

Technologies like Internet of Things (IoT), cloud, artificial intelligence, blockchain etc. have become a perceptible part of our lives resulting in the generation of enormous amounts of data. Consequently, the systems used for storage and processing of this data are required to be scalable for handling the huge volumes of data. A shared, multitenant system such as a cloud-based storage-as-a-service provides scalability of storage as well as economics of sharing. However, there is a risk of data tampering when multiple tenants work in a shared environment. The benefits of a multitenant solution can be leveraged only if tenants' data is isolated from each other. Further, prevention of data tampering from malicious tenant nodes is also required. Therefore, the paper proposes the use of a private blockchain for an implementation of a multi-tenant-based storage system. The objective is to develop a scalable system where tenants' data is not at a risk of tampering. The efficacy of the proposed system has been demonstrated with synthetic data of multiple tenants using a Software as a Service (SaaS) healthcare application.

关键词： Multi tenancy distributed database Storage Blockchain Tenants

来源：评论

学校读者我要写书评

暂无评论

Accelerating BFT database with Transaction Reconstruction

Accelerating BFT Database with Transaction Reconstruction

引用

1st International Conference on Smart Energy Systems and Artificial Intelligence (SESAI)

作者： Kida, Aoi Kawashima, Hideyuki Keio Univ Yokohama Kanagawa Japan

ISBN: (纸本)9798350364613;9798350364606

Data stores utilized in modern data-intensive applications are expected to demonstrate rapid read and write capabilities and robust fault tolerance. Byzantine fault-tolerant database (BFT database) can execute transactions concurrently and tolerate arbitrary faults (Byzantine fault). We consider cryptographic and communication processing as performance bottlenecks in the transaction processing of BFT databases. This paper presents a transaction reconstruction method, reconstructing a single transaction from multiple transactions to streamline cryptographic and communication processes. We evaluated the proposed method with Basil (state-of-the-art BFT database) in experiments. In an environment where nodes are geographically centralized, the proposed method demonstrates up to approximately 2.5 times higher throughput and reduces latency by up to about 30% than vanilla Basil. In an environment where nodes are geographically distributed, the proposed method demonstrates up to approximately 50 times higher throughput and reduces latency by up to about 75% than vanilla Basil.

关键词： Byzantine fault tolerance distributed database Transaction processing

来源：评论

学校读者我要写书评

暂无评论

AegisDB: Scalable Blockchain database with Secure Decentralised Load Balancing 29th

AegisDB: Scalable Blockchain Database with Secure Decentrali...

引用

29th Australasian Conference on Information Security and Privacy (ACISP)

作者： Zhao, Jun Yu, Jiangshan Yuan, Xingliang Liu, Joseph K. Monash Univ Melbourne Vic Australia Univ Sydney Sydney NSW Australia Univ Melbourne Melbourne Vic Australia

ISBN: (纸本)9789819751006;9789819751013

Blockchain technology offers unique properties that can benefit traditional distributed database systems, such as decentralization, tamper-proof transaction history, and Byzantine fault tolerance. However, blockchain databases also face challenges, particularly performance limitations due to scalability issues. While existing solutions such as sharding can mitigate scalability issues, they compromise the security benefits inherited from blockchains. In this paper, we investigate a novel method to improve scalability without invalidating the security assumptions of the blockchain. To achieve this, we reintroduce the classical concept of load balancing to blockchain database systems. We present the Verifiable Random Round Robin (V3R) load-balancing algorithm, and propose a blockchain database system, AegisDB, based on this algorithm. In AegisDB, workloads are distributed to the server nodes using V3R, ensuring scalability while preserving a similar level of security guarantees as unsharded blockchains.

关键词： Blockchain distributed database Load Balancing Algorand Verifiable Random Functions

来源：评论

学校读者我要写书评

暂无评论

A quantum blockchain-enabled framework for secure private electronic medical records in Internet of Medical Things

引用

INFORMATION SCIENCES 2022年 612卷 942-958页

作者： Qu, Zhiguo Zhang, Zhexi Zheng, Min Nanjing Univ Informat Sci & Technol Engn Res Ctr Digital Forens Minist Educ Nanjing Peoples R China Hubei Univ Sci & Technol Xianning Peoples R China Beijing Univ Posts & Telecommun State key Lab Networking & Switching Technol Beijing 100876 Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp Sci Nanjing Peoples R China Nanjing Univ Informat Sci & Technol Jiangsu Collaborat Innovat Ctr Atmospher Environm Nanjing Peoples R China

There is a rising need for healthcare as a result of rising public awareness of health issues. Electronic medical records include extremely confidential and sensitive information, and blockchain technology can enable the safe exchange of these records across various med-ical organizations. The current blockchain system is susceptible to quantum computer attacks, nevertheless, as a result of the advent of quantum computers. This research designs a novel distributed quantum electronic medical record system and suggests a new private quantum blockchain network based on security considerations. The blocks in this quantum blockchain's data structure are linked via entangled states. The time stamp is automatically formed by connecting quantum blocks with controlled activities, which lowers the amount of storage space needed. Each block's hash value is recorded using just one qubit. The quantum information processing is detailed in depth in the quantum elec-tronic medical record protocol. Every medical record can be tracked, and the security and privacy of electronic medical records in Internet of Medical Things systems can be guaran-teed. The protocol also ditches the traditional encryption and digital signature algorithms in favor of a quantum authentication system. According to the mathematical analysis, the quantum blockchain network has strong security against attacks from quantum computers since it can withstand External attack, Intercept-Measure-Repeat attack and Entanglement-Measure attack. The quantum circuit diagram for deriving the hash value is provided, along with the correctness and traceability analysis of the quantum block. The comparison between the proposed quantum blockchain model and a few other quan-tum blockchain models is also included.(c) 2022 Elsevier Inc. All rights reserved.

关键词： Blockchain Electronic medical records Quantum cryptography Internet of Medical Things distributed database

来源：评论

学校读者我要写书评

暂无评论

Optimized Data Allocation Method for distributed database Systems

Optimized Data Allocation Method for Distributed Database Sy...

引用

2014年国际计算机科学与软件工程学术会议

作者： Hong-Yong YU De-Shuai WANG Wei ZHANG State Key Laboratory of Software Architecture Neusoft Corporation Neusoft ParkNo.2 Xinxiu StreetHunnan New DistrictShenyang 110179China

distributed database systems are of more importance since Internet-based applications are developing *** Cloud applications and mobile applications require database with better performance and *** to allocate partitioned data to database servers is important to the efficiency of the whole *** paper proposes a heuristic data allocation method to achieve minimizing overall data operation *** results show that the proposed data allocation method can reduce the data operation cost,thus improves the execution efficiency of the application.

关键词： distributed database Data allocation Heuristic algorithm Optimizing algorithm

来源：评论

学校读者我要写书评

暂无评论

FileScale: Fast and Elastic Metadata Management for distributed File Systems 14

FileScale: Fast and Elastic Metadata Management for Distribu...

引用

14th Annual ACM Symposium on Cloud Computing (SoCC)

作者： Liao, Gang Abadi, Daniel J. ByteDance Infrastruct Syst Lab San Jose CA 95050 USA Univ Maryland College Pk MD USA

ISBN: (纸本)9798400703874

File systems that store metadata on a single machine or via a shared-disk abstraction face scalability challenges, especially in contexts demanding the management of billions of files. Recent work has shown that employing shared-nothing, distributed database system (DDBMS) for metadata storage can alleviate these scalability challenges without compromising on high availability guarantees. However, for low-scale deployments - where metadata can fit in memory on a single machine - these DDBMS-based systems typically perform an order of magnitude worse than systems that store metadata in memory on a single machine. This has limited the impact of these distributed database approaches, since they are only currently applicable to file systems of extreme scale. This paper describes FileScale, a three-tier architecture that incorporates a DDBMS as part of a comprehensive approach to file system metadata management. In contrast to previous approaches, FileScale performs comparably to the single-machine architecture at a small scale, while enabling linear scalability as the file system metadata increases1.

关键词： distributed File System Metadata Management Elastic Computing distributed database

来源：评论

学校读者我要写书评

暂无评论

Patho-Genomics Fused database Schema and Optimization for Automatic Pathology Workflow 21

Patho-Genomics Fused Database Schema and Optimization for Au...

引用

IEEE 21st World Symposium on Applied Machine Intelligence and Informatics (SAMI)

作者： Kucarov, Marianna Dimitrova Molnar, Bela Kozlovszky, Miklos Obuda Univ BioTech Doctoral Sch Appl Informat & Appl Math Budapest Hungary 3DHistech Ltd Budapest Hungary Obuda Univ John von Neumann Fac Informat Budapest Hungary

ISBN: (纸本)9798350319866

Complete database design, implementation, optimization as well as testing is obtained in order to collect and fuse all the morphological, morphometrical, genomic metadata during the whole, automatic, digital pathology workflow without any human interaction. The subsequent purpose of the fused database is to evaluate texture based (external) and biochemical (internal) features of tumor, cancer collectively. Hence, finding correlation between them might make us able to predict and make diagnose at an earlier stage.

关键词： Pathology Morphology Genomics Data Fusion distributed database Optimization

来源：评论

学校读者我要写书评

暂无评论

Subscription Management for Beyond 5G and 6G Cellular Networks using Blockchain Technology 19

Subscription Management for Beyond 5G and 6G Cellular Networ...

引用

19th International Conference on Network and Service Management (CNSM) - Network and Service Management in the Era of Generative AI and Digital Twins

作者： Aryal, Nischal Ghaffari, Fariba Bertin, Emmanuel Crespi, Noel Orange Innovat F-14000 Caen France Inst Polytech Paris Telecom SudParis SAMOVAR F-91120 Palaiseau France

ISBN: (纸本)9783903176591

As Mobile Network Operators (MNOs) prepare to interconnect diverse technologies to existing cellular networks, it is critical to assess the capabilities of the network architecture to handle such changes. One key area to consider is the subscription management process, which governs the user's profile management, authentication, and access control. This process operates centrally, which affects users' security, accessibility, and privacy. Additionally, it increases the system's complexity when handling the large volume of messages sent over networks like IoT. In this work, we propose a Blockchain-based subscription management approach for next generation cellular networks to address the challenges in user profile management and the Authentication and Key Agreement (AKA) process. The method uses a hybrid cryptosystem technique to protect the user's privacy. Based on the evaluation, the system can handle the AKA process with fewer messages passing while improving system availability by utilizing distributed network functions and storage. Finally, we highlight some key points to consider when implementing our proposed approach.

关键词： Cellular network Subscription management Profile management AKA procedure distributed database Smart contract Blockchain

来源：评论

学校读者我要写书评

暂无评论

Score-matching representative approach for big data analysis with generalized linear models

引用

ELECTRONIC JOURNAL OF STATISTICS 2022年第1期16卷 592-635页

作者： Li, Keren Yang, Jie Northwestern Univ Dept Stat 2006 Sheridan Rd Evanston IL 60208 USA Univ Illinois Dept Math Stat & Comp Sci 851 S Morgan St Chicago IL 60607 USA

We propose a fast and efficient strategy, called the representative approach, for big data analysis with generalized linear models, especially for distributed data with localization requirements or limited network bandwidth. With a given partition of massive dataset, this approach constructs a representative data point for each data block and fits the target model using the representative dataset. In terms of time complexity, it is as fast as the subsampling approaches in the literature. As for efficiency, its accuracy in estimating parameters given a homogeneous partition is comparable with the divide-and-conquer method. Supported by comprehensive simulation studies and theoretical justifications, we conclude that mean representatives (MR) work fine for linear models or generalized linear models with a flat inverse link function and moderate coefficients of continuous predictors. For general cases, we recommend the proposed score-matching representatives (SMR), which may improve the accuracy of estimators significantly by matching the score function values. As an illustrative application to the Airline on-time performance data, we show that the MR and SMR estimates are as good as the full data estimate when available.

关键词： data regression user data localization distributed database mean representative approach divide and conquer subsampling

来源：评论

学校读者我要写书评

暂无评论

distributed Consistency Beyond Queries 23

Distributed Consistency Beyond Queries

引用

42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of database Systems (PODS)

作者： Baccaert, Tim Ketsman, Bas Vrije Univ Brussel Brussels Belgium

ISBN: (纸本)9798400701276

Programming asynchronous distributed systems is a challenging task in which consistency is often achieved by use of expensive coordination protocols like Paxos and 2PC. The CALM theorem, first conjectured by Hellerstein, is one of the first results to challenge this practice by stating that a problem can have a consistent, coordination-free distributed implementation if (and only if) the problem is monotonic. This result was proven for queries and shown to extend beyond monotonic (yet monotonic-like) queries for data systems having specific knowledge about the partitioning of data over the network. In this article, we extend the latter results in several ways. We consider problems that can be modeled as mappings from distributed instances to distributed instances, enabling insights into a much broader range of problems than queries. Furthermore, our model can express arbitrary system configurations, allowing us to reason about the expressiveness of any particular distributed system and thereby revealing a nuanced gradient of problems with increasing coordination-needs. Finally, we apply our model to a recent question about the expressiveness of coordination-free queries, raised by Hellerstein and Alvaro.

关键词： Relational transducer distributed database coordination consistency computability

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：