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
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
Anonymous hierarchical identity-based encryption (without random oracles)
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Private-Key Hidden Vector Encryption with Key Confidentiality
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Searching keywords with wildcards on encrypted data
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Inner-product encryption under standard assumptions
Designs, Codes and Cryptography
Improved hidden vector encryption with short ciphertexts and tokens
Designs, Codes and Cryptography
Decentralizing attribute-based encryption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Privacy enhanced access control by means of policy blinding
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Lightweight delegated subset test with privacy protection
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Exclusion-intersection encryption
International Journal of Security and Networks
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Anonymity from asymmetry: new constructions for anonymous HIBE
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Dual form signatures: an approach for proving security from static assumptions
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
P3S: a privacy preserving publish-subscribe middleware
Proceedings of the 13th International Middleware Conference
Fully secure hidden vector encryption under standard assumptions
Information Sciences: an International Journal
Fully secure hidden vector encryption
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Controllable privacy preserving search based on symmetric predicate encryption in cloud storage
Future Generation Computer Systems
| Hi-index | 0.00 |
Predicate encryption schemes are encryption schemes in which each ciphertext Ctis associated with a binary attribute vector and keys Kare associated with predicates. A key Kcan decrypt a ciphertext if and only if the attribute vector of the ciphertext satisfies the predicate of the key. Predicate encryption schemes can be used to implement fine-grained access control on encrypted data and to perform search on encrypted data.Hidden vector encryption schemes [Boneh and Waters --- TCC 2007] are encryption schemes in which each ciphertext is associated with a binary vector and each key Kis associated with binary vector with "don't care" entries (denoted with 茂戮驴). Key Kcan decrypt ciphertext if and only if and agree for all ifor which $y_i\ne \star$.Hidden vector encryption schemes are an important type of predicate encryption schemes as they can be used to construct more sophisticated predicate encryption schemes (supporting for example range and subset queries).We give a construction for hidden-vector encryption from standard complexity assumptions on bilinear groups of prime order. Previous constructions were in bilinear groups of composite orderand thus resulted in less efficient schemes. Our construction is both payload-hiding and attribute-hiding meaning that also the privacy of the attribute vector, besides privacy of the cleartext, is guaranteed.