Simple and Efficient Signature-based Consensus Protocol in the Asynchronous Distributed System

2012 ◽  
Vol 41 (2) ◽  
Author(s):  
Chien Fu Cheng ◽  
Kuo Tang Tsai ◽  
Hsien Chun Liao
Keyword(s):  
Distributed System ◽  
Consensus Protocol ◽  
Asynchronous Distributed System

scholarly journals Safe termination detection in an asynchronous distributed system when processes may crash and recover

2009 ◽  
Vol 410 (6-7) ◽  
pp. 614-628
Author(s):  
Neeraj Mittal ◽  
Kuppahalli L. Phaneesh ◽  
Felix C. Freiling
Keyword(s):  
Distributed System ◽  
Termination Detection ◽  
Asynchronous Distributed System

scholarly journals Robust Proof of Stake: A New Consensus Protocol for Sustainable Blockchain Systems

2020 ◽  
Vol 12 (7) ◽  
pp. 2824 ◽  
Author(s):  
Aiya Li ◽  
Xianhua Wei ◽  
Zhou He
Keyword(s):  
Distributed System ◽  
Processing Speed ◽  
Transaction Processing ◽  
Digital Economy ◽  
Three Dimensions ◽  
Consensus Protocol ◽  
Agent Based ◽  
Blockchain Technology ◽  
Maximum Value ◽  
Economy System

In the digital economy era, the development of a distributed robust economy system has become increasingly important. The blockchain technology can be used to build such a system, but current mainstream consensus protocols are vulnerable to attack, making blockchain systems unsustainable. In this paper, we propose a new Robust Proof of Stake (RPoS) consensus protocol, which uses the amount of coins to select miners and limits the maximum value of the coin age to effectively avoid coin age accumulation attack and Nothing-at-Stake (N@S) attack. Under a comparison framework, we show that the RPoS equals or outperforms Proof of Work (PoW) protocol and Proof of Stake (PoS) protocol in three dimensions: energy consumption, robustness, and transaction processing speed. To compare the three consensus protocols in terms of trade efficiency, we built an agent-based model and find that RPoS protocol has greater or similar trade request-satisfied ratio than PoW and PoS. Hence, we suggest that RPoS is very suitable for building a robust digital economy distributed system.

A TIME-FREE ASSUMPTION TO IMPLEMENT EVENTUAL LEADERSHIP

2006 ◽  
Vol 16 (02) ◽  
pp. 189-207 ◽  
Author(s):  
ACHOUR MOSTEFAOUI ◽  
ERIC MOURGAYA ◽  
MICHEL RAYNAL ◽  
CORENTIN TRAVERS
Keyword(s):  
Distributed Systems ◽  
Distributed Computing ◽  
Distributed System ◽  
Probabilistic Analysis ◽  
Asynchronous Systems ◽  
Coordination Problems ◽  
Novel Approach ◽  
Noteworthy Feature ◽  
Asynchronous Distributed System

Leader-based protocols rest on a primitive able to provide the processes with the same unique leader. Such protocols are very common in distributed computing to solve synchronization or coordination problems. Unfortunately, providing such a primitive is far from being trivial in asynchronous distributed systems prone to process crashes. (It is even impossible in fault-prone purely asynchronous systems.) To circumvent this difficulty, several protocols have been proposed that build a leader facility on top of an asynchronous distributed system enriched with synchrony assumptions. This paper introduces a novel approach to implement an eventual leader protocol, namely a time-free behavioral assumption on the flow of messages that are exchanged. It presents a very simple leader protocol based on this assumption. It then presents a second leader protocol combining this timeless assumption with eventually timely channels. As it considers several assumptions, the resulting hybrid protocol has the noteworthy feature to provide an increased overall assumption coverage. A probabilistic analysis shows that the time-free assumption is practically always satisfied.

A survey on secure file synchronization in distributed system

2011 ◽  
Vol 1 (10) ◽  
pp. 81-82
Author(s):  
Chhaya Nayak ◽  
◽  
Deepak Tomar
Keyword(s):  
Distributed System ◽  
File Synchronization
Sign in / Sign up

Export Citation Format

Share Document