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

Blockchain Oracles: State-of-the-Art and Research Directions

IEEE ACCESS 2022年 10卷 67551-67572页

作者： Ezzat, Shahinaz Kamal Saleh, Yasmine N. M. Abdel-Hamid, Ayman A. Arab Acad Sci Technol & Maritime Transport Coll Comp & Informat Technol Alexandria 5517220 Egypt Arab Acad Sci Technol & Maritime Transport Coll Management & Technol Alexandria 5517220 Egypt

Blockchain interoperability is an innovative feature of blockchain technology that is rapidly gaining momentum in various fields. The mass adoption of enterprise blockchains has not yet been achieved because blockchain networks act as isolated islands that cannot connect or exchange assets and/or information. In addition, the invocation of smart contracts is restricted only to on-chain executions because of the lack of connectivity between the blockchains. This paper aims to conduct a comprehensive and thorough literature review regarding blockchain interoperability, with special highlight on blockchain Oracles being state-of-the-art. Oracles have shown potential as an emerging technology that has revolutionized the blockchain ecosystem by acting as agents that fetch external information into the blockchain ecosystem. A detailed comparative discussion of different blockchain interoperability techniques is presented, showing the strengths and weaknesses of each technique. Being overlooked in the literature, the shortcomings of these techniques in comparison to Oracles are identified, addressing how Oracles have succeeded in overcoming many of these limitations. In addition, the literature lacks a focus on the latest market solutions adopting blockchain Oracles, and only a few studies have considered them in detail. This gap has been addressed through an in-depth assessment of the latest market solutions adopting Oracles in the past few years. Finally, design issues trying to achieve the best practices of Oracles, future directions, and identified research gaps are highlighted.

关键词： Blockchains Interoperability Smart contracts Peer-to-peer computing Business consensus algorithm Internet of Things Blockchain inter-blockchain interoperability Oracles smart contracts

来源：评论

学校读者我要写书评

暂无评论

Embedding Tamper-Resistant, Publicly Verifiable Random Number Seeds in Permissionless Blockchain Systems

引用

IEEE ACCESS 2022年 10卷 39912-39925页

作者： Bezuidenhout, Riaan Nel, Wynand Maritz, Jacques M. Univ Free State Dept Comp Sci & Informat ZA-9301 Bloemfontein South Africa Univ Free State Dept Engn Sci ZA-9301 Bloemfontein South Africa

Many blockchain processes require pseudo-random numbers. This is especially true of blockchain consensus mechanisms that aim to fairly distribute the opportunity to propose new blocks between the participants in the system. The starting point for these processes is a source of randomness that participants cannot manipulate. This paper proposes two methods for embedding random number seeds in a blockchain data structure to serve as inputs to pseudo-random number generators. Because the output of a pseudo-random number generator depends deterministically on its seed, the properties of the seed are critical to the quality of the eventual pseudo-random number produced. Our protocol, B-Rand, embeds random number seeds that are confidential, tamper-resistant, unpredictable, collision-resistant, and publicly verifiable as part of every transaction. These seeds may then be used by transaction owners to participate in processes in the blockchain system that require pseudo-random numbers. Both the Single Secret and Double Secret B-Rand protocols are highly scalable with low space and computational cost, and the worst case is linear in the number of transactions per block.

关键词： Blockchains Generators consensus algorithm Bitcoin Stakeholders Protocols Peer-to-peer computing B-Rand blockchain consensus algorithm homomorphic encryption pseudo-random number generation random number seeds

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Optimal Energy Management for Smart Grid With Cloud-Edge Computing

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2022年第6期18卷 4029-4038页

作者： Fu, Weiming Wan, Yanni Qin, Jiahu Kang, Yu Li, Li Univ Sci & Technol China Dept Automat Hefei 230027 Peoples R China Hefei Comprehens Natl Sci Ctr Inst Artificial Intelligence Hefei 230088 Peoples R China Univ Sci & Technol China Inst Adv Technol Dept Automat Hefei 230027 Peoples R China Tongji Univ Sch Elect & Informat Engn Dept Control Sci & Engn Shanghai 201804 Peoples R China

Optimal energy management of smart grids requires the information exchange between devices, which may disclose private information to the adversaries and further lead to great losses. To this end, this article considers the privacy-preserving optimal energy management problem for smart grids, which integrates both the power allocation of distributed energy resources on the supply side and the demand response of distributed load demands on the demand side. We first propose a cloud-edge computing structure of the smart grid and model the optimal energy management problem as the maximization problem of social welfare including the supply-side net benefit and the demand-side net utility, while maintaining the supply-demand balance and satisfying the operating constraints. A privacy-preserving average consensus algorithm is then developed, where each node sends the projected states to their neighbors to protect the privacy of the initial state. By applying the privacy-preserving average consensus algorithm, we propose a distributed privacy-preserving optimal energy management algorithm based on the generalized alternating direction method of multipliers. Finally, simulation examples are provided to validate the effectiveness of the proposed algorithms.

关键词： Privacy Smart grids Energy management consensus algorithm Cloud computing Task analysis Renewable energy sources Cloud-edge computing energy management privacy-preserving smart gird social welfare

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Distributed Average consensus in Finite Time using Random Gossip

Privacy-Preserving Distributed Average Consensus in Finite T...

引用

European Control Conference (ECC)

作者： Manitara, Nicolaos E. Rikos, Apostolos, I Hadjicostis, Christoforos N. Univ Cyprus Dept Elect & Comp Engn CY-1678 Nicosia Cyprus Univ Cyprus KIOS Ctr Excelence CY-1678 Nicosia Cyprus KTH Royal Inst Technol Div Decis & Control Syst SE-10044 Stockholm Sweden

ISBN: (数字)9783907144077

ISBN: (纸本)9783907144077

In this paper, we develop and analyze a gossip-based average consensus algorithm that enables all of the components of a distributed system, each with some initial value, to reach (approximate) average consensus on their initial values after executing a finite number of iterations, and without having to reveal to other curious components the specific value they contribute to the average calculation. We consider a fully-connected (undirected) network in which curious components do not interfere in the computation in any other way, but can collaborate arbitrarily and are aware of the privacy-preserving strategy. We characterize precisely conditions on the information exchange that guarantee privacy preservation for a specific node. The protocol also provides a criterion that allows the nodes to determine, in a distributed manner (while running the proposed gossip protocol), when to terminate their operation because approximate average consensus has been reached.

关键词： Privacy Protocols Europe consensus algorithm Information exchange

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Secure and Efficient Federated Learning with Three-phase consensus and Unknown Device Selection 17th

Blockchain-Based Secure and Efficient Federated Learning wit...

引用

17th International Conference on Wireless algorithms, Systems, and Applications (WASA)

作者： Wang, Jianrong Sun, Haoran Xu, Tianyi Tianjin Univ Coll Intelligence & Comp Tianjin Peoples R China Tianjin Univ Tianjin Int Engn Inst Tianjin Peoples R China Tianjin Key Lab Adv Networking TANK Lab Tianjin Peoples R China

ISBN: (纸本)9783031192074;9783031192081

Blockchain-based decentralized federated learning (BCFL) protects data privacy and avoids the single point of failure, which has become a key technology in the Intelligent Internet of Things application. However, the BCFL is still challenged by model attacks from malicious devices. In addition, although the BCFL has many schemes for selecting candidate devices, most of them either assume that devices qualities are known in advance or cannot ensure devices to report information honestly. This will lead to inefficient training in the face of unknown candidate device. To address these issues, we consider two types of model attacks and design "Proof of Model Quality" (PoMQ) to protect the security of BCFL. The PoMQ is a three-phase consensus algorithm, which combines the FedAvg and Multi-Krum algorithms to defend against model update attacks. The PoMQ is also based on the model verification process to resist model aggregation attacks. Moreover, we define the unknown device selection problem as a Combinatorial Multi-Armed Bandit problem (CMAB) to improve the training efficiency, and propose an online learning algorithm based on PoMQ (OLAC) to solve CMAB. Finally, through analysis and extensive experiments, we prove that PoMQ and OLAC can better improve the robustness and training efficiency of BCFL.

关键词： Blockchain Federated learning consensus algorithm Multi-armed bandit

来源：评论

学校读者我要写书评

暂无评论

Computationally Light Privacy Preservation of Matrix-Weighted Average consensus

引用

IEEE Transactions on Control of Network Systems 2025年

作者： Wang, Peng Shao, Haibin Pan, Lulu Yan, Weiwu Li, Ning Shanghai Jiao Tong University Department of Automation Shanghai200240 China

Multi-agent consensus algorithms have emerged as foundational tools across a spectrum of applications and matrix-weighted consensus ones are capable of characterizing cross-dimensional interdependence. Yet, their potential is often shadowed by a pressing concern: the privacy of agents' initial values, which frequently represent sensitive data or proprietary information. A computationally light privacy-preserving mechanism for matrix-weighted average consensus (MAC) algorithms is proposed in response to the concern of agents' privacy. In the mechanism, agents' states are first perturbed and then multiplied by the matrix weights before being sent to their neighbors. Both the perturbation and the matrix weight are neighbor-dependent, i.e., they may be selected to be different for different neighbors, and they can be selected independently to mask the true state of an agent. The proposed mechanism can simultaneously guarantee the privacy of initial values and accurate average consensus. The additional computational burden that an agent bears is only the addition of vectors in the same dimension as its state compared to the original MAC algorithm. Through practical case studies with a peer-to-peer transactive energy system, we demonstrate the tangible implications of safeguarding initial value privacy with the proposed mechanism. © 2014 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Scalable Multilevel and Memetic Signed Graph Clustering∗

Scalable Multilevel and Memetic Signed Graph Clustering∗

引用

2025 SIAM Symposium on algorithm Engineering and Experiments, ALENEX 2025

作者： Hausberger, Felix Faraj, Marcelo Fonseca Schulz, Christian Heidelberg University Instutite of Computer Science Germany

ISBN: (纸本)9798331311995

In this study, we address the complex issue of graph clustering in signed graphs, which are characterized by positive and negative weighted edges representing attraction and repulsion among nodes, respectively. The primary objective is to efficiently partition the graph into clusters, ensuring that nodes within a cluster are closely linked by positive edges while minimizing negative edge connections between them. To tackle this challenge, we first develop a scalable multilevel algorithm based on label propagation and local search. Then we develop a memetic algorithm that incorporates a multilevel strategy. This approach meticulously combines elements of evolutionary algorithms with local refinement techniques, aiming to explore the search space more effectively than repeated executions. Our experimental analysis reveals that our new algorithms significantly outperforms existing state-of-the-art algorithms. Copyright © 2025 by SIAM.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast Approximation algorithms for Euclidean Minimum Weight Perfect Matching 22nd

Fast Approximation Algorithms for Euclidean Minimum Weight ...

引用

22nd International Workshop on Approximation and Online algorithms, WAOA 2024

作者： Hougardy, Stefan Tammemaa, Karolina Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics University of Bonn Bonn Germany

ISBN: (纸本)9783031813955

We study the problem of finding a Euclidean minimum weight perfect matching for n points in the plane. It is known that a deterministic approximation algorithm for this problems must have at least Ω(nlogn) runtime. We propose such an algorithm for the Euclidean minimum weight perfect matching problem with runtime O(nlogn) and show that it has approximation ratio O(n0.2995). This improves the so far best known approximation ratio of n/2. We also develop an O(nlogn) algorithm for the Euclidean minimum weight perfect matching problem in higher dimensions and show it has approximation ratio O(n0.599) in all fixed dimensions. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of Mathematical algorithms in Big Data Analysis Techniques

Application of Mathematical Algorithms in Big Data Analysis ...

引用

作者： Liang, Jing School of Finance and Mathematics Huainan Normal University Anhui Huainan232001 China

Mathematics studies the objective law of reality, analyzes and solves the practical problems by describing the known problems. With the continuous integration of information technology and computer industry, big data analysis technology is becoming more and more important. The application of mathematical algorithm in data analysis can simplify the processing of complex problems. So this article studies the mathematical algorithm deeply. This article applies experimental and comparative methods. Experimental data show that mathematical algorithms can enable learners to form a keen sense of numbers and cultivate their logical thinking, with a correlation of 0.51 and 0.47, respectively. This can play a certain role in big data analysis. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Faster Parallel Exact Density Peaks Clustering 2

Faster Parallel Exact Density Peaks Clustering

引用

2nd SIAM Conference on Applied and Computational Discrete algorithms (ACDA)

作者： Huang, Yihao Yu, Shangdi Shun, Julian Phillips Acad Andover MA 01810 USA MIT CSAIL Cambridge MA USA

ISBN: (纸本)9781611977714

Clustering multidimensional points is a fundamental data mining task, with applications in many fields, such as astronomy, neuroscience, bioinformatics, and computer vision. The goal of clustering algorithms is to group similar objects together. Density-based clustering is a clustering approach that defines clusters as dense regions of points. It has the advantage of being able to detect clusters of arbitrary shapes, rendering it useful in many applications. In this paper, we propose fast parallel algorithms for Density Peaks Clustering (DPC), a popular version of density-based clustering. Existing exact DPC algorithms suffer from low parallelism both in theory and in practice, which limits their application to large-scale data sets. Our most performant algorithm, which is based on priority search kd-trees, achieves O(log n log log n) span (parallel time complexity) for a data set of n points. Our algorithm is also work-efficient, achieving a work complexity matching the best existing sequential exact DPC algorithm. In addition, we present another DPC algorithm based on a Fenwick tree that makes fewer assumptions for its average-case complexity to hold. We provide optimized implementations of our algorithms and evaluate their performance via extensive experiments. On a 30-core machine with two-way hyperthreading, we find that our best algorithm achieves a 10.8-13169x speedup over the previous best parallel exact DPC algorithm. Compared to the state-of-the-art parallel approximate DPC algorithm, our best algorithm achieves a 1.5-4206x speedup, while being exact.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：