SecP2PVoD: a secure peer-to-peer video-on-demand system against pollution attack and untrusted service provider

• Published in: Multimedia tools and applications Vol. 79; no. 9-10; pp. 6163 - 6190
• Main Authors: Kumar, Mahender, Chand, Satish
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.03.2020; Springer Nature B.V
• Subjects: Algorithms; Authentication; Bandwidths; Computer Communication Networks; Computer networks; Computer Science; Confidentiality; Data Structures and Information Theory; Data transmission; Digital signatures; Encryption; Multimedia Information Systems; Peer to peer computing; Security; Service introduction; Special Purpose and Application-Based Systems; Video on demand; Video transmission; Video-on-demand streaming; Security; Identity-based signcryption; Peer-to-peer communication; Bandwidth-efficiency
• ISSN: 1380-7501; 1573-7721
• DOI: 10.1007/s11042-019-08330-5

The Peer-to-Peer video-on-demand (P2P-VoD) streaming has become widespread in recent years. Unlike the traditional client-server model based video-streaming, the P2P-VoD leverages the peer’s capacity of upload bandwidth for the delivery of video contents in a distributed network. The P2P environment is susceptible to various security threats, in which the pollution attack is one of the potentially destructive threats. Moreover, video streaming is prone to other security challenges, such as authenticity, confidentiality, authorization, and integrity. There have been discussed four possible protection to the pollution attack: blacklisting, hash verification, traffic encryption, and chunk signing. In this paper, we present escrow-free identity-based signcryption (EF-IDSC) scheme for secure data transmission scheme in P2P-VoD streaming with an untrusted service provider. The proposed system enables a peer to establish a session key with other peer using the asymmetric key algorithm. The security analysis shows that the proposed P2P-VoS system prevents pollution attacks under well-known random oracle model and achieves privacy, confidentiality, and subscriber authentication simultaneously. The experimental evaluation shows that the proposed scheme has better computation and communication costs as compared to the related schemes.