Please use this identifier to cite or link to this item: http://dlib.scu.ac.ir/handle/Hannan/164335
Title: Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts
Authors: Qianhong Wu;Bo Qin;Lei Zhang;Josep Domingo-Ferrer;Oriol Farràs;Jesús A. Manjón
subject: group key agreement;contributory broadcast encryption;provable security;Broadcast encryption
Year: 2016
Publisher: IEEE
Abstract: Broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key, but a sender cannot exclude any particular member from decrypting the ciphertexts. In this paper, we bridge these two notions with a hybrid primitive referred to as contributory broadcast encryption (ConBE). In this new primitive, a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice. Following this model, we propose a ConBE scheme with short ciphertexts. The scheme is proven to be fully collusion-resistant under the decision n-Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. Of independent interest, we present a new BE scheme that is aggregatable. The aggregatability property is shown to be useful to construct advanced protocols.
Description: 
URI: http://localhost/handle/Hannan/164335
ISSN: 0018-9340
volume: 65
issue: 2
More Information: 466
479
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7079389.pdf1.24 MBAdobe PDFThumbnail
Preview File
Title: Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts
Authors: Qianhong Wu;Bo Qin;Lei Zhang;Josep Domingo-Ferrer;Oriol Farràs;Jesús A. Manjón
subject: group key agreement;contributory broadcast encryption;provable security;Broadcast encryption
Year: 2016
Publisher: IEEE
Abstract: Broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key, but a sender cannot exclude any particular member from decrypting the ciphertexts. In this paper, we bridge these two notions with a hybrid primitive referred to as contributory broadcast encryption (ConBE). In this new primitive, a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice. Following this model, we propose a ConBE scheme with short ciphertexts. The scheme is proven to be fully collusion-resistant under the decision n-Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. Of independent interest, we present a new BE scheme that is aggregatable. The aggregatability property is shown to be useful to construct advanced protocols.
Description: 
URI: http://localhost/handle/Hannan/164335
ISSN: 0018-9340
volume: 65
issue: 2
More Information: 466
479
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7079389.pdf1.24 MBAdobe PDFThumbnail
Preview File
Title: Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts
Authors: Qianhong Wu;Bo Qin;Lei Zhang;Josep Domingo-Ferrer;Oriol Farràs;Jesús A. Manjón
subject: group key agreement;contributory broadcast encryption;provable security;Broadcast encryption
Year: 2016
Publisher: IEEE
Abstract: Broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key, but a sender cannot exclude any particular member from decrypting the ciphertexts. In this paper, we bridge these two notions with a hybrid primitive referred to as contributory broadcast encryption (ConBE). In this new primitive, a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice. Following this model, we propose a ConBE scheme with short ciphertexts. The scheme is proven to be fully collusion-resistant under the decision n-Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. Of independent interest, we present a new BE scheme that is aggregatable. The aggregatability property is shown to be useful to construct advanced protocols.
Description: 
URI: http://localhost/handle/Hannan/164335
ISSN: 0018-9340
volume: 65
issue: 2
More Information: 466
479
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7079389.pdf1.24 MBAdobe PDFThumbnail
Preview File