The LSD Broadcast Encryption Scheme

By Dani Halevy, Adi Shamir. Annual International Cryptology Conference, 2002

448 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/20b2dfc63e7ac09cf4b3cfc4c993695fab07d778

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

Citations in the corpus

Revocation and Tracing Schemes for Stateless Receivers (2001, methodology): “Recently, Halevy and Shamir [31] have shown a variant of Subset Difference called LSD (Layered Subset Difference), where each subset Sij from the Subset Difference method is represented as a union of a few other subsets, forming a smaller collections altogether.”
Hierarchical Identity Based Encryption with Constant Size Ciphertext (2005, methodology): “Further improvements have been proposed such as the Layered Subset Diﬀerence (LSD) [16] and the Stratiﬁed Subset Diﬀerence (SSD) [15].”
Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys (2007, background): “A number of systems [14, 9, 8] have been suggested that achieve at best O(r)size ciphertexts and O(logn) private key size.”
Applications of Multilinear Forms to Cryptography (2002, background): “For consistency with the notation in this section we say that the scheme, with the improvement of Halevi-Shamir, has the following parameters: private-key-size = O ( (log t)2 log n ) ; header-size = O ( (log t)2(n− |S”
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”
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys (2005, methodology): “• Applications where we broadcast to large sets, namely sets of size n r for r n. The best systems [NNL01, HS02 , GST04] achieve a broadcast message containing O(r) ciphertexts where each user’s private key is of size O(logn).”
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation (2014, background): “Revocation systems [26,46,50,61,62] can encrypt to N −r users with ciphertext size of O(r).”
Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, unknown): “Many BE systems have been proposed [23, 20, 19, 10, 15].”
SiRiUS: Securing Remote Untrusted Storage (2003, background): “Halevi and Shamir [14] provide a more efficient instantiation of the subset-cover framework that has a transmission size of O(r), and requires only O(lg (N)) keys.”
Public Key Broadcast Encryption for Stateless Receivers (2002, methodology): “[17] (and was recently improved by Halevi and Shamir [12]).”