東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Fault-tolerant distributed consensus...

Choudhury, Ashish.

FindBook

Google Book

Amazon

博客來

Fault-tolerant distributed consensus in synchronous networks

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Fault-tolerant distributed consensus in synchronous networks/ by Ashish Choudhury, Arpita Patra.
作者:	Choudhury, Ashish.
其他作者:	Patra, Arpita.
出版者:	Cham :Springer Nature Switzerland : : 2025.,
面頁冊數:	xv, 312 p. :ill. (some col.), digital ;24 cm.
內容註:	Introduction to fault tolerant distributed consensus -- Preliminaries -- EIG protocol for reliable broadcast -- Efficient consensus protocols -- Domain extension for consensus protocols with perfect security -- Lower Bound on the resilience of Byzantine agreement without any set up -- Byzantine broadcast with a trusted PKI set up -- Domain extension for consensus protocols with cryptographic and statistical security -- Lower bound for the number of rounds for deterministic consensus protocols -- Randomized consensus protocols -- Instantiating common-coin and leader election from scratch -- Lower Bound on the Message Complexity of Consensus/Broadcast.
Contained By:	Springer Nature eBook
標題:	Fault-tolerant computing. -
電子資源:	https://doi.org/10.1007/978-3-031-80460-1
ISBN:	9783031804601

Fault-tolerant distributed consensus in synchronous networks
Choudhury, Ashish.

Fault-tolerant distributed consensus in synchronous networks[electronic resource] /by Ashish Choudhury, Arpita Patra. - Cham :Springer Nature Switzerland :2025. - xv, 312 p. :ill. (some col.), digital ;24 cm. - Information security and cryptography,2197-845X. - Information security and cryptography..

Introduction to fault tolerant distributed consensus -- Preliminaries -- EIG protocol for reliable broadcast -- Efficient consensus protocols -- Domain extension for consensus protocols with perfect security -- Lower Bound on the resilience of Byzantine agreement without any set up -- Byzantine broadcast with a trusted PKI set up -- Domain extension for consensus protocols with cryptographic and statistical security -- Lower bound for the number of rounds for deterministic consensus protocols -- Randomized consensus protocols -- Instantiating common-coin and leader election from scratch -- Lower Bound on the Message Complexity of Consensus/Broadcast.

Since its inception, fault-tolerant distributed consensus has been a widely studied topic in secure distributed computing. Thanks to the advent of blockchain technology, the topic has received renewed interest from the community. Consensus protocols are designed either in the synchronous or asynchronous communication model. The literature in each model is vast and vital enough to demand a separate monograph. Protocols and the techniques for the synchronous communication model often serve as the basis for protocols in the asynchronous model. Therefore, this work specifically focuses only on the synchronous communication model and presents all the seminal possibility and feasibility results in this model since the inception of distributed consensus protocols. Topics and features: Presents protocols both against computationally bounded and computationally unbounded adversaries Provides detailed security proofs for the seminal protocols Offers freely available companion-video lectures for some of the topics Includes pictorial illustrations for a better understanding of the underlying concepts Presents state-of-the-art efficiency improvement techniques for synchronous consensus protocols Assumes no background in cryptography or distributed computing This monograph sets out to provide a comprehensive explanation of all the essential concepts and techniques in the domain of synchronous consensus protocols and to unfold the evolution of this topic from its inception to the present. The monograph is self-contained and can be read by those familiar with discrete mathematics and algorithms. Arpita Patra is an associate professor at the Indian Institute of Science, Bangalore. Ashish Choudhury is an associate professor at the International Institute of Information Technology, Bangalore.

ISBN: 9783031804601

Standard No.: 10.1007/978-3-031-80460-1doiSubjects--Topical Terms:

649213
Fault-tolerant computing.

LC Class. No.: QA76.9.F38

Dewey Class. No.: 004.2

Fault-tolerant distributed consensus in synchronous networks
LDR:03582nmm a2200361 a 4500 001 2408619
003 DE-He213
005 20250325121140.0
006 m d
007 cr nn 008maaau
008 260204s2025 sz s 0 eng d
020 $a 9783031804601 $q (electronic bk.)
020 $a 9783031804595 $q (paper)
024 7 $a 10.1007/978-3-031-80460-1 $2 doi
035 $a 978-3-031-80460-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.F38
072 7 $a GPJ $2 bicssc
072 7 $a URY $2 bicssc
072 7 $a COM083000 $2 bisacsh
072 7 $a GPJ $2 thema
072 7 $a URY $2 thema
082 0 4 $a 004.2 $2 23
090 $a QA76.9.F38 $b C552 2025
100 1 $a Choudhury, Ashish. $3 3781236
245 1 0 $a Fault-tolerant distributed consensus in synchronous networks $h [electronic resource] / $c by Ashish Choudhury, Arpita Patra.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xv, 312 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Information security and cryptography, $x 2197-845X
505 0 $a Introduction to fault tolerant distributed consensus -- Preliminaries -- EIG protocol for reliable broadcast -- Efficient consensus protocols -- Domain extension for consensus protocols with perfect security -- Lower Bound on the resilience of Byzantine agreement without any set up -- Byzantine broadcast with a trusted PKI set up -- Domain extension for consensus protocols with cryptographic and statistical security -- Lower bound for the number of rounds for deterministic consensus protocols -- Randomized consensus protocols -- Instantiating common-coin and leader election from scratch -- Lower Bound on the Message Complexity of Consensus/Broadcast.
520 $a Since its inception, fault-tolerant distributed consensus has been a widely studied topic in secure distributed computing. Thanks to the advent of blockchain technology, the topic has received renewed interest from the community. Consensus protocols are designed either in the synchronous or asynchronous communication model. The literature in each model is vast and vital enough to demand a separate monograph. Protocols and the techniques for the synchronous communication model often serve as the basis for protocols in the asynchronous model. Therefore, this work specifically focuses only on the synchronous communication model and presents all the seminal possibility and feasibility results in this model since the inception of distributed consensus protocols. Topics and features: Presents protocols both against computationally bounded and computationally unbounded adversaries Provides detailed security proofs for the seminal protocols Offers freely available companion-video lectures for some of the topics Includes pictorial illustrations for a better understanding of the underlying concepts Presents state-of-the-art efficiency improvement techniques for synchronous consensus protocols Assumes no background in cryptography or distributed computing This monograph sets out to provide a comprehensive explanation of all the essential concepts and techniques in the domain of synchronous consensus protocols and to unfold the evolution of this topic from its inception to the present. The monograph is self-contained and can be read by those familiar with discrete mathematics and algorithms. Arpita Patra is an associate professor at the Indian Institute of Science, Bangalore. Ashish Choudhury is an associate professor at the International Institute of Information Technology, Bangalore.
650 0 $a Fault-tolerant computing. $3 649213
650 0 $a Electronic data processing $x Distributed processing. $3 548601
650 1 4 $a Cryptology. $3 3382308
650 2 4 $a Computer Communication Networks. $3 775497
650 2 4 $a Blockchain. $3 3591823
700 1 $a Patra, Arpita. $3 3269933
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Information security and cryptography. $3 1620909
856 4 0 $u https://doi.org/10.1007/978-3-031-80460-1
950 $a Computer Science (SpringerNature-11645)