Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Searchable symmetric encryption: improved definitions and efficient constructions
Proceedings of the 13th ACM conference on Computer and communications security
Efficient Conjunctive Keyword-Searchable Encryption
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01
Multi-Dimensional Range Query over Encrypted Data
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups
CANS '08 Proceedings of the 7th 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
Provably-secure schemes for basic query support in outsourced databases
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Deterministic and efficiently searchable encryption
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Public key encryption with searchable keywords based on Jacobi symbols
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
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
Linear Algebra: Theory and Applications
Linear Algebra: Theory and Applications
Efficient conjunctive keyword search on encrypted data storage system
EuroPKI 2006 Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice
Privacy preserving keyword searches on remote encrypted data
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Public key encryption with conjunctive field keyword search
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Achieving efficient conjunctive keyword searches over encrypted data
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Public key encryption with conjunctive keyword search and its extension to a multi-user system
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
| Hi-index | 0.00 |
In this article we tackle the issue of searchable encryption with a generalized query model. Departing from many previous works that focused on queries consisting of a single keyword, we consider the the case of queries consisting of arbitrary boolean expressions on keywords, that is to say conjunctions and disjunctions of keywords and their complement. Our construction of boolean symmetric searchable encryption BSSE is mainly based on the orthogonalization of the keyword field according to the Gram-Schmidt process. Each document stored in an outsourced server is associated with a label which contains all the keywords corresponding to the document, and searches are performed by way of a simple inner product. Furthermore, the queries in the BSSE scheme are randomized. This randomization hides the search pattern of the user since the search results cannot be associated deterministically to queries. We formally define an adaptive security model for the BSSE scheme. In addition, the search complexity is in $O(n)$ where $n$ is the number of documents stored in the outsourced server.