Improved Broadcast Encryption Scheme with Constant-Size Ciphertext

Dubois, Renaud; Guillevic, Aurore; Breton, Marine Sengelin Le

doi:10.1007/978-3-642-36334-4_12

Cited by 6 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…the list of revoked or authorized users and the message) plus an overhead whose size is constant (in practice it consists of two points on elliptic curves). A practical implementation is described in [DGB12]. The main weakness of such schemes is that they rely on number-theoretic problems that can be solved in polynomial time using quantum computers.…”

Section: State Of the Art On Broadcast Encryptionmentioning

confidence: 99%

Broadcast Encryption using Sum-Product decomposition of Boolean functions

Dupin,

Abelard

2024

IACR CiC

View full text Add to dashboard Cite

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 1990s, 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 Σ Π 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.

show abstract

Section: State Of the Art On Broadcast Encryptionmentioning

confidence: 99%

Broadcast Encryption using Sum-Product decomposition of Boolean functions

Dupin,

Abelard

2024

IACR CiC

View full text Add to dashboard Cite

show abstract

“…We prove that the q-SMEBDH is weaker than the well-known q bilinear Diffie-Hellman exponent assumption (q-BDHE). The (decisional) q-BDHE problem is stated as follows [5,20,35,36]: given a vector of elements,…”

Section: Computational Complexity Assumptionsmentioning

confidence: 99%

BESTIE: Broadcast Encryption Scheme for Tiny IoT Equipment

Lee

Kim

2020

Electronics

View full text Add to dashboard Cite

In public key broadcast encryption, anyone can securely transmit a message to a group of receivers such that privileged users can decrypt it. The three important parameters of the broadcast encryption scheme are the length of the ciphertext, the size of private/public key, and the performance of encryption/decryption. It is suggested to decrease them as much as possible; however, it turns out that decreasing one increases the other in most schemes. This paper proposes a new broadcast encryption scheme for tiny Internet of Things (IoT) equipment (BESTIE), minimizing the private key size in each user. In the proposed scheme, the private key size is O(logn), the public key size is O(logn), the encryption time per subset is O(logn), the decryption time is O(logn), and the ciphertext text size is O(r), where n denotes the maximum number of users, and r indicates the number of revoked users. The proposed scheme is the first subset difference-based broadcast encryption scheme to reduce the private key size O(logn) without sacrificing the other parameters. We prove that our proposed scheme is secure under q-Simplified Multi-Exponent Bilinear Diffie-Hellman (q-SMEBDH) in the standard model.

show abstract

“…There are two kinds of broadcast encryption, the symmetric key based [1][2][3][4][5] and the public key based [6][7][8][9]. In a symmetric key based broadcast encryption system, only the trusted authority that generates all private keys can act as the broadcaster; ordinary users can only receive and decrypt messages, but cannot send messages.…”

Section: Introductionmentioning

confidence: 99%

Efficient Anonymous Broadcast Encryption with Adaptive Security

Zhou¹,

Lin²,

Zhou³

et al. 2015

KSII TIIS

View full text Add to dashboard Cite

Broadcast encryption is an efficient way to distribute confidential information to a set of receivers using broadcast channel. It allows the broadcaster to dynamically choose the receiver set during each encryption. However, most broadcast encryption schemes in the literature haven't taken into consideration the receiver's privacy protection, and the scanty privacy preserving solutions are often less efficient, which are not suitable for practical scenarios. In this paper, we propose an efficient dynamic anonymous broadcast encryption scheme that has the shortest ciphertext length. The scheme is constructed over the composite order bilinear groups, and adopts the Lagrange interpolation polynomial to hide the receivers' identities, which yields efficient decryption algorithm. Security proofs show that, the proposed scheme is both secure and anonymous under the threat of adaptive adversaries in standard model.

show abstract

Improved Broadcast Encryption Scheme with Constant-Size Ciphertext

Cited by 6 publications

References 14 publications

Broadcast Encryption using Sum-Product decomposition of Boolean functions

Broadcast Encryption using Sum-Product decomposition of Boolean functions

BESTIE: Broadcast Encryption Scheme for Tiny IoT Equipment

Efficient Anonymous Broadcast Encryption with Adaptive Security

Contact Info

Product

Resources

About