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.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Otto JS, Sanchez MA, Choffnes DR, Bustamante FE, Siganos G (2011) On blind mice and the elephant. Proceedings of SIGCOMM’11, pp 110–121
Halkes GP, Pouwelse JA (2010) Verifiable encryption for p2p block exchange. Proceedings of IEEE P2P’10, pp 1–4
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
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
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
Craig G (2009) Fully homomorphic encryption using ideal lattices. Proceedings of the 41st annual ACM symposium on theory of computing, pp 169–178
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
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
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
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
Sarjaz BS, Abbaspour M (2013) Securing BitTorrent using a new reputation-based trust management system. Peer-to-Peer Netw Appl 6:86–100
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
Shin K (2009) Preventing misbehavior in cooperative distributed systems. Dissertation, North Carolina State University
This paper is supported by Fostering and Sponsoring Program for Shanghai Young College Teachers (No. egd11009), and SSPU funding (No. QD210004), and Innovation Program of Shanghai Municipal Education Commission (No. 12YZ176).
Rights and permissions
About this article
Cite this article
Wang, J., Hu, X., Xu, X. et al. A verifiable hierarchical circular shift cipher scheme for P2P chunk exchanges. Peer-to-Peer Netw. Appl. 8, 103–110 (2015). https://doi.org/10.1007/s12083-013-0225-3
- P2P networks
- Hierarchial circular shift cipher