Leaker identification in multicast communication

Files
Access Instruction 243.pdf(45.02 KB)
Date
2012
Authors
Mohamed, Emad Eldin
Guerchi, Driss
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Nature Switzerland AG
Abstract
Multicast is a communication mode in which data is exchanged among multiple end systems. An important concern in multicast communications is the protection of copyrights. While preventing copyright violations seems very difficult, tracing copyright violators (leaker identification) is more feasible and can be used as a deterrence alternative. In order to identify leakers in a multicast environment, every receiver should obtain a uniquely marked copy of the data. However, delivering unique copies from the sender to the receivers is inefficient. This paper investigates multicast leaker identification and introduces an efficient solution that is based on binary search tree. We introduce the notion of suspicious set that includes suspected end systems. When a leak is detected, all receivers are inserted in the suspicious set. Using a binary search, the suspicious set is refined successively until it includes only the leakers. An analytical study is conducted to evaluate the proposed solution. © Springer-Verlag Berlin Heidelberg 2012.
Description
This conference paper is not available at CUD collection. The version of scholarly record of this conference paper is published in Communications in Computer and Information Science (2012), available online at: https://doi.org/10.1007/978-3-642-30507-8_27
Keywords
Analytical studies , Binary search , Binary search trees , Communication mode , Copyright protections , End systems , Multicast communication , Tracing traitors , Binary trees , Communication , Copyrights , Multicasting
Citation
Mohamed, E.E., Guerchi, D. (2012). Leaker Identification in Multicast Communication. In: R. Benlamri (Eds) Networked Digital Technologies. NDT 2012. Communications in Computer and Information Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30507-8_27
URI
http://dx.doi.org/10.1007/978-3-642-30507-8_27
 http://hdl.handle.net/20.500.12519/243
DOI
Collections
Department of Computer Engineering and Computational Sciences