On Propagating Updates in a Byzantine Environment
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit
arxiv.orgrank this link
Refine results · kind
Dahlia
5 indexed results
Papillon: Greedy Routing in Rings
We study {\sc greedy} routing over $n$ nodes placed in a ring, with the \emph{distance} between two nodes defined to
arxiv.orgrank this link
Secure Execution of Java Applets using a Remote Playground
Mobile code presents a number of threats to machines that execute it. We introduce an approach for protecting machines and
arxiv.orgrank this link
Secure Multicast in a WAN
A secure reliable multicast protocol enables a process to send a message to a group of recipients such that all
arxiv.orgrank this link
The Load and Availability of Byzantine Quorum Systems
Replicated services accessed via {\em quorums} enable each access to be performed at only a subset (quorum) of the servers,
arxiv.orgrank this link