Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Attribute-based encryption for fine-grained access control of encrypted data
Proceedings of the 13th ACM conference on Computer and communications security
Ciphertext-Policy Attribute-Based Encryption
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Provably secure ciphertext policy ABE
Proceedings of the 14th ACM conference on Computer and communications security
Bounded Ciphertext Policy Attribute Based Encryption
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Dynamic Threshold Public-Key Encryption
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Secure Threshold Multi Authority Attribute Based Encryption without a Central Authority
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Distributed Attribute-Based Encryption
Information Security and Cryptology --- ICISC 2008
A Ciphertext-Policy Attribute-Based Encryption Scheme with Constant Ciphertext Length
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Multi-authority attribute based encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Conjunctive, subset, and range queries on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Predicate encryption supporting disjunctions, polynomial equations, and inner products
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Attribute-based broadcast encryption scheme made efficient
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Attribute-based encryption with partially hidden encryptor-specified access structures
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Extensions of access structures and their cryptographic applications
Applicable Algebra in Engineering, Communication and Computing
Fully secure cipertext-policy hiding CP-ABE
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
ProvSec'11 Proceedings of the 5th international conference on Provable security
Fuzzy identity-based encryption
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Constant size ciphertexts in threshold attribute-based encryption
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
In Cipher text Policy Attribute Based Encryption (CP-ABE) scheme, a user is able to decrypt the cipher text only if the pre-specified access structure (also called ciphertext policy) in the ciphertext, matches the attributes defined in the secret key. However, the limitation of the scheme is that the receiver's anonymity is sacrificed as the access structure of the ciphertext reveals the same. The obvious solution to this problem as proposed by proposed by Nishide et al, is to hide ciphertext-policy (hidden access structure). However, although this solution uses reasonably computable decryption policies, it generates the ciphertext of size that is at least, linearly varying with the number of attributes. It also requires additional pairing operations during decryption. We attempt to overcome these limitations in the proposed scheme viz. Ciphertext Policy Attribute Based Encryption with Constant Length (CP-ABE-CL). In our scheme, the ciphertext and secret key remain constant in length, irrespective of the number of attributes chosen. In addition, the decryption algorithm requires fewer and fixed number of pairing operations. Our scheme works for a threshold case: the number of attributes (excluding wildcard attributes) in a policy must be a subset of attributes in a secret key. The proposed scheme supports the positive, negative and wildcard attributes in policy.