Loading...
Loading...

Go to the content (press return)

CCA2-secure threshold broadcast encryption with shorter ciphertexts

Author
Daza, V.; Herranz, J.; Morillo, M.; Rafols, C.
Type of activity
Journal article
Journal
Lecture notes in computer science
Date of publication
2007-10
Volume
4784
First page
35
Last page
50
DOI
https://doi.org/10.1007/978-3-540-75670-5_3 Open in new window
URL
https://link.springer.com/chapter/10.1007/978-3-540-75670-5_3 Open in new window
Abstract
In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. Previously proposed threshold broadcast encryption schemes have ciphertexts whose length is at least n+O(1)n+O(1) . In this paper, we propose new schemes, for both PKI and identity-based scenarios, where the ciphert...
Group of research
MAK - Mathematics Applied to Cryptography

Participants