Optimal subset-difference broadcast encryption with free riders
Selcuk, A. A.
3673 - 3684
MetadataShow full item record
Ak, M., Kaya, K., & Selçuk, A. A. (2009). Optimal subset-difference broadcast encryption with free riders. Information Sciences, 179(20), 3673-3684.
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/11741
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. (C) 2009 Elsevier Inc. All rights reserved.