Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
By Cécile Delerablée, Pascal Paillier, David Pointcheval. Pairing-Based Cryptography, 2007
321 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/4c53bca5c92f3ce36b55616f9bdbd14266c4dfa8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Cécile Delerablée
- Mark Zhandry
- Dan Boneh
- Boyang Wang
- Jingbo Yan
- Yuqing Zhang
- Xuefeng Liu
- Brent Waters
In Computational Theory and Mathematics
- Cécile Delerablée
- Mark Zhandry
- Dan Boneh
- Jingbo Yan
- Yuqing Zhang
- Xuefeng Liu
- Boyang Wang
- Brent Waters
Citations in the corpus
- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, methodology): “Many BE systems have been proposed [23, 20, 19, 10, 15].”
- Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud (2013, methodology): “Comparison on computation cost for file generation between Mona and ODBE [14].”
- Functional Encryption: Definitions and Challenges (2011, unknown): “Examples of these include combinations of: Attribute-Based Encryption and Broadcast Encryption [AI09], Identity-Based Broadcast Encryption [Del07, DPP07 , SF07, GW09], broadcast HIBE [BH08], and Inner-Product Encryption and ABE [OT10].”
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation (2014, background): “Some systems such as [6,11,25,30,67] achieve a fixed size header that depends only on the security parameter and is independent of the size of the recipient set S.”