PSO based Blockchain Committee Member Selection

Date

2021-01-01

Author

Jameel, Marwan
Yayla, Oğuz

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

112
views

0
downloads

© 2021 IEEEImplementing blockchain systems with less amount of decentralized computation power is a challenging task. One of the most essential solution in scaling the blockchain is selection of a trusted committee (TC). We intend to develop and apply a new method for selecting committee members depending on their reputation via particle swarm optimization (PSO) based update of the behavior of nodes. Indeed, this is the same concept as accumulating participants in the blockchain throughout the previous rounds of the consensus procedure.

Subject Keywords

Blockchain, Byzantine Fault Tolerance (BFT), Consensus protocol, Machine learning, Particle swarm optimization, Scalability

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85125864019&origin=inward
https://hdl.handle.net/11511/98812

DOI

https://doi.org/10.1109/ubmk52708.2021.9559004

Conference Name

6th International Conference on Computer Science and Engineering, UBMK 2021

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Topology-Aware Cooperative Data Protection in Blockchain-Based Decentralized Storage Networks Yang, Siyi; Hareedy, Ahmed; Calderbank, Robert; Dolecek, Lara (2020-06-01) The continuous rise of the blockchain technology is moving various information systems towards decentralization. Blockchain-based decentralized storage networks (DSNs) offer significantly higher privacy and lower costs to customers compared with centralized cloud storage associated with specific vendors. Coding is required to retrieve data stored on failing components. While coding solutions for centralized storage have been intensely studied, those for DSNs have not yet been discussed. In this paper, we pr...
Vulnerability Detection on Solidity Smart Contracts by Using Convolutional Neural Networks BEKTAŞ, Barış Cem; Acar, Aybar Can; Acar, Aybar Can; Department of Cybersecurity (2023-2-01) Smart contracts, which are self executing contracts with the terms of the agreement between buyer and seller being directly written into lines of code, have the potential to revolutionize many industries by automating complex processes and reducing the need for intermediaries. However, the immutability of smart contracts also means that vulnerabilities cannot be easily fixed once they are deployed, making it crucial to detect and prevent vulnerabilities before deployment. In this project, we focus on the pr...
Nonlinear Decentralized Data Fusion with Generalized Inverse Covariance Intersection Noack, Benjamin; Orguner, Umut; Hanebeck, Uwe D. (2019-01-01) Decentralized data fusion is a challenging task even for linear estimation problems. Nonlinear estimation renders data fusion even more difficult as dependencies among the nonlinear estimates require complicated parameterizations. It is nearly impossible to reconstruct or keep track of dependencies. Therefore, conservative approaches have become a popular solution to nonlinear data fusion. As a generalization of Covariance Intersection, exponential mixture densities have been widely applied for nonlinear fu...
Decentralized secure multiparty computation Taşcı, Buse; Cenk, Murat; Department of Cryptography (2019) Advances in blockchain technology have led to new applications that aim to eliminate central systems, to improve transparency and user control in transactions whiledealing with the privacy and security challenges. In this thesis, a system which enables users to control their private data and to share chosen data to other parties usingsecure computation techniques is reviewed. Then, we present a blockchain-based digital identity system depending on this architecture. This system ensures that identity informa...
Quantum safe digital signatures from symmetric key primitives Erbaş, Şeyma; Cenk, Murat; Department of Cryptography (2019) When powerful quantum computers are built, they will break most of the public key cryptography schemes due to Shor’s quantum algorithm. Therefore, public key cryptography algorithm schemes that is secure against classical and quantum computers are needed. In this thesis, we study Picnic algorithm, a post-quantum digital signature scheme. Picnic digital signature algorithm has the security of symmetric-key primitives that is considered to be secure against quantum attacks. In Picnic algorithm, zero knowledge...

Citation Formats

M. Jameel and O. Yayla, “PSO based Blockchain Committee Member Selection,” presented at the 6th International Conference on Computer Science and Engineering, UBMK 2021, Ankara, Türkiye, 2021, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85125864019&origin=inward.