Name
Abstract | ||
|---|---|---|
As grid computing scales up in size and diversity, anonymous communications will be desirable, and sometimes vital, for certain applications. However, existing anonymity protocols, when being applied to grid applications, either dramatically degrade system efficiency or cause severe performance bottlenecks. We found that a distributed and highly efficient anonymity protocol can be designed if one considers the existing trust in grids. We have designed such a protocol based on controlled anonymity, which maintains an entity's anonymity against untrustable entities. To our best knowledge, this protocol is the first one of its kind. Using the existing methods from anonymity studies, we quantitatively analyze the degree of anonymity that could be offered by this protocol, and use a simulator to confirm its efficiency advantage over the existing protocols. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/GRID.2004.9 | GRID |
Keywords | Field | DocType |
grid computing,efficiency advantage,existing trust,existing method,efficient anonymity protocol,existing protocol,grid application,controlled anonymity,degrade system efficiency,existing anonymity protocol,anonymity study,protocols | Grid computing,Computer science,Peer to peer computing,Anonymity,Grid,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2256-4 | 1 | 0.36 |
References | Authors | |
16 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Souvik Ray | 1 | 4 | 2.09 |
| Zhao Zhang | 2 | 79 | 7.53 |