Reinventing BrED: A Practical Construction
Broadcast Encryption (BE) allows a sender to send an encrypted message to multiple receivers. In a typical broadcast encryption scenario, the broadcaster decides the set of users who can decrypt a particular ciphertext (denoted as the privileged set). Gritti et al. (IJIS'16) introduced a new primitive called Broadcast Encryption with Dealership (BrED), where the dealer decides the privileged set. A BrED scheme allows a dealer to buy content from the broadcaster and sell it to users. It provides better flexibility in managing a large user base. To date, quite a few different constructions of BrED schemes have been proposed by the research community. We find that all existing BrED schemes are insecure under the existing security definitions. We demonstrate a concrete attack on all the existing schemes in the purview of the existing security definition. We also find that the security definitions proposed in the state-of-the-art BrED schemes do not capture the real world. We argue about the inadequacy of existing definitions and propose a new security definition that models the real world more closely. Finally, we propose a new BrED construction and prove it to be secure in our newly proposed security model.
Authors
- Sayantan Mukherjee (ORCID: https://orcid.org/0000-0002-1236-8086)
- Avishek Majumder
Institutions
- Indian Institute of Technology Jammu (IN)
- University of Petroleum and Energy Studies (IN)
Publication Details
- Journal
- IACR Communications in Cryptology
- Published
- 2024-10-07
- DOI
- https://doi.org/10.62056/ak5txl86bm
- Primary Topic
- Cryptography and Data Security
- Type
- article
- Field-Weighted Citation Impact
- 0.00