Attribute-based encryption for fine-grained access control of encrypted data
Proceedings of the 13th ACM conference on Computer and communications security
Multi-Dimensional Range Query over Encrypted Data
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Hidden-Vector Encryption with Groups of Prime Order
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Predicate Privacy in Encryption Systems
TCC '09 Proceedings of the 6th Theory of Cryptography 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
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Anonymous hierarchical identity-based encryption (without random oracles)
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Searching keywords with wildcards on encrypted data
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Improved hidden vector encryption with short ciphertexts and tokens
Designs, Codes and Cryptography
Lightweight delegated subset test with privacy protection
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Controllable privacy preserving search based on symmetric predicate encryption in cloud storage
Future Generation Computer Systems
Proceedings of the 4th ACM conference on Data and application security and privacy
| Hi-index | 0.00 |
Predicate encryption is an important cryptographic primitive that has been recently studied [BDOP04, BW07, GPSW06, KSW08] and that has found wide applications. Roughly speaking, in a predicate encryption scheme the owner of the master secret key K can derive secret key $\tilde K$, for any pattern vector k . In encrypting a message M , the sender can specify an attribute vector x and the resulting ciphertext $\tilde X$ can be decrypted only by using keys $\tilde K$ such that P (x , k ) = 1, for a fixed predicate P . A predicate encryption scheme thus gives the owner of the master secret key fine-grained control on which ciphertexts can be decrypted and this allows him to delegate the decryption of different types of messages (as specified by the attribute vector) to different entities. In this paper, we give a construction for hidden vector encryption which is a special case of predicate encryption schemes introduced by [BW07]. Here the ciphertext attributes are vectors x = ***x 1 ,...x l *** over alphabet Σ, key patterns are vectors k = ***k 1 ,...k l *** over alphabet Σ *** {*} and we consider the Match(x, k) predicate which is true if and only if k i *** * implies x i = k i . Besides guaranteeing the security of the attributes of a ciphertext, our construction also gives security guarantees for the key patterns. We stress that security guarantees for key patterns only make sense in a private-key setting and have been recently considered by [SSW09] which gave a construction in the symmetric bilinear setting with groups of composite (product of four primes) order. In contrast, our construction uses asymmetric bilinear groups of prime order and the length of the key is equal to the weight of the pattern, thus resulting in an increased efficiency. We remark that our construction is based on falsifiable (in the sense of [BW06, Nao03]) complexity assumptions for the asymmetric bilinear setting and are proved secure in the standard model (that is, without random oracles).