Searching keywords with wildcards on encrypted data

Authors:
Saeed Sedghi;Peter Van Liesdonk;Svetla Nikova;Pieter Hartel;Willem Jonker
Affiliations:
Dept. EWI, DIES, University of Twente, Enschede, The Netherlands;Dept. Math. and Comp. Science, T.U. Eindhoven, Eindhoven, The Netherlands;Dept. EWI, DIES, University of Twente, Enschede, The Netherlands and Dept. ESAT, SCD-COSIC and IBBT, K.U. Leuven, Heverlee, Belgium;Dept. EWI, DIES, University of Twente, Enschede, The Netherlands;Dept. EWI, DIES, University of Twente, Enschede, The Netherlands and Philips Research Laboratories, The Netherlands
Venue:
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Year:
2010

Citing 18
Cited 5

Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Practical Techniques for Searches on Encrypted Data

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Proceedings of the 13th ACM conference on Computer and communications security

13th ACM Conference on Computer and Communications Security 2006
Searchable symmetric encryption: improved definitions and efficient constructions

Proceedings of the 13th ACM conference on Computer and communications security
Attribute-based encryption for fine-grained access control of encrypted data

Proceedings of the 13th ACM conference on Computer and communications security
New constructions of fuzzy identity-based encryption

ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Multi-Dimensional Range Query over Encrypted Data

SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Journal of Cryptology
Delegating Capabilities in Predicate Encryption Systems

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Hidden-Vector Encryption with Groups of Prime Order

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Improved searchable public key encryption with designated tester

Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Private-Key Hidden Vector Encryption with Key Confidentiality

CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
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
Privacy preserving keyword searches on remote encrypted data

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Fuzzy identity-based encryption

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
Practical identity-based encryption without random oracles

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

Adaptive secure-channel free public-key encryption with keyword search implies timed release encryption

ISC'11 Proceedings of the 14th international conference on Information security
Ciphertext-policy delegatable hidden vector encryption and its application to searchable encryption in multi-user setting

IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Conjunctive keywords searchable encryption with efficient pairing, constant ciphertext and short trapdoor

PAISI'12 Proceedings of the 2012 Pacific Asia conference on Intelligence and Security Informatics
Secure keyword search using bloom filter with specified character positions

ProvSec'12 Proceedings of the 6th international conference on Provable Security
Fully secure hidden vector encryption

Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption key is also derived from such a vector, but this one is also allowed to have "*" (or wildcard) entries. Decryption is possible as long as these tuples agree on every position except where a "*" occurs. These schemes are useful for a variety of applications: they can be used as a building block to construct attribute-based encryption schemes and sophisticated predicate encryption schemes (for e.g. range or subset queries). Another interesting application - and our main motivation - is to create searchable encryption schemes that support queries for keywords containing wildcards. Here we construct a new HVE scheme, based on bilinear groups of prime order, which supports vectors over any alphabet. The resulting ciphertext length is equally shorter than existing schemes, depending on a trade-off. The length of the decryption key and the computational complexity of decryption are both constant, unlike existing schemes where these are both dependent on the amount of non-wildcard symbols associated to the decryption key. Our construction hides both the plaintext and public key used for encryption. We prove security in a selective model, under the decision linear assumption.