| |
2 results where author includes Arnold L. Rosenberg.
- @inproceedings{Bissias:2007,
Author = {
George Bissias and
Brian Neil Levine and
Arnold L. Rosenberg},
Booktitle = {Proc. ACM SIGMETRICS},
Keywords = {security; routing},
Month = {{June}},
Pages = {367---368},
Poster_Url = {http://forensics.umass.edu/pubs/bissias.sigmetrics.abstract.2007.pdf},
Sponsors = {CNS-0133055, ANI-0325868},
Title = {{Bounding Damage From Link Destruction with Application to the Internet (extended abstract)}},
Url = {http://forensics.umass.edu/pubs/bissias.sigmetrics.abstract.2007.pdf},
Year = {2007}}
[link][PDF]
- @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]
| | |