Skip to main content
Top

Hint

Swipe to navigate through the articles of this issue

Published in: Peer-to-Peer Networking and Applications 1/2015

01-01-2015

A verifiable hierarchical circular shift cipher scheme for P2P chunk exchanges

Authors: Jian Wang, Xiaoming Hu, Xiaolin Xu, Yinchun Yang

Published in: Peer-to-Peer Networking and Applications | Issue 1/2015

Login to get access
share
SHARE

Abstract

BitTorrent swarms rely on reciprocative chunk exchanges among autonomously participating peers. It has been shown that BitTorrent native tit-for-tat mechanism cannot effectively discourage the peer strategic misbehavior such as free-riding and fake chunk attack. This paper proposes a hierarchical chunk cipher scheme based only on bits circular shifting manipulation. As such, encrypted chunks preserve a fraction of information entropy of original chunks that can be observed by the receiving peers directly, which is used for assuring authenticity of the encrypted chunks. Our hierarchical bits shifting scheme allows more flexibility on the fraction of information entropy exposed directly by the encrypted chunks, when compared to the single layer bits shifting scheme. Further, exact mathematical results between the hierarchical scheme and the single layer scheme are derived and analyzed in detail.
Literature
1.
go back to reference Otto JS, Sanchez MA, Choffnes DR, Bustamante FE, Siganos G (2011) On blind mice and the elephant. Proceedings of SIGCOMM’11, pp 110–121 Otto JS, Sanchez MA, Choffnes DR, Bustamante FE, Siganos G (2011) On blind mice and the elephant. Proceedings of SIGCOMM’11, pp 110–121
2.
go back to reference Halkes GP, Pouwelse JA (2010) Verifiable encryption for p2p block exchange. Proceedings of IEEE P2P’10, pp 1–4 Halkes GP, Pouwelse JA (2010) Verifiable encryption for p2p block exchange. Proceedings of IEEE P2P’10, pp 1–4
3.
go back to reference Levin D, LaCurts K, Spring N, Bhattacharjee B (2008) Bittorrent is an auction: analyzing and improving bittorrent’s incentives. SIGCOMM Comput Commun Rev 38(4):243–254 CrossRef Levin D, LaCurts K, Spring N, Bhattacharjee B (2008) Bittorrent is an auction: analyzing and improving bittorrent’s incentives. SIGCOMM Comput Commun Rev 38(4):243–254 CrossRef
4.
go back to reference Shin K, Reeves DS, Rhee I (2009) Treat-before-trick: free-riding prevention for bittorrent-like peer-to-peer networks. Proceedings of 23rd IEEE international parallel and distributed processing symposium, pp 1–12 Shin K, Reeves DS, Rhee I (2009) Treat-before-trick: free-riding prevention for bittorrent-like peer-to-peer networks. Proceedings of 23rd IEEE international parallel and distributed processing symposium, pp 1–12
5.
go back to reference Wang J, Shen R, Ullrich C, Luo H, Niu C (2010) Resisting free-riding behavior in bittorrent. Futur Gener Comput Syst 26(8):1285–1299 CrossRef Wang J, Shen R, Ullrich C, Luo H, Niu C (2010) Resisting free-riding behavior in bittorrent. Futur Gener Comput Syst 26(8):1285–1299 CrossRef
6.
go back to reference Craig G (2009) Fully homomorphic encryption using ideal lattices. Proceedings of the 41st annual ACM symposium on theory of computing, pp 169–178 Craig G (2009) Fully homomorphic encryption using ideal lattices. Proceedings of the 41st annual ACM symposium on theory of computing, pp 169–178
7.
go back to reference Sirivianos M, Park JH, Yang X, Jarecki S (2007) Dandelion: cooperative content distribution with robust incentives. Proceedings of the USENIX annual technical conference, pp 157–170 Sirivianos M, Park JH, Yang X, Jarecki S (2007) Dandelion: cooperative content distribution with robust incentives. Proceedings of the USENIX annual technical conference, pp 157–170
8.
go back to reference Jia AL, Rahman R, Vinkó T, Pouwelse JA, Epema DHJ (2011) Fast download but eternal seeding: the reward and punishment of sharing ratio enforcement. Proceedings of IEEE P2P’11, pp 280–289 Jia AL, Rahman R, Vinkó T, Pouwelse JA, Epema DHJ (2011) Fast download but eternal seeding: the reward and punishment of sharing ratio enforcement. Proceedings of IEEE P2P’11, pp 280–289
9.
go back to reference Zohar A, Rosenschein JS (2009) Adding incentives to file-sharing systems. Proceedings of the 8th international conference on autonomous agents and multiagent systems, pp 859–866 Zohar A, Rosenschein JS (2009) Adding incentives to file-sharing systems. Proceedings of the 8th international conference on autonomous agents and multiagent systems, pp 859–866
10.
go back to reference Feldman M, Lai K, Stoica I, Chuang J (2004) Robust incentive techniques for peer-to-peer networks. Proceedings of the 5th ACM conference on electronic commerce, pp 102–111 Feldman M, Lai K, Stoica I, Chuang J (2004) Robust incentive techniques for peer-to-peer networks. Proceedings of the 5th ACM conference on electronic commerce, pp 102–111
11.
go back to reference Sarjaz BS, Abbaspour M (2013) Securing BitTorrent using a new reputation-based trust management system. Peer-to-Peer Netw Appl 6:86–100 CrossRef Sarjaz BS, Abbaspour M (2013) Securing BitTorrent using a new reputation-based trust management system. Peer-to-Peer Netw Appl 6:86–100 CrossRef
12.
go back to reference Landa R, Griffin D, Clegg RG, Mykoniati E, Rio M (2009) A sybilproof indirect reciprocity mechanism for peer-to-peer networks. Proceedings of 28th IEEE INFOCOM, pp 343–351 Landa R, Griffin D, Clegg RG, Mykoniati E, Rio M (2009) A sybilproof indirect reciprocity mechanism for peer-to-peer networks. Proceedings of 28th IEEE INFOCOM, pp 343–351
13.
go back to reference Shin K (2009) Preventing misbehavior in cooperative distributed systems. Dissertation, North Carolina State University Shin K (2009) Preventing misbehavior in cooperative distributed systems. Dissertation, North Carolina State University
Metadata
Title
A verifiable hierarchical circular shift cipher scheme for P2P chunk exchanges
Authors
Jian Wang
Xiaoming Hu
Xiaolin Xu
Yinchun Yang
Publication date
01-01-2015
Publisher
Springer US
Published in
Peer-to-Peer Networking and Applications / Issue 1/2015
Print ISSN: 1936-6442
Electronic ISSN: 1936-6450
DOI
https://doi.org/10.1007/s12083-013-0225-3

Other articles of this Issue 1/2015

Peer-to-Peer Networking and Applications 1/2015 Go to the issue

Premium Partner