Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
An explication of secret sharing schemes
Designs, Codes and Cryptography
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
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
Attribute-based encryption with non-monotonic access structures
Proceedings of the 14th ACM conference on Computer and communications security
Provably secure ciphertext policy ABE
Proceedings of the 14th ACM conference on Computer and communications security
Delegating Capabilities in Predicate Encryption Systems
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Bounded Ciphertext Policy Attribute Based Encryption
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Multi-authority attribute based encryption
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
Fully secure functional encryption with general relations from the decisional linear assumption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Expressive key-policy attribute-based encryption with constant-size ciphertexts
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Unbounded HIBE and attribute-based encryption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
New techniques for dual system encryption and fully secure HIBE with short ciphertexts
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
On the size of monotone span programs
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
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
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
In this paper, we present an efficient ciphertext-policy attribute based encryption (CP-ABE) scheme with "short" ciphertext and a key-policy attribute based encryption (KP-ABE) scheme with "short" key for monotone access structures (MAS) which are fully secure in the standard model over composite order bilinear groups. We obtain our schemes by using a simple "encoding technique", representing the monotone access structure by their minimal sets only, thereby obtaining schemes whose ciphertext size or key size depends on number of minimal sets. Most of the recent CP-ABE/KP-ABE schemes have ciphertext size or key size roughly of the order of the size of the monotone span program (MSP) or the number of attributes. Consequently, our schemes will, in general, have shorter ciphertext or shorter key. To illustrate, we give examples of MAS where the number of minimal sets is constant whereas the size of the corresponding MSP is linear in the number of attributes. Using similar ideas, we show how to obtain a CP-ABE scheme with constant size key and a Hierarchical (H) KP-ABE scheme with constant size ciphertext for arbitrary access structures (not necessarily monotone) which are also fully secure in the standard model under three static assumptions over composite order bilinear groups. To date, for all general policies, the decryption cost is polynomial in the number of qualified rows in the span programs. But in all of our proposed schemes, the decryption cost is contant for general access structures.