[Home ] [Archive]   [ فارسی ]  
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Home::
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Registration::
Site Facilities::
Indexing::
Contact us::
::
Search in website

Advanced Search
..
Receive site information
Enter your Email in the following box to receive the site news and information.
..
Print ISSN
Print ISSN: 2476-3047
..
:: Search published articles ::
Showing 2 results for Consensus

Engineer Jamileh Bahri, Doctor Hamidreza Shayeghbrojeni,
Volume 8, Issue 1 (9-2019)
Abstract

Blockchain technology is a decentralized data structure based on a chain to the ledger of interconnected data blocks. Blockchain stores new blocks in the ledger without having to rely on intermediaries in a competitive or voting mechanism. Due to the chain structure or graph between each block and its previous block, it is impossible to modify blockchain data. Blockchain architecture provides trust in a peer-to-peer network through nodes on the network according to different consensus algorithms. In this article, we intend to describe the mechanism of each consensus-based, voting-based, and distant-oriented graph consensus algorithm.

Alireza Hediehloo, Javad Mohajery, Mohammadreza Aref,
Volume 11, Issue 2 (3-2023)
Abstract

Consensus protocols are used to establish coordination between network nodes and increase the resistance of distributed systems against errors. In this paper, a new synchronous consensus protocol is introduced. The proposed protocol is an improved version of Abraham protocol in which we have used aggregate signature to reduce the communication load. In the Abraham protocol, communication load and calculation load of the protocol are of the order O(n3ss) and O(n3), respectively, while in the proposed protocol, communication load and calculation load are of the order O(mn2 log kt) and O(mn2), respectively, where n is the number of network nodes, ss is the size of a digital signature, kt is the maximum number of protocol iterations, and ma is a security parameter that can be much smaller than n. Therefore, in networks with a large number of nodes, the reduction of communication load and computing load will be noticeable. Also, in this protocol, we need at least n = 2f + 1 nodes to resist f Byzantine node, and the consensus process is done correctly with a probability of at least .


Page 1 from 1     

دوفصل نامه علمی  منادی امنیت فضای تولید و تبادل اطلاعات( افتا) Biannual Journal Monadi for Cyberspace Security (AFTA)
Persian site map - English site map - Created in 0.03 seconds with 28 queries by YEKTAWEB 4710