Paper 2008/389 Original: eprint.iacr.org/2008/389 ↗
Optimal Subset-Difference Broadcast Encryption with Free Riders
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2008-09-15: last updated
- 2008-09-15: published
- Short URL
- https://ia.cr/2008/389
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/389,
author = {Murat Ak and Kamer Kaya and Ali Aydin Selcuk},
title = {Optimal Subset-Difference Broadcast Encryption with Free Riders},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/389},
year = {2008},
url = {https://eprint.iacr.org/2008/389}
}