Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts

@inproceedings{Attrapadung2011ExpressiveKA,
  title={Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts},
  author={Nuttapong Attrapadung and Beno{\^i}t Libert and {\'E}lie de Panafieu},
  booktitle={Public Key Cryptography},
  year={2011}
}
Attribute-based encryption (ABE), as introduced by Sahai and Waters, allows for fine-grained access control on encrypted data. In its key-policy flavor, the primitive enables senders to encrypt messages under a set of attributes and private keys are associated with access structures that specify which ciphertexts the key holder will be allowed to decrypt. In most ABE systems, the ciphertext size grows linearly with the number of ciphertext attributes and the only known exceptions only support… Expand
Attribute-based encryption schemes with constant-size ciphertexts
TLDR
This paper proposes the first attribute-based encryption (ABE) schemes allowing for truly expressive access structures and with constant ciphertext size and describes a new efficient identity-based revocation mechanism that gives rise to the most expressive KP-ABE realization with constant-size ciphertexts. Expand
Fully secure key-policy attribute-based encryption with constant-size ciphertexts and fast decryption
TLDR
This paper presents the first KP-ABE scheme, which has the following features simultaneously: expressive (i.e., supporting arbitrary monotonic access structures); fully secure in the standard model; constant-size ciphertexts and fast decryption. Expand
Private Ciphertext-Policy Attribute-based Encryption Schemes With Constant-Size Ciphertext Supporting CNF Access Policy
TLDR
This paper gives the first private CP-ABE constructions with a constant-size ciphertext, supporting CNF (Conjunctive Normal Form) access policy, with the simple restriction that each attribute can only appear kmax times in the access formula. Expand
Flexible ciphertext-policy attribute-based encryption supporting AND-gate and threshold with short ciphertexts
TLDR
This work aims to address the gap by proposing a CP-ABE which features constant-size ciphertext and supports access policies of an AND-gate and a threshold, which make ciphertext policies more expressive and applicable to many practical applications. Expand
Efficient Ciphertext Policy Attribute-Based Encryption with Constant-Size Ciphertext and Constant Computation-Cost
TLDR
Two new CP-ABE schemes are presented, which have both constant-size ciphertext and constant computation costs for a nonmonotone AND gate access policy, under chosen plaintext and chosen ciphertext attacks and can be proven CPA-secure in standard model under the decision n-BDHE assumption and the existence of collision-resistant hash functions. Expand
Provably Secure Ciphertext-Policy Attribute-Based Encryption from Identity-Based Encryption
TLDR
This paper shows a relation between CP-ABE and identity-based encryption (IBE), and presents a bi-directional conversion between an access structure and identities, and proves the CCA security for confidentiality and anonymity. Expand
Expressive Ciphertext-Policy Attribute-Based Encryption with Fast Decryption
TLDR
This paper proposes a new construction of ciphertext-policy ABE supporting general predicates with a constant number of pairing operations for decryption, and proves that the construction achieves new security notion which it introduces, restricted-selectively payload-hiding security under the q-type decisional bilinear DeiffieHellman assumption. Expand
Homomorphic-Policy Attribute-Based Key Encapsulation Mechanisms
TLDR
This paper defines a new property for ABE, on top of a ciphertext-policy ABE scheme: homomorphic-policy, and designs Attribute-Based Key Encapsulation Mechanisms (ABKEM) with the new Homomorphic-Policy property. Expand
Computationally Efficient Ciphertext-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
TLDR
The proposed CP-ABE scheme is proven selective-secure in the random oracle model under the decision n-Bilinear Diffie-Hellman Exponent (n-BDHE) assumption, where n represents the total number of attributes in universe. Expand
Constant-size ciphertexts in threshold attribute-based encryption without dummy attributes
TLDR
This work improves Herranz etal.s work, and proposes a new threshold ABE scheme which does not use any dummy attribute, which offers two improvements in comparison to the previous work. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 54 REFERENCES
Provably secure ciphertext policy ABE
TLDR
The basic scheme is proven to be chosen plaintext (CPA) secure under the decisional bilinear Diffie-Hellman (DBDH) assumption and the Canetti-Halevi-Katz technique is applied to obtain a chosen ciphertext (CCA) secure extension using one-time signatures. Expand
Constant Size Ciphertexts in Threshold Attribute-Based Encryption
TLDR
This paper proposes the first scheme whose ciphertexts have constant size and works for the threshold case, and can be proven in the standard model by reduction to the augmented multi-sequence of exponents decisional Diffie-Hellman (aMSE-DDH) problem. Expand
Conjunctive Broadcast and Attribute-Based Encryption
TLDR
A new cryptosystem called Broadcast ABE is proposed, used to construct ABE systems with direct revocation mechanism, and appears to be the first fully-functional directly revocable schemes for key-policy and ciphertext-policy. Expand
Bounded Ciphertext Policy Attribute Based Encryption
TLDR
This work presents the first construction of a ciphertext-policy attribute based encryption scheme having a security proof based on a number theoretic assumption and supporting advanced access structures and support access structures which can be represented by a bounded size access tree with threshold gates as its nodes. Expand
Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
  • Brent Waters
  • Mathematics, Computer Science
  • Public Key Cryptography
  • 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
Attribute-based encryption for fine-grained access control of encrypted data
TLDR
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
Ciphertext-Policy Attribute-Based Encryption
TLDR
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
Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
TLDR
The notion of negated spatial encryption is introduced, which subsumes non-zero-mode IPE and can be seen as the revocation analogue of the spatial encryption primitive of Boneh and Hamburg. Expand
Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption
TLDR
This paper exhaustively checks the verifiability of existing ABE schemes and found that most of them satisfy such a property, hence CCA-secure versions of these schemes can be obtained automatically. Expand
A ciphertext-policy attribute-based encryption scheme with constant ciphertext length
TLDR
The number of additional bits required from chosen plain text attack-secure CP-ABE to chosen ciphertext attack- secure CP- ABE is reduced by 90% with respect to that of the previous scheme. Expand
...
1
2
3
4
5
...