| |
7 results where year includes 2005.
- @inproceedings{Yurkewych:2005,
Abstract = {We present a game-theoretic model of the interactions between server and clients in a constrained family of commercial P2P computations (where clients are financially compensated for work). We study the cost of implementing redundant task allocation (redundancy, for short) as a means of preventing cheating. Under the assumption that clients are motivated solely by the desire to maximize expected profit, we prove that, within this framework, redundancy is cost effective only when collusion among clients, including the Sybil attack, can be prevented. We show that in situations where this condition cannot be met, non-redundant task allocation is much less costly than redundancy.},
Author = {Yurkewych, Matthew and Levine, Brian Neil and Rosenberg, Arnold L.},
Booktitle = {Proc. ACM Conference on Computer and Communications Security (CCS)},
Keywords = {security; peer-to-peer; Sybil attack; Synthesis project},
Month = {November},
Pages = {280--288},
Sponsors = {NSF-0133055},
Title = {{On the Cost-Ineffectiveness of Redundancy in Commercial P2P Computing}},
Url = {http://forensics.umass.edu/pubs/yurkewych.ccs.2005.pdf},
Year = {2005}}
[link][PDF]
- @inproceedings{Fast:2005,
Author = {Fast, Andrew and Jensen, David and Levine, Brian Neil},
Booktitle = {Proc. ACM Intl. Conf. on Knowledge Discovery in Data Mining (KDD)},
Keywords = {peer-to-peer},
Month = {August},
Pages = {568--573},
Title = {{Creating Social Networks to Improve Peer-to-Peer Networking}},
Url = {http://forensics.umass.edu/pubs/fast-et-al-kdd2005.pdf},
Year = {2005}}
[link][PDF]
- @inproceedings{St.-John:2005,
Abstract = {We present Ghost, a peer-to-peer game architecture that manages game consistency across a set of players with heterogeneous network resources. Ghost dynamically creates responsive sub-games based on the delay profiles of players. Ghost allows each user to set the quality of game they are willing to play and creates the maximum-sized game that satisfies the users' requirements. Ghost extends our earlier Asynchronous Synchronization (AS) protocol, which provides cheat-free playout for peer-to-peer games. This modification to AS enables p2p games to efficiently function in network environments that would typically be hostile to multiplayer networked games. These include networks with highly variable delays and variable route partitions. Our evaluation shows that Ghost performs well, always ensuring consistent p2p play with the maximum number of players, while preventing any one player from destroying the quality of play for others.},
Author = {{St. John}, Aaron and Levine, Brian Neil},
Booktitle = {Proc. ACM Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV)},
Keywords = {peer-to-peer; gaming},
Month = {June},
Pages = {1--6},
Sponsors = {NSF-0133055 and NSF-0323597 and NSF-0080199},
Title = {{Supporting P2P Gaming When Players Have Heterogeneous Resources}},
Url = {http://forensics.umass.edu/pubs/stjohn.nossdav.2005.pdf},
Year = {2005}}
[link][PDF]
- @inproceedings{Bissias:2005,
Abstract = {Encrypting traffic does not prevent an attacker from performing some types of traffic analysis. We present a straightforward traffic analysis attack against encrypted HTTP streams that is surprisingly effective in identifying the source of the traffic. An attacker starts by creating a profile of the statistical characteristics of web requests from interesting sites, including distributions of packet sizes and inter-arrival times. Later, candidate encrypted streams are compared against these profiles. In our evaluations using real traffic, we find that many web sites are sub ject to this attack. With a training period of 24 hours and a 1 hour delay afterwards, the attack achieves only 23% accuracy. However, an attacker can easily pre-determine which of trained sites are easily identifiable. Accordingly, against 25 such sites, the attack achieves 40% accuracy; with three guesses, the attack achieves 100% accuracy for our data. Longer delays after training decrease accuracy, but not substantially. We also propose some countermeasures and improvements to our current method. Previous work analyzed SSL traffic to a proxy, taking advantage of a known flaw in SSL that reveals the length of each web object. In contrast, we exploit the statistical characteristics of web streams that are encrypted as a single flow, which is the case with WEP/WPA, IPsec, and SSH tunnels.},
Author = {Bissias, George and Liberatore, Marc and Jensen, David and Levine, Brian Neil},
Booktitle = {Proc. Privacy Enhancing Technologies Workshop (PET)},
Keywords = {security; anonymity; privacy},
Month = {May},
Pages = {1--11},
Sponsors = {NSF-0133055 and NSF-0325868 and NSF-0080199},
Title = {{Privacy Vulnerabilities in Encrypted HTTP Streams}},
Traces_Url = {http://traces.cs.umass.edu},
Url = {http://forensics.umass.edu/pubs/bissias.liberatore.pet.2005.pdf},
Year = {2005}}
[link][PDF]
- @techreport{Zhou:2005,
Author = {Zhou, Yun and Levine, Brian Neil and Croft, W. Bruce},
Institution = {University of Massachusetts Amherst},
Keywords = {DTN; information retrieval; DOME},
Month = {March},
Number = {IR-412},
Pdf_Url = {http://maroo.cs.umass.edu/pub/web/getpdf.php?id=556},
Title = {{Distributed Information Retrieval For Disruption-Tolerant Mobile Networks}},
Type = {CIIR Technical Report},
Year = {2005}}
[link]
- @article{Sanzgiri:2005,
Abstract = {Initial work in ad hoc routing has considered only the problem of providing efficient mechanisms for finding paths in very dynamic networks, without considering security. Because of this, there are a number of attacks that can be used to manipulate the routing in an ad hoc network. In this paper, we describe these threats, specifically showing their effects on AODV and DSR. Our protocol, named Authenticated Routing for Ad hoc Networks (ARAN), uses public-key cryptographic mechanisms to defeat all identified attacks. We detail how ARAN can secure routing in environments where nodes are authorized to participate but untrusted to cooperate, as well as environments where participants do not need to be authorized to participate. Through both simulation and experimentation with our publicly-available implementation, we characterize and evaluate ARAN and show that it is able to effectively and efficiently discover secure routes within an ad hoc network.},
Author = {Sanzgiri, Kimaya and Dahill, Bridget and LaFlamme, Daniel and Levine, Brian Neil and Shields, Clay and Belding-Royer, Elizabeth},
Journal = {IEEE/ACM Journal of Selected Areas in Communications: Special issue on Wireless Ad hoc Networks (JSAC)},
Keywords = {wireless; security; routing; Journal Paper},
Month = {March},
Number = {3},
Pages = {598--610},
Sponsors = {NSF-522564 and NSF-0080199 and 2000-DT-CX-K001},
Title = {{Authenticated Routing for Ad hoc Networks}},
Url = {http://forensics.umass.edu/pubs/aran_jsac05.pdf},
Volume = {23},
Year = {2005}}
[link][PDF]
- @inproceedings{Burns:2005,
Abstract = {Disruption-Tolerant networks (DTNs) differ from other types of networks in that capacity is exclusively created by the movements of participants. This implies that understanding and influencing the participants' motions can have a significant impact on network performance. In this paper, we introduce the routing protocol MV, which learns structure in the movement patterns of network participants and uses it to enable informed message passing. We also propose the introduction of autonomous agents as additional participants in DTNs. These agents adapt their movements in response to variations in network capacity and demand. We use multi-objective control methods from robotics to generate motions capable of optimizing multiple network performance metrics simultaneously. We present experimental evidence that these strategies, individually and in conjunction, result in significant performance improvements in DTNs.},
Author = {Burns, Brendan and Brock, Oliver and Levine, Brian Neil},
Booktitle = {Proc. IEEE INFOCOM},
Keywords = {routing; DTN;wireless; Synthesis project; DOME},
Month = {March},
Pages = {398--408},
Sponsors = {NSF-0133055 and NSF-0080199},
Title = {{\emph{MV} Routing and Capacity Building in Disruption Tolerant Networks}},
Url = {http://forensics.umass.edu/pubs/bburns.infocom.2005.pdf},
Year = {2005}}
[link][PDF]
| | |