Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6462
Title: Simulating Authenticated Broadcasts to Derive Simple Fault-Tolerant Algorithms
Authors: Srikanth, T. K.
Toueg, Sam
Keywords: computer science
technical report
Issue Date: Jul-1984
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-623
Abstract: Fault-tolerant algorithms for distributed systems are simpler to develop and prove correct if messages can be authenticated. However, using digital signatures for message authentication usually incurs substantial overhead in communication and computation. To exploit the simplicity provided by authentication without this overhead, we present a broadcast primitive that simulates properties of authenticated broadcasts. This gives a methodology for deriving non-authenticated algorithm. We have applied this approach to various problems and in each case obtained simpler and more efficient solutions than those previously known.
URI: http://hdl.handle.net/1813/6462
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
84-623.pdf2.19 MBAdobe PDFView/Open
84-623.ps416.61 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us