Optimal subset-difference broadcast encryption with free riders

Creative Commons License

AK M., Kaya K., Seicuk A. A.

INFORMATION SCIENCES, cilt.179, sa.20, ss.3673-3684, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 179 Sayı: 20
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1016/j.ins.2009.05.025
  • Dergi Adı: INFORMATION SCIENCES
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.3673-3684
  • Anahtar Kelimeler: Broadcast encryption, Digital rights management, Group key management, Subset-difference scheme, Free riders, SCHEMES, REVOCATION, KEYS
  • Akdeniz Üniversitesi Adresli: Hayır

Özet

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.