Paper 2024/154
Broadcast Encryption using Sum-Product decomposition of Boolean functions
Abstract
The problem of Broadcast Encryption (BE) consists in broadcasting an encrypted message to a large number of users or receiving devices in such a way that the emitter of the message can control which of the users can or cannot decrypt it. Since the early 1990's, the design of BE schemes has received significant interest and many different concepts were proposed. A major breakthrough was achieved by Naor, Naor and Lotspiech (CRYPTO 2001) by partitioning cleverly the set of authorized users and associating a symmetric key to each subset. Since then, while there have been many advances in public-key based BE schemes, mostly based on bilinear maps, little was made on symmetric cryptography. In this paper, we design a new symmetric-based BE scheme, named $\Sigma\Pi$BE, that relies on logic optimization and consensual security assumptions. It is competitive with the work of Naor et al. and provides a different tradeoff: the bandwidth requirement is significantly lowered at the cost of an increase in the key storage.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- broadcast encryptionBoolean functions
- Contact author(s)
-
dupin aurelien @ gmail com
sabelard @ protonmail com - History
- 2024-02-05: approved
- 2024-02-02: received
- See all versions
- Short URL
- https://ia.cr/2024/154
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/154,
author = {Aurélien Dupin and Simon Abelard},
title = {Broadcast Encryption using Sum-Product decomposition of Boolean functions},
howpublished = {Cryptology ePrint Archive, Paper 2024/154},
year = {2024},
note = {\url{https://eprint.iacr.org/2024/154}},
url = {https://eprint.iacr.org/2024/154}
}
