Secure reliable multicast protocols in a WAN |
| |
Authors: | Dahlia Malkhi Michael Merritt Ohad Rodeh |
| |
Affiliation: | (1) AT&T Shannon Labs, 180 Park Avenue, Room A267, Florham Park, NJ 07932-0971, USA (e-mail: {dalia,mischu}@research.att.com), US;(2) The Hebrew University of Jerusalem, Jerusalem, Israel (e-mail: orodeh@cs.huji.ac.il), IL |
| |
Abstract: | Summary. A secure reliable multicast protocol enables a process to send a message to a group of recipients such that all correct destinations receive the same message, despite the malicious efforts of fewer than a third of the total number of processes, including the sender. This has been shown to be a useful tool in building secure distributed services, albeit with a cost that typically grows linearly with the size of the system. For very large networks, for which this is prohibitive, we present two approaches for reducing the cost: First, we show a protocol whose cost is on the order of the number of tolerated failures. Secondly, we show how relaxing the consistency requirement to a probabilistic guarantee can reduce the associated cost, effectively to a constant. Received: August 1997 / Accepted: July 1999 |
| |
Keywords: | :Secure multicast – Probabilistic algorithms – Wide area network |
本文献已被 SpringerLink 等数据库收录! |
|