Campus Units

Electrical and Computer Engineering

Document Type

Article

Publication Version

Accepted Manuscript

Publication Date

5-24-2006

Journal or Book Title

Multiagent and Grid Systems

Volume

2

Issue

1

First Page

11

Last Page

27

DOI

10.3233/MGS-2006-2102

Abstract

In this paper, a novel protocol for providing both client and server anonymity in peer-to-peer (P2P) based grids is presented. The protocol assumes individual nodes or users to be utility maximizing agents, and relies on an auction mechanism for trading of resources among them. The resources here can refer to data files, storage capacity, or computation power (i.e., CPU cycles) etc. The protocol is inherently anonymous, light-weight, and incentive-compatible. Incentive compatibility implies that the protocol takes into account the selfishness of users; as would be seen the utilities of users are maximized by truthfully following the protocol steps. Moreover, if the protocol is truthfully followed by the users, anonymity to both the clients and servers of all the transactions are guaranteed. Furthermore, unlike other schemes, the proposed protocol does not rely on any trusted centralized entity or require specialized encryptions to be performed by the users. Thus, the protocol incurs very low overhead on the system and is light-weight. In brief, the proposed protocol provides efficient and natural means to provide anonymity in P2P based grids, and is easily deployable in a large un-trusted Internet-scale setting.

Comments

This is a manuscript of an article published as Gupta, Rohit, Souvik Ray, Arun K. Somani, and Zhao Zhang. "Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids." Multiagent and Grid Systems 2, no. 1 (2006): 11-27. The final publication is available at IOS Press through DOI: 10.3233/MGS-2006-2102. Posted with permission.

Copyright Owner

IOS Press

Language

en

File Format

application/pdf

Published Version

Share

COinS