Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Communications of the ACM
How to Enhance the Security of Public-Key Encryption at Minimum Cost
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Efficient ID-based Broadcast Threshold Decryption in Ad Hoc Network
IMSCCS '06 Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences - Volume 2 (IMSCCS'06) - Volume 02
Escrow-free encryption supporting cryptographic workflow
International Journal of Information Security
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
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
A Taxonomy of Pairing-Friendly Elliptic Curves
Journal of Cryptology
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Multi-authority attribute based encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
CCA2-secure threshold broadcast encryption with shorter ciphertexts
ProvSec'07 Proceedings of the 1st international conference on Provable security
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
Extensions of access structures and their cryptographic applications
Applicable Algebra in Engineering, Communication and Computing
Policy-based cryptography and applications
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Fuzzy identity-based encryption
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Generic constructions for chosen-ciphertext secure attribute based encryption
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
A practical (non-interactive) publicly verifiable secret sharing scheme
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
Attribute-based encryption schemes with constant-size ciphertexts
Theoretical Computer Science
Dynamic attribute-based signcryption without random oracles
International Journal of Applied Cryptography
Dynamic attribute-based signcryption without random oracles
International Journal of Applied Cryptography
Short attribute-based signatures for threshold predicates
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Hidden access structure ciphertext policy attribute based encryption with constant length ciphertext
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Threshold ciphertext policy attribute-based encryption with constant size ciphertexts
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Efficient fully secure attribute-based encryption schemes for general access structures
ProvSec'12 Proceedings of the 6th international conference on Provable Security
A general construction for multi-authority attribute-based encryption
AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
A ciphertext policy attribute-based encryption scheme without pairings
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Efficient ciphertext-policy attribute based encryption with hidden policy
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
Attribute-based cryptography has emerged in the last years as a promising primitive for digital security. For instance, it provides good solutions to the problem of anonymous access control. In a ciphertext-policy attribute-based encryption scheme, the secret keys of the users depend on their attributes. When encrypting a message, the sender chooses which subset of attributes must be held by a receiver in order to be able to decrypt. All current attribute-based encryption schemes that admit reasonably expressive decryption policies produce ciphertexts whose size depends at least linearly on the number of attributes involved in the policy. In this paper we propose the first scheme whose ciphertexts have constant size. Our scheme works for the threshold case: users authorized to decrypt are those who hold at least t attributes among a certain universe of attributes, for some threshold t chosen by the sender. An extension to the case of weighted threshold decryption policies is possible. The security of the scheme against selective chosen plaintext attacks can be proven in the standard model by reduction to the augmented multi-sequence of exponents decisional Diffie-Hellman (aMSE-DDH) problem.