Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids

Authors:
Rohit Gupta;Souvik Ray;Arun K. Somani;Zhao Zhang
Affiliations:
Department of Electrical and Computer Engineering, Iowa State University, Ames, IA;Department of Electrical and Computer Engineering, Iowa State University, Ames, IA;Department of Electrical and Computer Engineering, Iowa State University, Ames, IA;Department of Electrical and Computer Engineering, Iowa State University, Ames, IA
Venue:
Multiagent and Grid Systems
Year:
2006

Citing 16
Cited 0

Networks without user observability

Computers and Security
The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Crowds: anonymity for Web transactions

ACM Transactions on Information and System Security (TISSEC)
Consistent, yet anonymous, Web access with LPWA

Communications of the ACM
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
How to Make Personalized Web Browising Simple, Secure, and Anonymous

FC '97 Proceedings of the First International Conference on Financial Cryptography
P5: A Protocol for Scalable Anonymous Communication

SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
An Optimal Strategy for Anonymous Communication Protocols

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Anonymous Connections and Onion Routing

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Information Leak in the Chord Lookup Protocol

P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Publius: a robust, tamper-evident, censorship-resistant web publishing system

SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
Algorithms for selfish agents mechanism design for distributed computation

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Low-cost and reliable mutual anonymity protocols in peer-to-peer networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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.