International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Optimal Subset-Difference Broadcast Encryption with Free Riders

Authors:
Murat Ak
Ali Aydin Selcuk
Kamer Kaya
Download:
URL: http://eprint.iacr.org/2008/389
Search ePrint
Search Google
Abstract: 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.
BibTeX
@misc{eprint-2008-18070,
  title={Optimal Subset-Difference Broadcast Encryption with Free Riders},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography / Broadcast encryption, subset difference scheme, free riders},
  url={http://eprint.iacr.org/2008/389},
  note={ kamer@cs.bilkent.edu.tr 14132 received 10 Sep 2008},
  author={Murat Ak and Ali Aydin Selcuk and Kamer Kaya},
  year=2008
}