Provably secure ciphertext policy ABE

By Ling Cheung, Calvin C. Newport. Conference on Computer and Communications Security, 2007

916 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/649ae4562681f745d946db5054c9aafe4762507d

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

Attribute-Based Encryption With Verifiable Outsourced Decryption (2013, background): “There are two kinds of ABE schemes: key-policy ABE (KP-ABE) [2]–[7] and ciphertext-policy ABE (CP-ABE) [8], [9], [5], [6].”
Attribute-based encryption with non-monotonic access structures (2007, neutral): “Our main construction follows.”
Secure threshold multi authority attribute based encryption without a central authority (2008, background): “For instance[3], in a secure database of an intelligence agency, one may specify a certain document can be accessed by agents in the counterspy program.”
Security and Privacy in Smart Health: Efficient Policy-Hiding Attribute-Based Access Control (2018, methodology): “[29] proposed another CP-ABE scheme and proved its security in the standard model.”
Securely Outsourcing Attribute-Based Encryption with Checkability (2014, background): “Accordingly, several constructions supporting for any kinds of access structures were provided [8], [9] for practical applications [10], [11].”
A ciphertext-policy attribute-based encryption scheme with constant ciphertext length (2009, methodology): “set of the access structures used in [15, 25].”
Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures (2008, background): “The access structure and the attribute set associated with the secret key used in [11] are as follows.”
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012, background): “…have been several prior constructions of attribute-based encryption which have been shown to be selectively secure in the standard model [31] [19] [13] [30] [18] [36] or proven secure in the generic group model [5] (this is a heuristic model intended to capture an attacker who can only access…”
Bounded Ciphertext Policy Attribute Based Encryption (2008, background): “We note that previous CP-ABE systems could either support only very limited access structures [4] or had a proof of security only in the generic group model [3] (rather than based on a number theoretic assumption).”
Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011, background): “Cheung and Newport[22] provide a direct construction for constructing a policy with a single AND gate under the Bilinear Diffie-Hellman assumption.”
Unbounded HIBE and Attribute-Based Encryption (2011, neutral): “[8,21,27,28,38,39,46]).”
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts (2011, background): “The construction of [18] only handles AND gates while the first expressive construction [5] was only analyzed in the generic group model.”
Decentralizing Attribute-Based Encryption (2011, background): “Since the introduction of Attribute-Based Encryption, several works [8, 30, 44, 29, 23, 54, 21, 22, 37] have proposed different ABE systems and applications.”
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, background): “Selectively secure CP-ABE and KP-ABE systems were constructed in [34,25,18,5,32,24,39].”
KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage (2017, neutral): “Two types of ABE schemes, namely key-policy ABE (KPABE) [3], [4], [5], [6], [7], [8] and ciphertext-policy ABE (CP-ABE) [9], [10], [11], [12], [13], [14], [15] are proposed.”
Data Security and Privacy Protection for Cloud Storage: A Survey (2020, background): “Cheung and Newport [21] presented an improved scheme based on [7], which is proved to be CPA secure and CCA secure under the Decisional Bilinear Difﬁe-Hellman (DBDH) assumption.”