Revocation and Tracing Schemes for Stateless Receivers

By Dalit Naor, Moni Naor, J. Lotspiech. Annual International Cryptology Conference, 2001

1,278 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/4b85ef5a3b7a9948ca6558fdb3b87bccf5d5bb63

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 Computer Networks and Communications

Citations in the corpus

Provably secure ciphertext policy ABE (2007, background): “solution is broadcast encryption [8, 11, 2], where a sender specifies a set of receivers (or revoked users) during encryption.”
Identity-based encryption with efficient revocation (2008, background): “Efficient revocation is a well-studied problem in the traditional PKI setting, e.g. [19] [22] [1] [21] [20] [12] [13].”
Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys (2007, methodology): “A number of systems [14, 9, 8] have been suggested that achieve at best O(r)size ciphertexts and O(logn) private key size.”
Persona: an online social network with user-defined privacy (2009, background): “To create a new group from a list of known friends, Alice encrypts a newly-generated group key with the public key of each member of the new group.”
The LSD Broadcast Encryption Scheme (2002, methodology): “A major improvement of this idea was the “subset difference” (SD) technique developed in Naor Naor and Lotspiech (NNL[ 6 ]), which is the current state of the art in stateless broadcast schemes.”
Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage (2014, methodology): “This is used in the complete subtree scheme, which is a representative solution to the broadcast encryption problem following the well-known subset-cover framework [33].”
LEAP: efficient security mechanisms for large-scale distributed sensor networks (2003, background): “Recently proposed group rekeying schemes [4, 31, 33, 41, 39] use logical key trees to reduce the complexity of a group rekeying operation from O(N) to O(logN).”
A Scalable, Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags (2005, neutral): “[7].”
LEAP+: Efficient security mechanisms for large-scale distributed sensor networks (2006, background): “Recently proposed group rekeying schemes [4, 31, 33, 41, 39] use logical key trees to reduce the complexity of a group rekeying operation from O(N) to O(logN).”
DAC-MACS: Effective Data Access Control for Multiauthority Cloud Storage Systems (2013, background): “Cryptographic techniques are well applied to access control for remote storage systems [16]–[18].”
Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing (2010, methodology): “The extension version of SiRiUS uses NNL broadcast encryption algorithm [21] to encrypt the FEK of each file instead of encrypting it with each individual user’ public key.”
Conjunctive Broadcast and Attribute-Based Encryption (2009, methodology): “In simpler primitives such as public key infrastructure and IBE, there are many revocation methods proposed in the literature [17,1, 18 ,7,13,6].”
Key Establishment in Large Dynamic Groups Using One-Way Function Trees (2003, methodology): “Concerning their subset-difference method, Lotspiech et al. [37] and Naor et al. [ 42 ] claim to be able to evict r members with an average broadcast length of only 1:25r keys.”
Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, neutral): “Many BE systems have been proposed [23, 20, 19, 10, 15].”
Attribute-Based Access Control with Efficient Revocation in Data Outsourcing Systems (2011, methodology): “They realize revocation by revoking attribute itself using timed rekeying mechanism, which is implemented by setting expiration time on each attribute.”