Abstract
In this paper we propose a mutually anonymous protocol for decentralized Peer-to-Peer (P2P) networks. The protocol is a combination between the Secret-Sharing-Based Mutual Anonymity Protocol (SSMP) and the information slicing technique. The proposed protocol realizes the initiator's and responder's anonymity by using the SSMP in which the complete reply-confirm interaction between responders and initiators is realized using the information slicing algorithm. Employing the concept of secret sharing schemes plays an essential role for the protection of the transmitted information between the initiator and responder, and using the information slicing technique the proposed protocol is churn resilient and can be realized with lower cryptographic cost. Moreover, we evaluate the anonymity in the P2P system from probability point of view. The results show that the proposed mutual anonymity protocol provides higher anonymity than the conventional methods.
Original language | English |
---|---|
Title of host publication | ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications |
Pages | 66-71 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 2010 |
Event | 2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010 - Taichung Duration: 2010 Oct 17 → 2010 Oct 20 |
Other
Other | 2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010 |
---|---|
City | Taichung |
Period | 10/10/17 → 10/10/20 |
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Information Systems