Welcome to the resource topic for 2007/127
Title:
CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts
Authors: Vanesa Daza, Javier Herranz, Paz Morillo, Carla Ràfols
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 \O(n). In this paper, we propose new schemes, for both PKI and identity-based scenarios, where the ciphertexts’ length is \O(n-t). The construction uses secret sharing techniques and the Canetti-Halevi-Katz transformation to achieve chosen-ciphertext security. The security of our schemes is formally proved under the Decisional Bilinear Diffie-Hellman (DBDH) Assumption.
ePrint: https://eprint.iacr.org/2007/127
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .