• Publications
  • Influence
Ciphertext-Policy Attribute-Based Encryption
A system for realizing complex access control on encrypted data that is conceptually closer to traditional access control methods such as role-based access control (RBAC) and secure against collusion attacks is presented. Expand
Fuzzy Identity-Based Encryption
Two constructions of Fuzzy IBE schemes can be viewed as an Identity-Based Encryption of a message under several attributes that compose a (fuzzy) identity and are both error-tolerant and secure against collusion attacks. Expand
Attribute-based encryption for fine-grained access control of encrypted data
This work develops a new cryptosystem for fine-grained sharing of encrypted data that is compatible with Hierarchical Identity-Based Encryption (HIBE), and demonstrates the applicability of the construction to sharing of audit-log information and broadcast encryption. Expand
Efficient Identity-Based Encryption Without Random Oracles
This work first presents their IBE construction and reduces the security of the scheme to the decisional Bilinear Diffie-Hellman (BDH) problem, and shows that their techniques can be used to build a new signature scheme that is secure under the computational Diffie -Hellman assumption without random oracles. Expand
Compact Proofs of Retrievability
The first proof-of-retrievability schemes with full proofs of security against arbitrary adversaries in the strongest model, that of Juels and Kaliski, are given. Expand
Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
  • Brent Waters
  • Mathematics, Computer Science
  • Public Key Cryptography
  • 6 March 2011
We present a new methodology for realizing Ciphertext-Policy Attribute Encryption (CP-ABE) under concrete and noninteractive cryptographic assumptions in the standard model. Our solutions allow anyExpand
Decentralizing Attribute-Based Encryption
This work creates new techniques to tie key components together and prevent collusion attacks between users with different global identifiers and proves security under similar static assumptions to the LW paper in the random oracle model. Expand
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
A scheme for predicates corresponding to the evaluation of inner products over ℤN (for some large integer N) is constructed, which enables constructions in which predicates correspond to the Evaluation of disjunctions, polynomials, CNF/DNF formulas, thresholds, and more. Expand
Conjunctive, Subset, and Range Queries on Encrypted Data
This work constructs public-key systems that support comparison queries on encrypted data as well as more general queries such as subset queries (x∈ S) and supports arbitrary conjunctive queries without leaking information on individual conjuncts. Expand
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Two new public key broadcast encryption systems for stateless receivers are described that are fully secure against any number of colluders and provide a tradeoff between ciphertext size and public key size. Expand