Optimal subset-difference broadcast encryption with free riders

Authors:
Murat Ak;Kamer Kaya;Ali Aydın Selçuk
Affiliations:
Department of Computer Engineering, Bilkent University, Ankara 06800, Turkey;Department of Computer Engineering, Bilkent University, Ankara 06800, Turkey;Department of Computer Engineering, Bilkent University, Ankara 06800, Turkey
Venue:
Information Sciences: an International Journal
Year:
2009

Citing 15
Cited 2

Broadcast encryption

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Secure group communications using key graphs

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Unconditional secure conference key distribution schemes with disenrollment capability

Information Sciences—Informatics and Computer Science: An International Journal
Key management for restricted multicast using broadcast encryption

IEEE/ACM Transactions on Networking (TON)
A platform-neutral live IP/TV presentation system

Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Interactive virtual environments and distance education
Protecting Digital Content within the Home

Computer
Broadcast Encryption's Bright Future

Computer
The LSD Broadcast Encryption Scheme

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Fast Digital Identity Revocation (Extended Abstract)

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks

Information Sciences: an International Journal
All-in-one group-oriented cryptosystem based on bilinear pairing

Information Sciences: an International Journal
Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts

Electronic Notes in Theoretical Computer Science (ENTCS)
Public key broadcast encryption with low number of keys and constant decryption time

PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Collusion resistant broadcast encryption with short ciphertexts and private keys

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Fast algorithms for the free riders problem in broadcast encryption

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Efficient broadcast encryption with user profiles

Information Sciences: an International Journal
Key updating technique in identity-based encryption

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

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.