NDLI: Optimistic Byzantine agreement

Content Provider	IEEE Xplore Digital Library
Author	Kursawe, K.
Copyright Year	2002
Description	Author affiliation: IBM Zurich Res. Lab., Ruschlikon, Switzerland (Kursawe, K.)
Abstract	The paper considers the Byzantine agreement problem in a fully asynchronous network, where some participants may be actively malicious. This is an important building block for fault-tolerant applications in a hostile environment, and a non-trivial problem: An early result by Fischer et al. (1985) shows that there is no deterministic solution in a fully asynchronous network subject to even a single crash failure. The paper introduces an optimistic protocol that combines the two best known techniques to solve agreement, randomization and timing. The timing information is used only to increase performance; safety and liveness of the protocol are guaranteed independently of timing. Under certain "normal" conditions, the protocol decides quickly and deterministically without using public-key cryptography, approximately as fast as a timed protocol subject to crash failures does. Otherwise, a randomized fallback protocol ensures safety and liveness. For this, we present an optimized version of the randomized Byzantine agreement protocol of Cachin et al. (2000), which is computationally less expensive and not only tolerates malicious parties, but also some loss of messages; it might therefore be of independent interest.
Sponsorship	IEEE Comput. Soc. Tech. Committee on Distributed Process. IEEE Comput. Soc. Tech. Committee on Fault-Tolerant Comput. IFIP WG 10.4 on Dependable Comput. & Fault Tolerance IEICE Dependable Comput. Tech. Group Graduate School of Inf. Sci. & Technol., Osaka Univ
Starting Page	262
Ending Page	267
File Size	448231
Page Count	6
File Format	PDF
ISBN	0769516599
ISSN	10609857
DOI	10.1109/RELDIS.2002.1180196
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-10-13
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Cryptographic protocols Computer crashes Timing Detectors Safety Cryptography Laboratories Fault tolerance Robustness Uncertainty
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computer Networks and Communications Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Asynchronous Byzantine group communication

ByzID: Byzantine Fault Tolerance from Intrusion Detection

Securing Passive Replication through Verification

When You Don't Trust Clients: Byzantine Proposer Fast Paxos

Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems

Evaluating Byzantine Quorum Systems

Byzantine Fault-Tolerant Publish/Subscribe: A Cloud Computing Infrastructure

RBFT: Redundant Byzantine Fault Tolerance

Consensus with Unknown Participants in Shared Memory

Optimistic Byzantine agreement

Similar Documents

Asynchronous Byzantine group communication

ByzID: Byzantine Fault Tolerance from Intrusion Detection

Securing Passive Replication through Verification

When You Don't Trust Clients: Byzantine Proposer Fast Paxos

Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems

Evaluating Byzantine Quorum Systems

Byzantine Fault-Tolerant Publish/Subscribe: A Cloud Computing Infrastructure

RBFT: Redundant Byzantine Fault Tolerance

Consensus with Unknown Participants in Shared Memory

Optimistic Byzantine agreement