Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys

By Dan Boneh, Craig Gentry, Brent Waters. 2005

1,140 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

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

In Computational Theory and Mathematics

Citations in the corpus

Pinocchio: Nearly Practical Verifiable Computation (2013, neutral): “In terms of security, GGPR [30] show this VC scheme is sound under the d-PKE and q-PDH assumptions (see Appendix A), which are weak versions of assumptions in prior work [21, 35, 36].”
Vector Commitments and Their Applications (2013, methodology): “It is worth noting that all known constructions of cryptographic accumulators (dynamic and universal) secure without random oracles either work over composite order groups and use expensive operations for mapping set elements to prime numbers [2] [8], or they work in prime order groups but rely on r”
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System (2007, background): “introduced that a public key encryption with keyword search can be efficiently applied to a routing service in an email gateway [14] and Park et al.”
Practical Identity-Based Encryption Without Random Oracles (2006, methodology): “decision q-BDHE and decision q-BDHI problems that were used in [6, 10, 4, 20].”
Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage (2014, result): “is similar to the “ ffiffiffi n p -approach” [31].”
Constant-Size Commitments to Polynomials and Their Applications (2010, background): “, [8]) the global system parameters are somewhat large (O(t) in our case).”
Quadratic Span Programs and Succinct NIZKs without PCPs (2013, methodology): “7 Also, the bilinear group version of our q-PDH assumption is very similar to, but weaker than, assumptions that were used to construct hierarchical identity-based encryption and broadcast encryption schemes with short ciphertexts [11, 13].”
Conjunctive Broadcast and Attribute-Based Encryption (2009, methodology): “Each Broadcast Key-Policy ABE scheme is based on state-of-the-art Broadcast Encryption scheme either by Boneh-Gentry-Waters [ 8 ] or Sahai-Waters [22] combined algebraically with Goyal et al. KP-ABE [16].”
Named Data Networking (NDN) Project (2010, background): “broadcast encryption [34, 53, 67, 11] and encryption-based access control schemes [4, 8, 6]) can be adapted to NDN by choosing appropriate naming schemes and data representations for keys.”
Security and Privacy in the Internet of Things (2017, background): “Besides, in the conventional broadcast encryption, all members in the broadcast set need to be notified of the change [42], which incurs a non-negligible communication overhead to support the incremental growth of the number of users.”
Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, methodology): “Analogously to [10], we define semantic security for an IBBE scheme by preventing the attacker from issuing decryption queries.”
NOYB: privacy in online social networks (2008, background): “Particularly of use to NOYB are existing and future broadcast key management algorithms [3], strong underlying ciphers [6], resillient steganographic techniques [11], and distributed store-lookup infrastructures [14], which can be used to implement the external mechanisms that NOYB relies on.”
Hierarchical Identity Based Encryption with Constant Size Ciphertext (2005, methodology): “We note that the BDHE assumption has been used to construct a broadcast encryption system where both ciphertexts and private keys are short [6].”
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts (2011, methodology): “We rely on the DBDHE assumption introduced in [9].”
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.”
Pairing-Based Cryptography at High Security Levels (2005, background): “It should be noted that in certain applications bandwidth can be a reason for using pairing-based systems (see, for example, [5, 6, 8]).”
Attribute-based encryption for fine-grained access control of encrypted data (2006, background): “It is worth mentioning that handling such a situation with the best known broadcast encryption schemes [10, 22] (which”