Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes

A process commits a Byzantine failure when its behavior does not comply with the algorithm it is assumed to execute. Considering asynchronous message-passing systems, this paper presents distributed abstractions, and associated algorithms, that allow non-faulty processes to correctly cooperate, desp...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 27; no. 4; pp. 1085 - 1098
Main Authors:	Mostefaoui, Achour, Raynal, Michel
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.04.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Subjects:	Abstraction level Agreement Algorithm design and analysis Algorithms Asynchronous message-passing system Broadcast abstraction Broadcasting Byzantine process Coins Common coin Computational modeling Computer crashes Computer Science Consensus Distributed algorithm Distributed algorithms Distributed computing Distributed, Parallel, and Cluster Computing Failure Faulttolerance Intrusion-tolerance Message validation Reduction Reliability Reliable broadcast Security Signature-free algorithm Transaction processing Uncertainty common coin agreement broadcast abstraction fault-tolerance byzantine process intrusion-tolerance Abstraction level consensus distributed algorithm reliable broadcast message validation asynchronous message-passing system signature-free algorithm Message validation Intrusion-tolerance Signature-free algorithm Consensus Agreement Common coin Asynchronous message-passing system Distributed algorithm Byzantine process Broadcast abstrac-tion Fault-tolerance Reliable broadcast
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!