کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
395909 | 666091 | 2009 | 12 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Optimal subset-difference broadcast encryption with free riders Optimal subset-difference broadcast encryption with free riders](/preview/png/395909.png)
Broadcast encryption (BE) deals with secure transmission of a message to a group of receivers such that only an authorized subset of receivers can decrypt the message. The transmission cost of a BE system can be reduced considerably if a limited number of free riders can be tolerated in the system. In this paper, we study the problem of how to optimally place a given number of free riders in a subset-difference (SD)-based BE system, which is currently the most efficient BE scheme in use and has also been incorporated in standards, and we propose a polynomial-time optimal placement algorithm and three more efficient heuristics for this problem. Simulation experiments show that SD-based BE schemes can benefit significantly from the proposed algorithms.
Journal: Information Sciences - Volume 179, Issue 20, 29 September 2009, Pages 3673–3684