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

Blockchain-Enhanced Attribute-Based Encryption Architecture With Feasibility Analysis

IEEE ACCESS 2025年 13卷 57629-57638页

作者： Ferrer-Rojas, Agustin Maharaj, Bodhaswar T. Hlophe, Mduduzi C. Univ Pretoria Dept Elect Elect & Comp Engn ZA-0002 Pretoria South Africa

In today's digital landscape, data security is critical, particularly in the Internet of Things (IoT), where large volumes of sensitive data are exchanged. Traditional encryption methods like RSA and AES face challenges in balancing security and performance, exposing systems to advanced cyber threats. To address these issues, blockchain technology offers decentralized, tamper-resistant data protection that enhances trust and transparency. Attribute-Based Encryption (ABE) schemes have been developed, often combining asymmetric and symmetric encryption for efficiency and security. However, gaps remain in practical deployment due to underexplored network architectures and limited feasibility simulations. This study proposes an end-to-end security architecture integrating ABE with Linear Secret Sharing Scheme (LSSS) access policies and blockchain-based distributed key management. The system's feasibility was evaluated using Network Simulator 3 (NS3) within a simulated IoT network. Results demonstrate a lightweight and scalable solution suitable for constrained environments. Numerical simulations showed consensus times as low as 0.25 seconds for key agreement and 0.7 seconds for message consensus, even in resource-constrained settings. For large networks, consensus times reached as low as 0.75 seconds. The system also achieved an average throughput of 0.3 transactions per second in low-resource environments. These outcomes highlight the system's potential for secure, efficient data transmission in IoT and other distributed systems.

关键词： Internet of Things Security Encryption Blockchains Access control Computer architecture Scalability Elliptic curve cryptography Cryptography Network architecture consensus algorithms NS3 Paxos PBFT Raft

来源：评论

学校读者我要写书评

暂无评论

The Blockchain Trilemma: A Formal Proof of the Inherent Trade-Offs Among Decentralization, Security, and Scalability

引用

APPLIED SCIENCES-BASEL 2025年第1期15卷 19-19页

作者： Mssassi, Souhail Abou El Kalam, Anas Cadi Ayyad Univ Natl Sch Appl Sci Marrakech 40160 Morocco

Blockchain technology has emerged as a transformative force with the potential to disrupt traditional industries by providing decentralized, secure, and transparent systems. However, blockchain systems face a fundamental challenge known as the Blockchain Trilemma, which posits that a blockchain cannot simultaneously achieve optimal levels of decentralization, security, and scalability. This paper addresses the Blockchain Trilemma through rigorous mathematical proof, demonstrating that achieving maximum levels of all three properties concurrently leads to inherent contradictions. By formalizing the definitions of decentralization, security, and scalability, we provide a foundational framework to understand these trade-offs. Our analysis includes a proof by contradiction and computational complexity analysis. This work aims to deepen the understanding of the fundamental limitations of blockchain technology, offering insights for future innovations and helping navigate the inevitable trade-offs.

关键词： Blockchain Trilemma decentralization scalability security computational complexity consensus algorithms blockchain scalability limits distributed systems blockchain security

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Blockchain Security for IoT Technology Services: Survey 5th

Evaluation of Blockchain Security for IoT Technology Service...

引用

5th International Conference on Data Science, Machine Learning and Applications

作者： Hizam, Nuras Naser Saeed Shelar, Madhukar Commerce Management & Comp Sci CMCS Coll Nasik 422013 India

ISBN: (纸本)9789819780334;9789819780310;9789819780303

People are enamoured with the Cryptocurrencies Bitcoin and Ethereum, which have recently gained enormous popularity. The success of various Cryptocurrencies is due to blockchain. Every sector is aware of and using the advantages of blockchain. Because of the daily expansion of the technological revolution, practically everything is now done digitally. As a result, security, the most important factor, is required. Blockchain acts as a super hero by offering a protected conduit for transactions. It is a chain of blocks, as the namewould imply. Digital data is referred to as a block, and the public database is referred to as a chain. It is utilized in supply chains, healthcare, property records, and other areas. The purpose of this paper to expose the implementation of the blockchain in IoT Platforms and provides an in-depth analysis of several categories of consensus protocols implemented in different blockchain systems, as well as the advantages and disadvantages of every algorithm. We additionally present an underlying comparison of several algorithms to help in better comprehend consensus protocol choosing. We elicit the IoT issues being taken into account as well as the specifics of the blockchain-based solutions.

关键词： Cryptocurrencies Bitcoin Ethereum Block chain consensus algorithms IoT

来源：评论

学校读者我要写书评

暂无评论

Majoritarianism and Monoculture (M&M)

引用

DATA & POLICY 2025年 7卷 e101-e108页

作者： Ahmed, Mansoor (Manny) Toliver, Dann R. Nakib, Hazem Danny Univ Cambridge OpenOrigins Ltd Cambridge England Univ Cambridge Dept Comp Sci & Technol Cambridge England Univ Cambridge Ctr Redecentralisat CRDC Dept Comp Sci & Technol Cambridge England

Research in decentralized computing, specifically in consensus algorithms, has focused on providing resistance to an adversary with a minority stake. This has resulted in systems that are majoritarian in the extreme, ignoring valuable lessons learned in law and politics over centuries. In this article, we first detail this phenomenon of majoritarianism and point out how minority protections in the nondigital world have been implemented. We motivate adding minority protections to collaborative systems with examples. We also show how current software deployment models exacerbate majoritarianism, highlighting the problem of monoculture in client software in particular. We conclude by giving some suggestions on how to make decentralized computing less hostile to those in the minority.

关键词： consensus algorithms digital collaboration decentralisation majoritarianism minority rights

来源：评论

学校读者我要写书评

暂无评论

Adaptive Filter algorithms for Accelerated Discrete-Time consensus

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2010年第3期58卷 1049-1058页

作者： Cavalcante, Renato L. G. Mulgrew, Bernard Univ Edinburgh Digital Commun Res Inst Joint Res Inst Signal & Image Proc Edinburgh EH9 3JL Midlothian Scotland

In many distributed systems, the objective is to reach agreement on values acquired by the nodes in a network. A common approach to solve such problems is the iterative, weighted linear combination of those values to which each node has access. Methods to compute appropriate weights have been extensively studied, but the resulting iterative algorithms still require many iterations to provide a fairly good estimate of the consensus value. In this study we show that a good estimate of the consensus value can be obtained with few iterations of conventional consensus algorithms by filtering the output of each node with set-theoretic adaptive filters. We use the adaptive projected subgradient method to derive a set-theoretic filter requiring only local information available to each node and being robust to topology changes and erroneous information about the network. Numerical simulations show the good performance of the proposed method.

关键词： Adaptive filters consensus algorithms distributed estimation

来源：评论

学校读者我要写书评

暂无评论

SWARM: Reimagining scientific workflow management systems in a distributed world

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2025年

作者： Balaprakash, Prasanna Raghavan, Krishnan Cappello, Franck Deelman, Ewa Mandal, Anirban Jin, Hongwei Mahmud, Imtiaz Thareja, Komal Wu, Shixun Zuk, Pawel Kiran, Mariam Chen, Zizhong Di, Sheng Wu, Kesheng Oak Ridge Natl Lab ORNL Comp & Computat Sci Directorate Oak Ridge TN USA Argonne Natl Lab Lemont IL USA Univ Southern Calif Informat Sci Inst 4676 Admiralty WaySuite 1001 Marina Del Rey CA 90292 USA Univ North Carolina Chapel Hill Renaissance Comp Inst Chapel Hill NC USA Lawrence Berkeley Natl Lab Berkeley CA USA Univ Calif Riverside Riverside CA USA

Modern scientific workflows process massive amounts of data from diverse instruments and sensors, leveraging geographically distributed, heterogeneous compute and storage resources-from leadership-class systems to edge devices-connected by high-performance networks. The diversity of resources introduces challenges in harnessing their full potential, with resilience issues arising across applications, system software, networks, storage, and hardware. Today, workflow management systems (WMS) coordinate the execution of computation and data management tasks across target resources. However, WMS's centralized nature makes them vulnerable to faults and scalability issues that may result in failures of entire computational campaigns. This paper introduces a novel agentic framework for workflow management, fully distributing and decentralizing the WMS functions and modeling them as swarm intelligence agents infused with advanced artificial intelligence solutions and traditional distributed computing algorithms that can make coordinated decisions in the presence of failures of the underlying cyberinfrastructure.

关键词： Swarm intelligence agentic AI large language models workflow systems resilience consensus algorithms network overlays

来源：评论

学校读者我要写书评

暂无评论

A High-throughput and Secure Coded Blockchain for IoT

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Taherpour, Amirhossein Wang, Xiaodong Columbia University Electrical Engineering Department United States

We propose a new coded blockchain scheme suitable for the Internet-of-Things (IoT) network. In contrast to existing works for coded blockchains, especially blockchain-of-things, the proposed scheme is more realistic, practical, and secure while achieving high throughput. This is accomplished by: 1) modeling the variety of transactions using a reward model, based on which an optimization problem is solved to select transactions that are more accessible and cheaper computational-wise to be processed together;2) a transaction-based and lightweight consensus algorithm that emphasizes on using the minimum possible number of miners for processing the transactions;and 3) employing the raptor codes with linear-time encoding and decoding which results in requiring lower storage to maintain the blockchain and having a higher throughput. We provide detailed analysis and simulation results on the proposed scheme and compare it with the state-of-the-art coded IoT blockchain schemes including Polyshard and LCB, to show the advantages of our proposed scheme in terms of security, storage, decentralization, and throughput. © 2004-2012 IEEE.

关键词： Blockchain coded blockchain consensus algorithms decentralization throughput Internet of Things (IoT) optimization decentralization rateless codes scalability security storage

来源：评论

学校读者我要写书评

暂无评论

Port-Hamiltonian Dynamics on Graphs: consensus and Coordination Control algorithms

引用

IFAC Proceedings Volumes 2010年第19期43卷 175-178页

作者： A.J. van der Schaft B.M. Maschke Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen PO Box 407 9700 AK the Netherlands Laboratoire d'Automatique et de Genie des Procédés Université Claude Bernard Lyon-1 F-69622 Villeurbanne Cedex France

Directed graphs are shown to be endowed with a canonical Dirac structure, which is used for formulating standard consensus and coordination control algorithms as port-Hamiltonian systems.

关键词： Directed graphs Dirac structure port-Hamiltonian systems Laplacian matrix consensus algorithms coordination control

来源：评论

学校读者我要写书评

暂无评论

Optimal Topology Control and Power Allocation for Minimum Energy Consumption in consensus Networks

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2012年第1期60卷 383-399页

作者： Sardellitti, Stefania Barbarossa, Sergio Swami, Ananthram Univ Roma La Sapienza DIET I-00184 Rome Italy ARL Adelphi MD 20783 USA

consensus algorithms have generated a lot of interest due to their ability to compute globally relevant statistics by only exploiting local communications among sensors. However, when implemented over wireless sensor networks, the inherent iterative nature of consensus algorithms may cause a large energy consumption. Hence, to make consensus algorithms really appealing in sensor networks, it is necessary to minimize the energy necessary to reach a consensus, within a given accuracy. We propose a method to optimize the network topology and the power allocation over each active link in order to minimize the energy consumption. We consider two network models: a deterministic model, where the nodes are located arbitrarily but their positions are known, and a random model, where the network topology is modeled as a random geometric graph (RGG). In the first case, we show how to convert the topology optimization problem, which is inherently combinatorial, into a parametric convex problem, solvable with efficient algorithms. In the second case, we optimize the power transmitted by each node, exploiting the asymptotic distributions of the eigenvalues of the adjacency matrix of an RGG. We further show that the optimal power can be found as the solution of a convex problem. The theoretical findings are corroborated with extensive simulation results.

关键词： consensus algorithms minimum energy consumption random graphs sensor networks topology control

来源：评论

学校读者我要写书评

暂无评论

Self-Triggered consensus for Multi-Agent Systems With Zeno-Free Triggers

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2015年第10期60卷 2779-2784页

作者： Fan, Yuan Liu, Lu Feng, Gang Wang, Yong Anhui Univ Sch Elect Engn & Automat Hefei 230601 Peoples R China City Univ Hong Kong Dept Mech & Biomed Engn Kowloon Hong Kong Peoples R China Univ Sci & Technol China Dept Automat Hefei 230026 Peoples R China

In this technical note, a self-triggered consensus algorithm for multi-agent systems has been proposed. Each agent receives the state information of its neighbors and computes the average state of its neighborhood. Based on this average state the event trigger is designed to determine when the agent updates its control input and transmits the average state to its neighbors. By specifying a strictly positive minimal inter-event time for each agent, Zeno behavior can be avoided. Then by solving quadratic equations related to the event condition, the self-triggered consensus algorithm is developed by directly computing the event time instants with a set of iterative procedures. It has been proved that with the proposed "Zeno-free" algorithm the agent group can achieve consensus asymptotically. Compared with the existing works, the proposed algorithm is simpler in formulation and computation. Moreover, it has been showed that agents need less time to achieve consensus with considerable reduction of the number of triggering events, controller updates and information transmission. As a result, more energy can be saved using the proposed algorithm in practical multi-agent systems.

关键词： consensus algorithms event-triggered control hybrid control systems multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：