Not logged in.
Quick Search - Contribution
Contribution Details
| Type | Master's Thesis |
| Scope | Discipline-based scholarship |
| Title | Decentralized Secure and Incentive-compatible Voting In P2P Networks |
| Organization Unit | |
| Authors |
|
| Supervisors |
|
| Institution | University of Zurich |
| Faculty | Faculty of Economics, Business Administration and Information Technology |
| Date | 2007 |
| Abstract Text | Voting in distributed systems is a thoroughly researched subject within the domain of computer science since more than two decades. Surprisingly, little attention has been paid to the subject of voting during he last years media hype of peer-to-peer (P2P) networks. This is in spite of the fact that voting could be used to implement decentralized decision making, which has many useful applications in self-organizing P2P systems. A voting mechanism for fully decentralized P2P networks needs to be scalable, secure, robust and incentive-compatible. The properties of existing voting mechanisms prevents them from being used in fully decentralized systems, as these mechanisms are either centralized or do not scale. This thesis proposes a fully decentralized voting protocol together with incentives and security mechanisms, for use in a fully decentralized P2P network. In order to fuse the concepts of peer-to-peer networks and voting, elements from several intersecting domains, such as for instance, network security and incentives for cooperation, were closely examined and exploited in this thesis. The design of the decentralized voting mechanism was implemented and integrated in a prototype P2P application. Preliminary experiments with the prototype show that the proposed scheme could be used for decentralized voting in a fully decentralized P2P network. |
| PDF File |
Download
|
| Export |
BibTeX
|