Fault-Tolerant Distributed Consensus in Synchronous Networks

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 asynchro...

Mô tả đầy đủ

Đã lưu trong:
Chi tiết về thư mục
Những tác giả chính: Choudhury, Ashish (Tác giả), Patra, Arpita (Tác giả)
Tác giả của công ty: SpringerLink (Online service)
Định dạng: Điện tử eBook
Ngôn ngữ:Tiếng Anh
Được phát hành: Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Phiên bản:1st ed. 2025.
Loạt:Information Security and Cryptography,
Những chủ đề:
Truy cập trực tuyến:https://doi.org/10.1007/978-3-031-80460-1
Các nhãn: Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-80460-1
003 DE-He213
005 20260810155907.0
007 cr nn 008mamaa
008 250325s2025 sz | o |||| 0|eng d
020 |a 9783031804601  |9 978-3-031-80460-1 
024 7 |a 10.1007/978-3-031-80460-1  |2 doi 
050 4 |a QA268 
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 005.824  |2 23 
100 1 |a Choudhury, Ashish.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Fault-Tolerant Distributed Consensus in Synchronous Networks  |h [electronic resource] /  |c by Ashish Choudhury, Arpita Patra. 
250 |a 1st ed. 2025. 
264 1 |a Cham :  |b Springer Nature Switzerland :  |b Imprint: Springer,  |c 2025. 
300 |a 1 online resource (XV, 312 p. 78 illus.).  |b 41 illus. in color. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
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. . 
588 |a Print version record. 
650 0 |a Cryptography. 
650 0 |a Data encryption (Computer science). 
650 0 |a Computer networks . 
650 0 |a Blockchains (Databases). 
650 1 4 |a Cryptology. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Blockchain. 
700 1 |a Patra, Arpita.  |e author.  |0 (orcid)0000-0002-8036-4407  |1 https://orcid.org/0000-0002-8036-4407  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031804595 
776 0 8 |i Printed edition:  |z 9783031804618 
830 0 |a Information Security and Cryptography,  |x 2197-845X 
856 4 0 |u https://doi.org/10.1007/978-3-031-80460-1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-242 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 
950 |a Focus Bundle Data, Security and Privacy (SpringerNature-85412)