Peer-to-peer and other decentralized, distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack, a malicious user obtains multiple fake identities and pretends to be multiple, distinct nodes in the system. By controlling a large fraction of the nodes in the system, the malicious user is able to "out vote" the honest users in collaborative tasks such as Byzantine failure defenses. This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks. Our protocol is based on the "social network" among user identities, where an edge between two identities indicates a human-established trust relationship. Malicious users can create many identities but few trust relationships. Thus, there is a disproportionately-small "cut" in the graph between the sybil nodes and the honest nodes. SybilGuard exploits this property to bound the number of identities a malicious user can create. We show the effectiveness of SybilGuard both analytically and experimentally.
Decentralized distributed systems such as peer-to-peer systems are particularly vulnerable to sybil attacks, where a malicious user pretends to have multiple identities (called sybil nodes). Without a trusted central authority, defending against sybil attacks is quite challenging. Among the small number of decentralized approaches, our recent SybilGuard protocol [42] leverages a key insight on social networks to bound the number of sybil nodes accepted. Although its direction is promising, SybilGuard can allow a large number of sybil nodes to be accepted. Furthermore, SybilGuard assumes that social networks are fast mixing, which has never been confirmed in the real world.This paper presents the novel SybilLimit protocol that leverages the same insight as SybilGuard but offers dramatically improved and near-optimal guarantees. The number of sybil nodes accepted is reduced by a factor of Θ( √ n), or around 200 times in our experiments for a million-node system. We further prove that SybilLimit's guarantee is at most a log n factor away from optimal, when considering approaches based on fast-mixing social networks. Finally, based on three large-scale real-world social networks, we provide the first evidence that real-world social networks are indeed fast mixing. This validates the fundamental assumption behind SybilLimit's and SybilGuard's approach.
This paper describes the design and implementation of Egalitarian Paxos (EPaxos), a new distributed consensus algorithm based on Paxos. EPaxos achieves three goals:(1) optimal commit latency in the wide-area when tolerating one and two failures, under realistic conditions; (2) uniform load balancing across all replicas (thus achieving high throughput); and (3) graceful performance degradation when replicas are slow or crash.Egalitarian Paxos is to our knowledge the first protocol to achieve the previously stated goals efficiently-that is, requiring only a simple majority of replicas to be nonfaulty, using a number of messages linear in the number of replicas to choose a command, and committing commands after just one communication round (one round trip) in the common case or after at most two rounds in any case. We prove Egalitarian Paxos's properties theoretically and demonstrate its advantages empirically through an implementation running on Amazon EC2.
Background. Noroviruses are enterically transmitted and are a frequent cause of gastroenteritis, affecting 23 million people annually in the United States. We describe a norovirus outbreak and its control in a tertiary care hospital during February-May 2004.Methods. Patients and health care workers met the case definition if they had new onset of vomiting and/or diarrhea during the outbreak period. Selected stool samples were tested for norovirus RNA. We also determined outbreak costs, including the estimated lost revenue associated with unit closures, sick leave, and cleaning expenses.Results. We identified 355 cases that affected 90 patients and 265 health care workers and that were clustered in the coronary care unit and psychiatry units. Attack rates were 5.3% (7 of 133) for patients and 29.9% (29 of 97) for health care workers in the coronary care unit and 16.7% (39 of 233) for patients and 38.0% (76 of 200) for health care workers in the psychiatry units. Thirteen affected health care workers (4.9%) required emergency department visits or hospitalization. Detected noroviruses had 98%-99% sequence identity with representatives of a new genogroup II.4 variant that emerged during 2002-2004 in the United States (e.g., Farmington Hills and other strains) and Europe. Aggressive infection-control measures, including closure of units and thorough disinfection using sodium hypochlorite, were required to terminate the outbreak. Costs associated with this outbreak were estimated to be $657,644.Conclusions. The significant disruption of patient care and cost of this single nosocomial outbreak support aggressive efforts to prevent transmission of noroviruses in health care settings.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.